There is a 100-story building and you are given two eggs.
The eggs (and the building) have an interesting property
that if you throw the egg from a floor number less than X,
it will not break. And it will always brake if the floor
number is equal or greater than X. Assuming that you can
reuse the eggs which didn't broke; you got to find X in a
minimal number of throws. Give an algorithm to find X in
minimal number of throws.
- 5 Answers
- 21446 Views
- Yahoo, I also Faced
- E-Mail Answers
Answer Posted / the practitioner
Just start on the first floor and throw the egg. If it
breaks then X=1
If not then go to the second floor and throw the egg. If it
breaks then X=2
If not then go to the third floor and throw the egg. If it
breaks then X=3
If not then keep doing that and the floor it breaks on is
the floor that X equals.
But really, in real life, a real egg would break from 3
feet.
| Is This Answer Correct ? | 0 Yes | 31 No |
Post New Answer View All Answers
How can I call fortran?
What is difference between structure and union with example?
What is static and volatile in c?
Explain what is a program flowchart and explain how does it help in writing a program?
What is an auto keyword in c?
What is exit() function?
Given two strings S1 and S2. Delete from S2 all those characters which occur in S1 also and finally create a clean S2 with the relevant characters deleted.
Explain what is the difference between the expression '++a' and 'a++'?
What is the full form of getch?
In c programming write a program that will print 10 multiples of 3 except 15,18,21 using looping
any restrictions have on the number of 'return' statements that may be present in a function. a) no restriction b) only 2 return statements c) only 1 return statements d) none of the above
List the difference between a 'copy constructor' and a 'assignment operator' in C?
What are c identifiers?
Write the test cases for checking a variable having value in range -10.0 to +10.0?
What are the primitive data types in c?
