Steve writes down a number between 1 and 1000. Jill must determine that number by asking “yes/no” questions of Steve. Jill knows that Steve always tells the truth. If Jill uses an optimal strategy, then she will determine the answer at the end of exactly how many questions in the worst case?
This site features a collection of common technical interview questions gathered by a group of programmers who have been through, and given, lots of technical interviews. There is an emphasis on C++ and game programming technical interviews, but most of the questions are relevant to any technical interview.
Do you have a technical interview question you would like to submit? Some tips you would like to pass on? Just want to say hi? Feel free to contact us
Search Technical Interviews:
Categories:
-
.NET Interview Questions
C/C++ Interview Questions
Computer Graphics Questions
Game Programming
General Programming Questions
Mathematical Questions
Non-Technical Questions
Object Oriented Programming
Optimization Questions
Links:
Want to exchange links? contact us
1 Comment so far
Leave a comment
This is a binary search question, binary search is O(logn) so 10 (2^10 = 1024)
By Stuart on 10.05.06 8:08 pm | Permalink
Leave a comment
If you are including code in your comment, place it within a <div class='code'></div> tag for better formatting.