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
- 9006 Views
- Microsoft, TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / 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 |
what do you mean by enumeration constant?
What is a substring in c?
Is javascript written in c?
write a program to find out prime number using sieve case?
print the pattern 1 2 4 3 6 9 4 8 12 16 5 10 15 20 25 if n=5
what are the languages used in c#?
prototype of sine function.
which one is highest Priority in c? a)=,b)+,c)++,d)==
What is memory leak in c?
HOW TO ANSWER IF ASKED " WHAT KIND OF A PERSON ARE YOU?" I NEED AN ANSWER THAT IMPRESS THE INTERVIEWER
What is wild pointer in c?
1) int main() { unsigned char a = 0; do { printf("%d=%c\n",a,a); a++; }while(a!=0); return 0; } can anyone please explain the explain the output
C 
