Infosys Puzzles Quiz – 1

If A takes 1 step in one second, then B takes 3 steps in one second.

If A takes t1 seconds to take 50 steps, then B takes 150 steps in t1 seconds.

For B, to take 150 steps he requires t1 seconds, then to take 75 steps he requires \frac{t1}{2} seconds.

So now, s1=50, t1 = t1 & s2=75, t2= \frac{t1}{2} seconds

So, \frac{s2 \times t1 - s1 \times t2}{t1 - t2}

\frac{75 \times t1 - 50 \times \frac{t1}{2}}{t1 - \frac{t1}{2}}

\frac{150t1 - 50t1}{t1} = 100

Thus there are 100 steps in the stationary escalator

 

The answer is wrong on almost all the websites.

Answer is of-course Afternoon, but A can be either Shahrukh or Salman. Here is the complete solution:
A says B is Shahrukh.

Assume it is morning,

Case I: A is actually Shahrukh. He always speaks truth in morning. NOT POSSIBLE.

Case II: A is actually Salman. He always lies in morning. NOT POSSIBLE

Assume it is afternoon,

Case I: A is actually Shahrukh. He always lies in the afternoon and thus says B is Shahrukh. POSSIBLE.

Case II: A is actually Salman. He always speaks truth in the afternoon. POSSIBLE.

Therefore, it is afternoon and A can be either Shahrukh or Salman

1. Only 0 1 6 8 and 9 can be read upside down.


2. 0 cannot be in the left end as it becomes a four digit number


3. In ten thousands place difference is 7. units place difference is 3
   this is possible only through 8,1 numbers (8-1 = 7 )and(11-8 = 3 ) another pair is 6,9 but we cannot get 7 from that pair.So in actual number plate ones place is 8 and ten thousands place is 1.


4.  In thousands place we have to get the difference is 8 and tenths place difference have to get 3 ( the only one possible way is (9-1 -0)and (10-1-6) because 1, 8 already placed at the end positions.

The figure can be divided into 12 equal triangles.

So, the right answer would be:

1. According to L, other 4 friends have money , other 4 friends here refers to M, N, O, P, as he is lying, L has the money.

2. According to M, P said that exact one has money , as he is lying, P is not telling  that exactly one has the money, so O, L, N must have said that one has the money, as they are liers, 3 can have the money.

3. According to N, L said that precisely 2 have money, as he is lying, L did not say that 2 have the money, so P, M, O said that two will have the money. As P, M, O are liers, two of them can have the money.

4. According to O, M said that 3 have money, as he is lying, M did not say that 3 have the money, so P, L, N must have said that 3 have the money. As P, L, N are also liers, one will have the money.

5. According to P, L and N said that they have money, as he is lying, L and N did not say that they have the money, so M and O must have said that they have the money. As M, O are also liers, L and N will have the money.

So conclusions of the statements

As statements (2) and (4) contridict each other, they can be neglected.

From statements (3) and (5), the two people wh0 have the money are L and N.

From statement (1), it can be concluded that L has the money.

But there is no substantial evidences to confirm that N has the money. Thus L has the money

Given that as the fifth person leaves, total bread is 0.

Let the total bread be x and at each step, the burglar eat x/2 + 1/2 bread

Therefore, in the previous step, the bread eaten is x - (x/2 +1/2) = x/2 - 1/2

Before, fifth burglar enters the shop , we have  : x/2 - 1/2 = 0 => x = 1

Before, fourth burglar enters the shop , we have: x/2 - 1/2 = 1 => x = 3

Before, third burglar enters the shop , we have : x/2 - 1/2 = 3 => x = 7

Before, second burglar enters the shop , we have : x/2 - 1/2 = 7 => x = 15

Before, first burglar enters the shop , we have : x/2 - 1/2 = 15 => x = 31

Condition

Only one is lying

Assume democratic wins the elections, then A and B are right and C is wrong which satisfies the condition

Assume Liberal wins the elections, then only A is right and the condition is not satisfied

Thus Democratic wins the elections

Arithmetically it'll be solved in 8 minimum weighings.

Explain:6561 balls.
If you notice it is in the form of  3^{8n} can be divided by 3(prime factor) only…we keep on dividing it into sets of 3 and in 1 weighing itself you can determine which set is heavy.
Divide that set into further 3 lots…keep doing that like,
6561
2187 2187 2187 - 1st weighing
729 729 729 - 2nd weighing
243 243 243 - 3rd weighing
81 81 81 - 4th weighing
27 27 27 - 5th weighing
9 9 9 - 6th weighing
3 3 3 - 7th weighing
1 1 1 - 8th weighing

So, it would be 8 attempts

The frog jumps 3 feet and comes back 2 feet in a day, covering (3 - 2) feet = 1 feet per day.

So, on 27th day, it covers 27 feet

On the 28th day, it jumps 3 feet from 27 feet =  (27 +3) = 30 feet

(3-2) \times 27 +3 \times 1

total days=28