:: Home Page            
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
   Refer this Site  Refer This Site to Your Friends  Site Map  Bookmark this Site  Set it as your HomePage  Contact Us     Login  |  Sign Up                      
Categories >> Aptitude Questions >> General Aptitude


 English interview questions  English Interview Questions (465)
 General Aptitude interview questions  General Aptitude Interview Questions (1900)
 Puzzles interview questions  Puzzles Interview Questions (460)

3. Given 1000 bottles of juice, one of them contains poison
and tastes bitter. Spot the spoiled bottle in minimum sips?
 Question Submitted By :: General-Aptitude
I also faced this Question!!     Answer Posted By  
# 1
Take 500 of the bottles and put one drop from each of them into an empty bottle. Taste the juice in that bottle. If it's bitter, you know the poison is in one of them; if not, it's in one of the other 500. Now, take 250 of the bottles you've chosen and put one drop from each into another empty bottle and taste it. Now, you've narrowed it down to 250 bottles. Repeat, and narrow it down to 125... then 63... then 32... 16...8... 4... 2... and finally 1. And you only had to taste the juice 10 times, instead of possibly 999. 
Is This Answer Correct ?    10 Yes 0 No
# 2
We can use the Divide and Conquer Sorting Algorithms, to get
the mininum number of sips.

Exact number cannot be said, it depends on which part/where
the spoiled bottle is placed.

But using this technique it can be found.
Is This Answer Correct ?    8 Yes 2 No
# 3
see if you have to check poison then think that the bottle
with poison will not be sealed as it was first filled with
juice and then poison.
Is This Answer Correct ?    8 Yes 4 No
Gunjan Rawal
# 4
ans can be any below putting one bitter drop and rest other drops in a empty bottle cannot determine whether its bitter or not . 
Is This Answer Correct ?    0 Yes 0 No
# 5
minimum sips required to spot the poison-mixed bottle is 1.
out of 1000, i select any one bottle. that can turn out to
be the poisonous one.
Is This Answer Correct ?    23 Yes 26 No
Sandeep Palav
# 6
if check out the poison...i wud say,i will not... 
Is This Answer Correct ?    4 Yes 7 No
# 7
Is This Answer Correct ?    3 Yes 6 No
# 8
there are 1000 bottles and one is spoiled !!
NICE ! now our job is to detect the spoiled 1 with minimum
sips .... hmmmm think like sherlock holmes now !
probability of finding that one in 1000 is 1/1000
divide those 1000 into 4 parts 250 ,250, 250, 250
well well well now as i told only one is bitter means, it is
alkaline and it will turn a red litmus paper (ph paper) into
blue ...
now collect a litmus paper from nearest store and start
dipping in first 250 bottles block !!
voila !! if it turned to blue , that one is the infected one
!! and u spotted it without even sipping :P
Is This Answer Correct ?    3 Yes 8 No
# 9
i will destroy one of the bottles and will replace it wid a one wid poison.......and the bottle can be easily spotted 
Is This Answer Correct ?    0 Yes 13 No
# 10
Is This Answer Correct ?    2 Yes 18 No
Gokulnath .k

Other General Aptitude Interview Questions
  Question Asked @ Answers
a train is moving at speed of 25 kmph , another train moving the same direction at a speed of 49 kmph crossed a man in the first train in 10 sec ? wht is the length of the second train ? CTS 3
The size of the bucket is N kb. The bucket fills at the rate of 0.1 kb per millisecond. A programmer sends a program to receiver. There it waits for 10 milliseconds / and response will be back to programmer in 20 millisecond. How many much time the program takes to get a response back to programmer, after it is sent? Plz explain.. TCS 5
what is the next number in the series 3,26,15,124, IBM 7
hi friend generally short forms are asked in Net Solutions paper.i m writing them below Net-Solution 2
Mr. Beans visited a magic shop and bought some magical marbles of different colours along with other magical items. While returning home whenever he saw a coloured light, he took out marbles of similar colours and counted them. So he counted the pink coloured marbles and found that he has bought 25 of them. Then he counted 14 green marbles and then 21 yellow marbles. He later counted 30 purple coloured marbles with him. But when he reached a crossing, he looked at a red light and started counting red marbles and found that he had bought 23 Red marbles. As soon as he finished counting, it started raining heavily and by the time he reached home he was drenched. After reaching home he found that the red, green and yellow marbles had magically changed colours and became white, while other marbles were unchanged. It will take 1 day to regain its colours, but he needs to give atleast one pair of marbles to his wife now. So how many white marbles must be choose and give to his wife so as to ensure that there is atleast one pair of red, yellow and green marbles ?   2
A queen had 3 rings in a jewel box. She had 3 daughter's and one day the king said that the queen should give one ring to each of her daughter's and she should also keep a ring in that jewel box . The queen did what the king said. How is this possible ?   3
a=2,b=3,c=6 c/(a+b)-(a+b)/c=? HCL 9
How many such letters are there in the word ORIENTAL each of which is as for away from the beginning of the word as when they are arranged alphabetically? (a) None (b) One (c) Two (d) Three (e) More than three   2
i will come thrice in a minute, twice in a hour, once in a day, who am i? Infosys 8
In a Cricket Match Two Batsmen are on 94 . 7 more runs to win from 3 ball remains. Both of them got unbeaten 100. How it is possible Infosys 43
who invented internet   1
for each hour an watch is going slow by 30 seconds now time is 8 a.m. what will be the actual time at 8 p.m. Wipro 4
For more General Aptitude Interview Questions Click Here 

Copyright Policy  |  Terms of Service  |  Articles  |  Site Map  |  RSS Site Map  |  Contact Us
Copyright 2013  All Rights Reserved.   ::