O_er_t_o_

Complete the missing letters of the given word.

A family is trapped in a jungle. There is a bridge which can lead them to safety. But at one time, the bridge can only allow two people to pass through. Also, all of them are afraid of the dark and thus, they can't go alone.

Father takes 1 minute to cross, the mother takes 2 minutes, the son takes 4 and the daughter takes 5 minutes. While crossing the time taken will be according to the slower one. How can they all reach the other side in the minimum possible time?

Trying to tease Birbal, Akbar gave him one gold coin and ask him to buy
* something for him to eat
* something for him to drink.
* something to feed the cows
* something to plant in the garden
and most important you need to buy only one thing.

What must Birbal buy to silence Akbar?

You walk into a creepy house by yourself. There is no electricity, plumbing, or ventilation. Inside you notice 3 doors with numbers on them. Once you open the doors you will die a particular way. Door No.1 You’ll be eaten by a lion who is hungry. Door No.2 You’ll be stabbed to death. Door No.3 There is an electric chair waiting for you. Which door do you pick?

1 + 9 + 8 = ?
considering, 28 + 8 + 92 = 10

Can you find a number that lies one third of the distance between 1/3 and 2/3?

Sherlock breaks into a crime scene. The victim is the owner who is slumped dead on a chair and have a bullet hole in his head. A gun lies on the floor and a cassette recorder is found on the table. On pressing the play button, Sherlock hears the message 'I have committed sins in my life and now I offer my soul to the great Lord' and followed a gunshot Sherlock smiles and informed the police that's its a murder.

Why did he think so?

Using the clues below, what four numbers am I thinking of?

The sum of all the numbers is 31.
One number is odd.
The highest number minus the lowest number is 7.
If you subtract the middle two numbers, it equals two.
There are no duplicate numbers.

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?

I have two coins.
* One of the coins is a faulty coin having a tail on both sides of it.
* The other coin is a perfect coin (heads on side and tail on other).

I blindfold myself and pick a coin and put the coin on the table. The face of the coin towards the sky is the tail.

What is the probability that another side is also tail?