you have 9 marbles, all of them identical except one of them is slightly heavier than the rest. in order to determine which is the heaviest, you have a balancing scale, however you are only allowed to use it twice. how do you determine the heaviest marble?
Write a function (in your preferred language C, C++, or Java) that will take the given string and return the reverse. (ie. input:"abc def ghi" output:"ihg fed cba") Optimize the above code (if possible). Now knowing that the original function you wrote in pt1 is being used by other programs and cannot be modified write another function that when called will utilize the function from pt1 to only reverse the words in the sentence. (ie. input:"abc def ghi" output:"ghi def abc") Test your code.
design an elevator(uml+implementation+threads& syncroniczation and locking)
Write a program to find out the median of two sorted array.
Implement a solution for the bounded buffer problem where you have a queue of work items and several producer/consumer threads.
The differences between recursive and iterative implementations?
How would store and load a tree in file?
1. Implement stack using queue 2. Merge two arrays and sort them in order as specified at runtime. The two arrays may share common entries between them, but the resultant array must not have duplicates.
In employee table there is a self reference to boss (who is also an employee). How to find the number of people that work under a given person for his entire tree.
Convert string to number. "123" to 123
Viewing 791 - 800 interview questions