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 21415write a program to fined second smallest and largest element in a given series of elements (without sorting)
9 16988Post New Yahoo C Interview Questions
How do I split a number into two columns in excel?
Differentiate between product quality and process quality?
What are the costs and benefits of the Final Rule?
what do you do in your spare time?
What is the latest version of objective-c?
How is the growth of the bank since it opened?
Define flocking?
Explain what is scrum sprint?
Which antivirus is best for ubuntu?
Explain what is routing protocol and its purposes?
How can you handle exceptions in qtp?
What is the function of ctrl u?
Explain the use of record option in exp command.
What are the electrodes used in the measurement of ph for the determination of pka?
how you can run Rails application without creating databases?