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 23302write a program to fined second smallest and largest element in a given series of elements (without sorting)
9 19863Post New Yahoo C Interview Questions
What is a callback c#?
How do you mass delete words in word?
What is the difference between explicit and implicit cursors in oracle?
we want to setup one-way data replication for my online transaction processing application. However there are compressed tables in the environment. Please suggest how I can achieve it?
Tell me can we use any function inside isr?
What is cocoa and cocoa touch?
List various types of log-based recovery in DBMS.
What are the different String functions available in pig?
For what purposes have you used sas macros? : sas-macro
What is integrity?
can you define yourself in one word?
Why Talend?
What is a db2 package?
When scheduler configure change will effect?
Explain when using field grouping in storm, is there any time-out or limit to known field values?