Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?

What has a bottom at the top?

There is a five-letter word which has 3 consonants(all are same) and 2 different vowels.
Also, something wrong is associated with the word.

Can you name it?

If 5 cats catch 5 mice in 5 minutes, how long will it take one cat to catch a mouse?

Can you find out who is the kidnapper in below Picture and why, Explain ?

The chance of Mr John winning the lottery is 10%. All participants lined up and Mr John is 4th in the row. The first three participants lose the lottery.

What is the chance of Mr John now?

What jumps when it walks and sits when it stands?

A detective visits his friend John just to discover that John's neighbour Dr Jacob was murdered. Dr Jacob, who is a mathematician wrote the murderer's name in a code word "Hcqtfz". There were five suspects
1. Ajit
2. Pankaj
3. Ganpat
4. Deenu
5. Hariya

The Detective was instantly able to find the murderer.
Can you?

You are trapped in a room with two doors. One leads to certain death and the other leads to freedom. You don't know which is which.
There are two robots guarding the doors. They will let you choose one door but upon doing so you must go through it.
You can, however, ask one robot one question. The problem is one robot always tells the truth, the other always lies and you don't know which is which.
What is the question you ask?

You are given 2 eggs.
You have access to a 100-storey building.
Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100th floor, Both eggs are identical.
You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking.
Now the question is how many drops you need to make. You are allowed to break 2 eggs in the process