If you say my name, I will no longer exist. What am I?

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 can you serve, but never eat?

At a party, there are five people and a whole round cake lying at the centre of the table. Only four people will make a cut and take their piece and the last one will get the remaining piece on the table. How can they make sure that everyone gets a 1/5th of the piece?

A thief enters a store and threatens the clerk, forcing her to open the safe. The clerk says, “The code for the safe is different every day, and if you hurt me you’ll never get the code.” But the thief manages to guess the code on his own. How did he do it?

A man was telling some of his war stories to his grandchildren.
"When the World War I was on the verge of end, I was awarded for my bravery for I had saved a group of my men." He coughed and then added, "When we were fighting in northern France, an enemy soldier threw a grenade at us. Before it could explode, I picked it up and threw it away. For my act of bravery, right before the war ended, A General gave me a sword engraved with the words "Awarded for Display of Bravery and Heroism in World War 1"."

Hearing this, one of the grandson spoke up. "Grandpa, this is not a true story. It can"t be true!"

The truth is that it was not. How did the grand children know it?

How many people must be gathered together in a room, before you can be certain that there is a greater than 50/50 chance that at least two of them have the same birthday?

In an interview, a boy was asked an unusual question 'How two persons sitting with a table in between them can't see each other?' He was unable to reply. Can you?

What is the four-digit number in which the first digit is one-third the second, the third is the sum of the first two, and the last is three times the second?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?