Interested to Buy Any Domain ? << Click Here >> for more details...
There are 8 billiard balls, and one of them is slightly
heavier, but the only way to tell was by putting it on a
weighing scale against another. What's the fewest number of
times you'd have to use the scale to find the heavier ball?
- 5 Answers
- 9314 Views
- Microsoft, TCS, I also Faced
- E-Mail Answers
Answer Posted / mahesh t
first take 6 balls from 8 balls
from those 6 divide 3 and 3 check it in weighing scale if it
equals weight remaining 2 balls and you get the hevier
ball....of not equals take the 3 balls which is hevier from
those weighing with 6 balls then take 2 balls from those 3
balls and weight if equals the remaining one is hevier
and final you can know the hevier ball within 2 times
| Is This Answer Correct ? | 8 Yes | 0 No |
Post New Answer View All Answers
Explain the bubble sort algorithm.
What are run-time errors?
The number of bytes of storage occupied by short, int and long are a) 2, 2 and 4 b) 2, 4 and 4 c) 4, 4 and 4 d) none
How to throw some light on the b tree?
`write a program to display the recomended action depends on a color of trafic light using nested if statments
How do I get an accurate error status return from system on ms-dos?
How many keywords (reserve words) are in c?
What is struct node in c?
What is a nested formula?
How can you convert integers to binary or hexadecimal?
Can we increase size of array in c?
int i=10; printf("%d %d %d", i, i=20, i);
Why do we use namespace feature?
Is c pass by value or reference?
if (i = 0)printf ("True"); elseprintf("False"); Under what conditions will the above print out the string "True" a) Never b) Always c) When the value of i is 0 d) all of the above
