Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 26732 Views
- Google, IBM, Infosys, KPIT, Yahoo, I also Faced
- E-Mail Answers
Answer Posted / saurabh
1
Probably 1st bottel may be full wid poison...!!
| Is This Answer Correct ? | 4 Yes | 16 No |
Post New Answer View All Answers
A man can row downstream at a rate of 14 kmpl & upstream at 9 kmpl. Find man's rate in still water ?
A fold density is 19 times greater than the water and for copper it is 9 times.At what ratio you can mix gold and copper to get 15 times denser than water.
It has 20 mixture contains mil and water in the ratio 3:5,replace 4 litres of mixture with 4 litres of water what is the final ratio of milk and water.
. Select the correct statement a. NEXT SENTENCE and CONTINUE functionally does the same. b. Never can code a DECLARE CURSOR statement in procedure division. c. Edited numeric characters can be included in arithmetic operations. d. The Sub parameters of a DCB parameter are Keyword parameters.
One man brought pen and book from 250 and he sold both at 10% profit on pen and 20% loss on book and finally he gained 40% what is the value of pen
How many mod 3 counters are required to construct mod 9 counter.
The ratio of the length : breadth : height of a cuboid is 5 : 4: 3, and the volume is 7500. What will be its surface area ?
If a train covers 600m in 0.5 seconds, how long it will cover in 10 seconds?
Sum of money at compound interest amounts of thrice itself in 3 years. In how many years will it take 9 times itself.
If A=Z, B=Y, C=X, .......... Z=A, Then POCKET = ?
A 2D array is declared as A[9,7] and each element requires 2 byte.If A[ 1,1 ] is stored in 3000. Find the memory of A[8,5] ?
A number, when it is divided by 8 it gives a remainder 3 and is divisible by both 3 and 5. Find the number.
0.75 * 0.75 * 0.75 - 0.001 0.75*0.75-0.075+0.01
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.
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?
