In 1000 wine bottles stack 10 are poisoned given 10 rats
what is the minimum number of tries to find the poisoned
one. Rat dies once it licks the poisoned wine.
- 11 Answers
- 22879 Views
- Google, IBM, Infosys, KPIT, Yahoo, I also Faced
- E-Mail Answers
Answer Posted / vahid
Answer: 10
Reason:
The best case happens ONLY when each rat dies just as they
taste the FIRST bottle given to them (you can imagine it a
miracle :D )
In this case, the very first 10 attempts reveal the
poisonous bottles. So the answer is 10.
| Is This Answer Correct ? | 23 Yes | 13 No |
Post New Answer View All Answers
Ajay can build a house in 16 days and Barry can do the same job in 12 days. With help of Chintu, they did the job in 4 days only. How many days Chintu can do the job?
If the bus travels with 8 tyres(6 tyres running),travels a distance of 16000 km how much is the distance sustained by each tyre.
What number should be added to or subtracted from each term of the ratio 17 : 24 so that it becomes equal 1 : 2.
There are 5 boxes in a cargo. The weight of the 1st box is 200 KG, the weight of the 2nd box is 20% higher than the third box, whose weight is 25% higher than the 1st box weight. The 4th box which weighs 350 KG is 30% lighter than the 5th box. Find the difference in average weight of the 4 heaviest boxes and the four lightest boxes.
The average of 4 consecutive even numbers is 27. What is the largest number?
Two glasses were filled with 1/3 and 1/4 milk. they were filled with water &then mixed in tumbler. what is the percentage of milk in the resultant.
How many liters of water must be added to 30 liters of alcohol to make a solution that is 25%
A lorry starts from Bangalore to Mysore at 6.00 A.M,7.00am.8.00 am.....10 pm. Similarly one another starts from Mysore to Bangalore at 6.00 am,7.00 am, 8.00 am.....10.00pm. A lorry takes 9 hours to travel from Bangalore to Mysore and vice versa. A lorry which has started at 6.00 am will cross how many lorries.
There is a lucky draw held every day. If there is a winning number eg. 1876, then all possible numbers like 1867 ,1687,1768 etc are the numbers that match irrespective of the position of the digits. Thus all these numbers qualify fr the lucky draw prize. Assume there is no zero digit in any numbers. Write a program to show all the possible winning numbers if a "winningnumber" is passed as an argument to the function. i want a solution in c/c++ language
sir iam asking you assistant stastical officer previous question paper
A boy has Rs 2. He wins or loses Re 1 at a time If he wins he gets Re 1 and if he loses the game he loses Re 1. He can loose only 5 times. He is out of the game if he earns Rs 5. Find the number of ways in which this is possible?
There are 1000 doors that are of the open-close type. When a person opens the door he closes it and then opens the other. When the first person goes he opens-closes the doors ion the multiples of 1 i.e., he opens and closes all the doors. When the second goes he opens and closes the doors 2, 4 6 8 rely. Similarly when the third one goes he does this for 3 6 9 12 15th doors rely. Find number of doors that are open at last.
In a storage stall of 5x3x2inch.How many blanks of size 2x1x1inch can be stored..
C1,C2 upto Cn are n cities in a country.There are some roads connecting these cities.They are connected in such a that Crth city has r distinct routes connecting each of the other city in the country. 1)if n=27,then how many roads are there in a country? 2)if n=4,in how many distinct routes,can a person travel from c3 to c2?
Which one of the following is correct a) $$Z(4).99 b) $9(4)zz.99 c) A(4)BB d) +9(5).99CR
