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 23272write a program to fined second smallest and largest element in a given series of elements (without sorting)
9 19819Post New Yahoo C Interview Questions
What is quality policy?
What type of dbms is mongodb?
What type of records can be kept in a blockchain?
Does partitioning improve performance?
How many types of index are there?
What is p tag in html?
Is jquery html() method works for both html and xml documents?
What is the difference between sorted collection and ordered collection, which one is better?
What is the default role assigned to user if it created from OOB import tool?
Maximum cement content in 1cum for RCC and PSC? (please give IS,IRC referance?
Does microsoft office come with windows?
What are the revision control system options available in tibco designer?
Why does physical exertion increase symptoms of poisoning by trematol?
Why to use perl scripting?
What is definition in c#?