A Bear has fallen from a height of 10m from ground. It reached ground in sqrt(2) seconds. Luckily it didn’t get hurt.

**What is the color of that Bear? Prove it scientifically.**

A Bear has fallen from a height of 10m from ground. It reached ground in sqrt(2) seconds. Luckily it didn’t get hurt.

**What is the color of that Bear? Prove it scientifically.**

**There are 25 horses. We have to find out the fastest 3 horses. In one race maximum 5 horses can run. How many such r****aces are required in minimum to get the result ?**

There is a one person who have two numbers, he tells sum to the person S and product of those numbers to P.

Now there is this conversion between S and P.

S: I don’t know what are the numbers.

P: I also don’t know what are the numbers.

S: Now i know what are the numbers.

P: Now i also know what are the numbers.

Assuming S and P to be very wise and good in mathematics, **What are those two numbers**?

Note: Numbers are greater than 0.

There are two tribes in Mars, **Lie tribe** and **Truth Tribe**.

Lie tribe always speaks lie, True tribe always speaks truth.

You meet three mars people and ask

From** First Person**: What tribe you belong to?, he replies something in his language which you don’t understand.

**Second person** tells that he is saying that he belongs to Lie Tribe.

**Third person** says that second person is lying.

**What tribe does the third person belong to?**

There is a drum full of milk, people come for buying milk in the range of 1-40 litres. You can have only 4 cans to draw milk out of drum. tell me what should be the measurement of these four cans so that you can measure any amount of milk in the range of 1-40 litres.

**Note:** idea is to minimise the efforts to draw the milk, also you are allowed to take back the milk from bigger can to small can

There are 10 black socks and 10 white socks in a drawer.

Now you have to go out wearing your shoes.

**So how many maximum number of times you need to remove the sock from drawer so that you can go out?**

You can remove only 1 sock at a time.

Obviously, you can’t go outside wearing different socks!

There are n bulbs in a circle, each bulb has one switch associated with it, on operating the switch, it toggles the state of the corresponding bulb as well as two bulbs adjacent to that one. Given all bulbs are in off state initially, give a plan to turn all bulbs on finally.

Note: n >= 1.

[Read more…]

A farmer is returning from market, where he bought a she-goat, a wolf and cabbage. On the way home he must cross a river. His boat is little, allowing him to take only one of the three things. He can’t keep the she-goat and the cabbage together (because the she-goat would eat it), nor the she-goat with the wolf (because the she-goat would be eaten). How shall the farmer get everything on the other side (without any harm)?

One fine day, Santa and banta were playing cards, but suddenly power went off and they were getting bored. So santa randomly inverted position of 10 cards out of 52 cards(and shuffled it) and asked banta to divide the card in two pile with equal number of inverted cards(number of cards in each pile need not be equal). It was very dark in the room and banta could not see the cards, after thinking a bit banta divided the cards in two piles and quite surprisingly on counting number of inverted cards in both the piles were equal.

[Read more…]

Four glasses are placed on the **corners of a square table**. Some of the glasses are upright (up) and some upside-down (down). You have to arrange the glasses so that they are all up or all down (while keeping your eyes closed all the time). The glasses may be re-arranged in turns subject to the following rules.

- Any two glasses may be inspected in one turn and after feeling their orientation you may reverse the orientation of either, neither or both glasses.
- After each turn table is rotated through a random angle.
- At any point of time if all four glasses are of the same orientation a ring will bell

You have to come up with a solution to ensure that all glasses have the same orientation (either up or down) in a **finite number of turns**. The algorithm must be non-stochastic i.e. **it must not depend on luck**.

[Read more…]