Puzzles Page 8
 

More Puzzles

Page 1

Page 2

Page 3

Page 4

Page 5

Page 6

Page 7

Page 8

Page 9

 
Freshers Resources

QA & Testing

Data WareHousing Computer Science Analysis  Design Operating Systems
C++ Mainframes Sap/Abap Databases HR VB
Java Jobs C#

.Net

VC++ ASP

A contractor had employed 100 labourers for a flyover construction task. He did not allow any woman to work without her husband. Also, atleast half the men working came with their wives.

He paid five rupees per day to each man, four ruppes to each woman and one rupee to each child. He gave out 200 rupees every evening.

How many men, women and children were working with the constructor?
Answer

16 men, 12 women and 72 children were working with the constructor.

Let's assume that there were X men, Y women and Z children working with the constructor. Hence,

X + Y + Z = 100
5X + 4Y + Z = 200

Eliminating X and Y in turn from these equations, we get
X = 3Z - 200
Y = 300 - 4Z

As if woman works, her husband also works and atleast half the men working came with their wives; the value of Y lies between X and X/2. Substituting these limiting values in equations, we get

if Y = X,
300 - 4Z = 3Z - 200
7Z = 500
Z = 500/7 i.e. 71.428

if Y = X/2,
300 - 4Z = (3Z - 200)/2
600 - 8Z = 3Z - 200
11Z = 800
Z = 800/11 i.e. 72.727

But Z must be an integer, hence Z=72. Also, X=16 and Y=12

There were 16 men, 12 women and 72 children working with the constructor.

Because cigars cannot be entirely smoked, a Bobo who collects cigar butts can make a cigar to smoke out of every 3 butts that he finds.

Today, he has collected 27 cigar butts. How many cigars will he be able to smoke?
Answer

13 not 12

He makes 9 originals from the 27 butts he found, and after he smokes them he has 9 butts left for another 3 cigars. And then he has 3 butts for another cigar.

So 9+3+1=13
In a small town, there are three temples in a row and a well in front of each temple. A pilgrim came to the town with certain number of flowers.

Before entering the first temple, he washed all the flowers he had with the water of well. To his surprise, flowers doubled. He offered few flowers to the God in the first temple and moved to the second temple. Here also, before entering the temple he washed the remaining flowers with the water of well. And again his flowers doubled. He offered few flowers to the God in second temple and moved to the third temple. Here also, his flowers doubled after washing them with water. He offered few flowers to the God in third temple.

There were no flowers left when pilgrim came out of third temple and he offered same number of flowers to the God in all three temples.

What is the minimum number of flowers the pilgrim had initially? How many flower did he offer to each God?
Answer


The pilgrim had 7 flowers, initially and he offered 8 flowers to each God.

Assume that the pilgrim had X flowers initially and he offered Y flowers to each God.

From the above figure, there are (8X - 7Y) flowers when the pilgrim came out of the third temple. But it is given that there were no flowers left when he came out of third temple. It means that
(8X - 7Y) = 0
8X = 7Y

The minimum values of X and Y are 7 and 8 respectively to satisfy above equation. Hence, the pilgrim had 7 flowers and he offered 8 flowers to each God.

In general, the pilgrim had 7N flowers initially and he offered 8N flowers to each God, where N = 1, 2, 3, 4, .....

    Brain Teaser No : 00432

Tanya wants to go on a date and prefers her date to be tall, dark and handsome.
1. Of the preferred traits - tall, dark and handsome - no two of Adam, Bond, Cruz and Dumbo have the same number.
2. Only Adam or Dumbo is tall and fair.
3. Only Bond or Cruz is short and handsome.
4. Adam and Cruz are either both tall or both short.
5. Bond and Dumbo are either both dark or both fair.
Who is Tanya's date?

Answer

Cruz is Tanya's date.

As no two of them have the same number of preferred traits - from (1), exactly one of them has none of the preferred traits and exactly one of them has all the preferred traits.

