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 21378write a program to fined second smallest and largest element in a given series of elements (without sorting)
9 16932Post New Yahoo C Interview Questions
How secured is linux? Explain.
does my active directory domain should have microsoft exchange server installed in it?
How we can you use preparedstatement.
Is it possible for a control to define a handler for an event, that the control can't itself raise?
What is lts ubuntu?
How to assign a computed value to the same array back?
Will you be happy to re-locate, if required?
Tell me about a time when you had to use your presentation skills to influence someone's opinion.
How do u prepare test environment for ur application?
Define ansi?
why we use sinosidal voltage / current instead of others in system?
how to sort an array in c#
How do you capitalize all letters in excel?
What’s the difference between a generative and discriminative model?
What is lambda@edge in aws?