What has a ring but no finger?

What occurs twice in a week, once in a year but never in a day?

Find the Goldfish below the given Image.

A man and a dog were going down the street. The man rode, yet walked. What was the dog’s name?

An inspection by the superintendent of St. Joseph School was scheduled on the next day. The class teacher Jenifer knew that he would be asking questions from her class and she would have to choose a pupil to answer. To offer a perfect impression over him, the teacher explained certain instructions to the students to maximise the chances of getting correct answer every time.

What did she say to the students?

The host of a game show, offers the guest a choice of three doors. Behind one is a expensive car, but behind the other two are goats.
After you have chosen one door, he reveals one of the other two doors behind which is a goat (he wouldn't reveal a car).

Now he gives you the chance to switch to the other unrevealed door or stay at your initial choice. You will then get what is behind that door.

You cannot hear the goats from behind the doors, or in any way know which door has the prize.

Should you stay, or switch, or doesn't it matter?

There are nine letters in the below-given diagram. You have to form a nine-letter word using these letters.

Birbal was jester, counsellor, and fool to the great Moghul emperor, Akbar.
The villagers loved to talk of Birbal's wisdom and cleverness,
and the emperor loved to try to outsmart him.
One day Akbar (emperor) drew a line across the floor.
"Birbal," he ordered, "you must make this line shorter, but you cannot erase any bit of it."
Everyone present thought the emperor had finally outsmarted Birbal.
It was clearly an impossible task.
Yet within moments the emperor and everyone else present had to agree that Birbal had made the line shorter without erasing any of it.
How could this be?

A bomb exploded in a room full of married couples and no one died. How?

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?