From (4) and (5), there are only two possibilities:
* Adam & Cruz both are tall and Bond & Dumbo both are fair.
* Adam & Cruz both are short and Bond & Dumbo both are dark.

But from (2), second possibility is impossible. So the first one is the correct possibility i.e. Adam & Cruz both are tall and Bond & Dumbo both are fair.

Then from (3), Bond is short and handsome.

Also, from (1) and (2), Adam is tall and fair. Also, Dumbo is the person without any preferred traits. Cruz is Dark. Adam and Cruz are handsome. Thus, following are the individual preferred traits:

Cruz - Tall, Dark and Handsome
Adam - Tall and Handsome
Bond - Handsome
Dumbo - None :-(

Hence, Cruz is Tanya's date.
Consider a game of Tower of Hanoi (like the one that you can play on BrainVista).

If the tower has 2 discs, the least possible moves with which you can move the entire tower to another peg is 3.

If the tower has 3 discs, the least possible moves with which you can move the entire tower to another peg is 7.

What is the least possible moves with which you can move the entire tower to another peg if the tower has N discs?
Submitted
Answer

There are number of ways to find the answer.

To move the largest disc (at level N) from one tower to the other, it requires 2(N-1) moves. Thus, to move N discs from one tower to the other, the number of moves required is
= 2(N-1) + 2(N-2) + 2(N-3) + ..... + 22 + 21 + 20
= 2N - 1


For N discs, the number of moves is one more than two times the number of moves for N-1 discs. Thus, the recursive function is
F(1) = 1
F(N) = 2*[F(N-1)] + 1
where N is the total number of discs


Also, one can arrive at the answer by finding the number of moves for smaller number of discs and then derive the pattern.
For 1 disc, number of moves = 1
For 2 discs, number of moves = 3
For 3 discs, number of moves = 7
For 4 discs, number of moves = 15
For 5 discs, number of moves = 31

Thus, the pattern is 2N – 1
A boy found that he had a 48 inch strip of paper. He could cut an inch off every second.

How long would it take for him to cut 48 pieces? He can not fold the strip and also, can not stack two or more strips and cut them together.
SubmiAnswer

47 seconds.

To get 48 pieces, the boy have to put only 47 cuts. i.e. he can cut 46 pieces in 46 seconds. After getting 46 pieces, he will have a 2 inches long piece. He can cut it into two with just a one cut in 1 second. Hence, total of 47 seconds.tted by : Kimi

The cricket match between India and Pakistan was over.
 Harbhajan scored more runs than Ganguly.
 Sachin scored more runs than Laxman but less than Dravid
 Badani scored as much runs as Agarkar but less than Dravid and more than Sachin.
 Ganguly scored more runs than either Agarkar or Dravid.
Each batsman scored 10 runs more than his immediate batsman. The lowest score was 10 runs. How much did each one of them score
Answer

A simple one. Use the given facts and put down all the players in order. The order is as follow with Harbhajan, the highest scorer and Laxman, the lowest scorer.
1. Harbhajan
2. Ganguly
3. Dravid
4. Badani, Agarkar
5. Sachin
6. Laxman
Also, as the lowest score was 10 runs. Laxman must have scored 10, Sachin 20, Badani & Agarkar 30 and so on.
1. Harbhajan - 60 runs
2. Ganguly - 50 runs
3. Dravid - 40 runs
4. Badani, Agarkar - 30 runs each
5. Sachin - 20 runs
6. Laxman - 10 runs
There are 10 statements written on a piece of paper:
1. At least one of statements 9 and 10 is true.
2. This either is the first true or the first false statement.
3. There are three consecutive statements, which are false.
4. The difference between the numbers of the last true and the first true statement divides the number, that is to be found.
5. The sum of the numbers of the true statements is the number, that is to be found.
6. This is not the last true statement.
7. The number of each true statement divides the number, that is to be found.
8. The number that is to be found is the percentage of true statements.
9. The number of divisors of the number, that is to be found, (apart from 1 and itself) is greater than the sum of the numbers of the true statements.
10. There are no three consecutive true statements.
Find the minimal possible number?
Submitted
Answer

The numebr is 420.

If statement 6 is false, it creates a paradox. Hence, Statement 6 must be true.

Consider Statement 2:
 If it is true, it must be the first true statement. Otherwise, it creates a paradox.
 If it is false, it must be the second false statement. Otherwise, it creates a paradox.
In both the cases, Statement 1 is false.

As Statement 1 is false, Statement 9 and Statement 10 both are false i.e. there are three consecutive true statements.
 1    2    3    4    5    6    7    8    9    10
False    -    -    -    -    True    -    -    False    False

Let\'s assume that Statement 3 is false i.e. there are no three consecutive false statements. It means that Statement 2 and Statement 8 must be true, else there will be three consecutive false statements.
1    2    3    4    5    6    7    8    9    10
False    True    False    -    -    True    -    True    False    False

Also, atleast two of Statements 4, 5 and 7 must be true as there are three consecutive true statements.

According to Statement 8, the number that is to be found is the percentage of true statements. Hence, number is either 50 or 60. Now if Statement 7 is true, then the number of each true statement divides the number, that is to be found. But 7 and 8 do not divide either 50 or 60. Hence, Statement 7 is false which means that Statement 4 and 5 are true. But Statement 5 contradicts the Statement 8. Hence, our assumption that Statement 3 is false is wrong and Statement 3 is true i.e. there are 3 consecutive false statements which means that Statement 8 is false as there is no other possibilities of 3 consecutive false statements.

Also, Statement 7 is true as Statement 6 is not the last true statement.
1    2    3    4    5    6    7    8    9    10
False    -    True    -    -    True    True    False    False    False

According to Statement 7, the number of each true statement divides the number, that is to be found. And according to Statement 5, the sum of the numbers of the true statements is the number, that is to be found. For all possible combinations Statement 5 is false.

There 3 consecutive true statements. Hence, Statement 2 and Statement 4 are true.
1    2    3    4    5    6    7    8    9    10
False    True    True    True    False    True    True    False    False    False

Now, the conditions for the number to be found are:
1. The numebr is divisible by 5 (Statement 4)
2. The numebr is divisible by 2, 3, 4, 6, 7 (Statement 7)
3. The number of divisors of the number, that is to be found, (apart from 1 and itself) is not greater than the sum of the numbers of the true statements. (Statement 9)
The minimum possible number is 420.

The divisors of 420, apart from 1 and itself are 2, 3, 4, 5, 6, 7, 10, 12, 14, 15, 20, 21, 28, 30, 35, 42, 60, 70, 84, 105, 140, 210. There are total of 22 divisors. Also, the sum of the numbers of the true statements is 22 (2+3+4+6+7=22), which satisfies the third condition.
Ankit and Tejas divided a bag of Apples between them.

Tejas said, "It's not fair! You have 3 times as many Apples I have." Ankit said, "OK, I will give you one Apple for each year of your age." Tejas replied, "Still not fair. Now, you have twice as many Apples as I have." "Dear, that's fair enough as I am twice older than you.", said Ankit.

Ankit went to Kitchen to drink water. While Ankit was in Kitchen, Tejas took apples from Ankit's pile equal to Ankit's age.

Who have more apples now?
Answer

At the end, Ankit and Tejas, both have the same number of apples.

Let's assume that initially Tejas got N apples and his age is T years. Hence, initially Ankit got 3N apples and his age is 2T years.
Operation    Ankit's Apples    Tejas's Apples
Initially    3N    N
Ankit gave T apples to Tejas
(equals age of Tejas)    3N - T    N + T
Tejas took 2T apples from Ankit's pile
(equals age of Ankit)    3N - 3T    N + 3T

It is given that after Ankit gave T apples to Tejas, Ankit had twice as many apples as Tejas had.
3N - T = 2*(N + T)
3N - T = 2N + 2T
N = 3T

From the table, at the end Ankit have (3N - 3T) apples and Tejas have (N + 3T) apples. Substituting N = 3T, we get
Ankit's apples = 3N - 3T = 9T - 3T = 6T
Tejas's apples = N + 3T = 3T + 3T = 6T

Thus, at the end Ankit and Tejas, both have the same number of apples.

On evey Sunday Amar, Akbar and Anthony lunch together at Preetam-Da-Dhaba where they order lassi based on following facts.
1. Unless neither Amar nor Akbar have lassi, Anthony must have it.
2. If Amar does not have lassi, either Akbar or Anthony or both have it.
3. Anthony has lassi only if either Amar or Akbar or both have it.
4. Akbar and Anthony never have lassi together.
Who order(s) lassi?
Answer

Amar and Anthony both have lassi whereas Akbar never does.

Fact (2) can be alternatively stated that "either Amar or Akbar or Anthony must have lassi".

From Fact (3), it can be infered that either Amar or Akbar must have lassi.

Now, from Fact (1), it is apparent that Anthony too must have lassi. But according to Fact (4), Akbar cannot have lassi when Anthony does.
    Brain Teaser No : 00191

Decipher this sentence.

         B R W Q H L F K W   H J K   Q I B W K  



         Q I C E D W   Z B G   W K K   M I K E



         Z B G   Q H S K   Z B G J   K Z K W



         B U U   Z B G J   D B H F W.

Answer

Start with ZBG and ZBGJ. It should be either "the/then" or "you/your" combination as they appear more.

         B R W Q H L F K W   H J K   Q I B W K  

         o b s t a c l e s   a r e   t h o s e



         Q I C E D W   Z B G   W K K   M I K E

         t h i n g s   y o u   s e e   w h e n



         Z B G   Q H S K   Z B G J   K Z K W

         y o u   t a k e   y o u r   e y e s



         B U U   Z B G J   D B H F W.

         o f f   y o u r   g o a l s.

Technical Blogs..

Jokes & Fun
GDI+
Ado.Net Tutorial
Asp.Net Tutorial
Lectures videos
Winform Tutorial
C#.Net Tutorial
Programming Tips And Tricks
Visual C++ Tutorial
Ado.net Tutorial
ActiveX Controls Tutorial
ATL COM Tutorial
COM Tutorial
Managed C++The Buddha And His Dhamma
Bea WebLogic Interviews
TCL Programming FAQ's
Computer Science Notes
Discrete Mathematics notes
Database Management System(DBMS) Faqs
Professional Practices Faqs
Lotus Notes Faqs
Beautiful advertisements
Programming interview Questions and answers Blog List
Human Resource Tips
Tips for Windows XP Systems
Tips for Internet and Computer users
Tips for better e-mail etiquette
JavaScript Faq's
VB Script FAQ's
HTML Faq's
Perl Scripting FAQ's
Winrunner Faq'sLinux FAQ's
CCNA cisco Certification
Data WareHousing Interview
Microsoft SharePoint Interview
C++ Interview
Siebel Customer Relationship Management FAQ's
C Programming Language- Step by step learning
Unix FAQ'sSample Source Code for all languages
Various Technical and academic certifications

Source Code

Certifications

Misceleneous technical Faq's

VC++  Blog

Data structures Blog

.Net Blog

C#.Net Blog

VB.Net Blog

ASP.Net Blog

ADO.Net Blog

Winform Blog

WCF / WPF Blog

Job Openings

Operating Systems Faqs

Sybase Faq's

Download free e-books

All scripting Faq's

Oracle Faq's

All technical Faq's

Hasya-Vyang hindi kavite

HR, Car, Finance Faq's

Finance and Investment Faq's

All Freshers Resources

All Placement Papers

QA and testing Faq's

Sql Server Faq's

Interview Puzzles

Mainframes Faq's

Java Faq's

Sap Faq's