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
- 7579 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 |
Input is "rama loves rajesh and rajesh Loves rama also and rajesh wear gloves and bloves" To print output is count the numbers of times repeted the word love without case sensitive.
differentiate built-in functions and user – defined functions.
how to write a c program to print list of fruits in alpabetical order?
What does the message "warning: macro replacement within a string literal" mean?
Why is malloc used?
What 'lex' does?
Write a small C program to determine whether a machine's type is little-endian or big-endian.
write a 'c' program to sum the number of integer values
What does %p mean c?
Explain is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
What is pass by reference in c?
What is the real time usage volatile?
C 
