A beggar on the street can make one cigarette out of every 6 cigarette butts he finds. After one whole day of searching and checking public ashtrays the beggar finds a total of 72 cigarette butts. How many cigarettes can he make and smoke from the butts he found?

Three people are in a room. Ronni looks at the Nile. The Nile looks at Senthil. Ronni is married but Senthil is not married. At any point, is a married person looking at an unmarried person? Yes, No or Cannot be determined.

What number does the below three word/phrase identify and why?
1. Deck
2. Year
3. Singing in the Rain

Three logicians went to bar for having a drink. The bar person asks the logicians "Do they all want to have the drink?". The first logician replied, " I don't know". The second logician replied, " I don't know". What is the reply of the last logician?

Can you find out the number of the parking space in which the car is parked?

Find the missing number in the sequence below:

Can you solve the equation by finding the value of
A) Horse
B) Cowboy boot
C) Horseshoe

In the Picture?

Three friends named Mr. Black, Mr. Yellow and Mr. Green enter a pub on a weekend night. They are wearing either a Black, Yellow or Green shirt.

Mr. Yellow says to them, 'Did you notice that we all are wearing different color shirts than our names?'

To this, the man who was wearing the Green shirt said. 'Wow, thats right.'

Can you identify who is wearing which colour shirt ?

John is on an island and there are three crates of fruit that have washed up in front of him. One crate contains only apples. One crate contains only oranges. The other crate contains both apples and oranges.

Each crate is labelled. One reads 'apples', one reads 'oranges', and one reads 'apples and oranges'. He know that NONE of the crates have been labeled correctly - they are all wrong.

If he can only take out and look at just one of the pieces of fruit from just one of the crates, how can he label all of the crates correctly?

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?