I am a word of 12 alphabets.

* Alphabets 12, 4, 7, 2, 5 : Eastern beast of burden
* Alphabets 1, 8, 10, 9 are street made famous by Sinclair Lewis.
* Alphabets 11, 3, 6 are past.

On whole it means a person suffering from delusions of greatness.

What Is it ?

In 1990, a person is 15 years old. In 1995, that same person is 10 years old. How can this be?

Can you find out the next digit in the following series ?

0, 0, 1, 3, 2, 6, 3, 9, 4, 12, 5, ?

I have an apple tree , number of apple in this tree get doubles every week.

On 30th week , the tree gets completely filled with apples :-)



Can you tell me , on what week does my tree is half covered with apples ?

A Car driver was heading down a street in Washington. He went right past a stop sign without stopping, he turned left where there was a 'no left turn' sign and he went the wrong way on a one-way street. Then he went on the right side of the road past a cop car. Still, he didn't break any traffic laws. Why not?

What demands an answer, but asks no questions

You enter your friend's room. He is not in his room. Although you see that on the bed there are two dogs, five cats, two giraffes and three pigs. Also, a couple of chickens and ducks are flying in the room.

Calculate the number of legs standing on the floor.

John speaks the truth only once a day in a week. Below are a few hints for you:

First: Days are Sunday, Monday and so on.
Second: One day he says, "I lie on Monday and Tuesday".
Third: On the next day, he says, "Today is either Thursday, Saturday or Sunday".
Fourth: On the next day, he says, "I lie on Wednesday and Friday".

Can you identify the day on which he speaks the truth?

A man had five children. He had $100 with him to give to his children. He decided to start with the youngest child and then give $2 more than each younger child to his next elder child.

For example, if he gives $x to the youngest child, he will give $(x+2) to the next one, $[(x+2) + 2] to the next one and so on.

Can you find out how much did the youngest one receive?

A swan sits at the center of a perfectly circular lake. At an edge of the lake stands a ravenous monster waiting to devour the swan. The monster can not enter the water, but it will run around the circumference of the lake to try to catch the swan as soon as it reaches the shore. The monster moves at 4 times the speed of the swan, and it will always move in the direction along the shore that brings it closer to the swan the quickest. Both the swan and the the monster can change directions in an instant.
The swan knows that if it can reach the lake's shore without the monster right on top of it, it can instantly escape into the surrounding forest.

How can the swan successfully escape?