Readymade garments trading Interview Questions, Process, and Tips

The answer for this question is very simple: it is called Ceaser Cipher.
It consists of replacing a character by another located in (current character position + (key-1)), where key = how many positions you want to skip.
For Example: VICTORY -> YLFWRUB with the key = 3.
Then SUCCESS -> QXFFHQQ

Note: it should work like a circle(Z+1 = A).

A

1875

1 : 2

37 SEATS….
because if passengers will occupy 3 seats, per head amount
payable will be 26.89.80.67 can not be divisible other than
3 and 26.89. so the,
Number of occupied seats will be 3
Number of unoccupied seats will be 40-3=37

4/5

22.5

16

Answer: 3121 gold coins
Let total no of coins be M
Let the disbursement D to each son:

D1 = 1 + (M – 1)/5 = (M + 4)/5
D2 = 1 + ( M – D1 -1)/5 = (D1) * 4/5
D3= (D2) * 4/5
D4= (D3) * 4/5
D5= (D4) * 4/5
Total disbursements to sons=
= ∑D= (M+4)*1/5[ 1+4/5+(4/5)(4/5)+ (4/5)(4/5)(4/5)+(4/5)(4/5)(4/5)(4/5) ]
= (2101/3125)*(M+4)
Thus balance left for daughters =M-{(2101/3125)*(M+4)}
=(1024M-8404)/3125
This balance should be a positive integer ( assuming M and all disbursements are full coins )
Thus 1024M-8404 should be a multiple of 3125….so….
1024M – 8404 = N*3125 where N is an integer
Using Python code:
n=int(input(“Enter num n: “))
X=int()
a=int()
a=0
X=’ ‘
for a in range(0,n+1):
a=a+1
X= (3125*a + 8404)/1024
if (3125*a + 8404)% 1024== 0:
print(X,a)
Enter num n: 10000
3121.0 1020
6246.0 2044
9371.0 3068
12496.0 4092
15621.0 5116
18746.0 6140
21871.0 7164
24996.0 8188
28121.0 9212
We get minimum value of N = 1021 and M = 3121 gold coins

0

x,y sides of rectangle
area=xy
increased by 100% =double length
hence
new area=4xy
increased area=4xy-xy=3xy
percentage of area will be increased
by 300%

original cost is 100^2 / (100^2 – p^2) Rs

transistor is a semiconductor device for amplifying ,controlling and generating the electrical signals.

C

That person’s struggle and dream to achieve something motivates the person.