Jack was having a candle light dinner with his girlfriend. Suddenly a cold gush of wind entered through the open window and three of the ten candles were extinguished. Assuming that none of the other candles were extinguished.
A Japanese ship is sailing in the Indian Ocean. The captain of the ship feels tired and decides to take shower to be rejuvenated. He goes to take the shower after keeping his diamond-studded Rolex watch and gold chain on the table.
When he comes back after 15 minutes, he finds them missing. There are 4 crew members on the ship and he calls them one by one to ask them what they were doing in that duration.
Following are the answers:
1. Crew 'A' who is the cook replies that he was cooking mutton for the crew members.
2. Crew 'B' who is a housekeeper tells that he was sleeping in his room.
3. Crew 'C' who is the engineer says that he was checking on the generator.
4. Crew 'D' who is another housekeeper says that he was correcting the hoisted flag that was put upside down.
It took only a couple of seconds for the captain to find the thief. Can you find the thief too?
Two boys wish to cross a river. The only way to get to the other side is by boat, but that boat can only take one boy at a time. The boat cannot return on its own, there are no ropes or similar tricks, yet both boys manage to cross using the boat.
Two friends decide to get together; so they start riding bikes towards each other. They plan to meet halfway. Each is riding at 6 MPH. They live 36 miles apart. One of them has a pet carrier pigeon and it starts flying the instant the friends start traveling. The pigeon flies back and forth at 18 MPH between the 2 friends until the friends meet.
A mules travels the same distance daily.
I noticed that two of his legs travels 10km and the remaining two travels 12km.
Obviously two mules legs cannot be a 2km ahead of the other 2.
The mules is perfectly normal. So how come this be true ?
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?