Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 23013 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
Difference between macros and inline functions? Can a function be forced as inline?
Explain what is a stream?
What is the use of clrscr?
What are the rules for the identifier?
Can a pointer be static?
Explain the use of bit fieild.
What is the scope of static variable in c?
What does calloc stand for?
When should you use a type cast?
What are the preprocessor categories?
What are the __date__ and __time__ preprocessor commands?
Why & is used in scanf in c?
What is the use of a semicolon (;) at the end of every program statement?
‘SAVEPOINT’ and ‘ROLLBACK’ is used in oracle database to secure the data comment. Give suitable examples of each with sql command.
Define C in your own Language.
