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?

You walk into an old horror house. It has no power or plumbing. Once inside, you see three doors. Each door has a number on it. Behind each door is a way for you to die. Behind door number one, you die by getting eaten by a lion. Behind door number two, you die by getting murdered. Behind door number three, you die by an electric chair. You can’t turn back, so you have to go through a door. Which door do you go through?

A Club organizes a Running Race, and John, Jacob, Minda, and Tony participated.

The results are as follows

John beats Jacob
Minda beats Toni
Toni beats John

Who came first in the race?

I am never scared but became petrified and can’t live in a house but would die to make one. What am I?

You need to climb ten stairs. At every stair, you can either take one step up or you can jump two steps up.

In how many different ways you can climb 10 stairs?

The barber of Town shaves all men living in the town. No man living in the town is allowed to shave himself. The barber lives in that town. Who then shaves the barber of the town?

In the attached figure, you can see a chessboard and two rooks placed on the chess board. What you have to find is the number of squares that do not contain the rooks. How many are there?

John enters a small room. The Door Closes.
When the door opens, John is in a larger room.

Explain?

Can you convert the number zero(0) into a positive number using just one mathematical operator ?

I’m tall when I’m young, and I’m short when I’m old. What am I?