Write a program to find depth of binary search tree without using recursion.
Write some code to find all permutations of the letters in a particular string.
Implement division (without using the divide operator, obviously).
How many degrees are there in the angle between the hour and minute hands of a clock when the time is a quarter past three
Describe the data structure that is used to manage memory. (stack)
Name one or two examples of how an application can anticipate user behavior.
How can you debug a system in a production environment, while it is being used?
Write a function (with helper functions if needed) called to Excel that takes an excel column value (A,B,C,D…AA,AB,AC,… AAA..) and returns a corresponding integer value (A=1,B=2,… AA=26..).
Implement put/get methods of a fixed size cache with LRU replacement algorithm.
Create a cache with fast look up that only stores the N most recently accessed items.
Design the SQL database tables for a car rental database.
There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to multiplication of all the elements of A[N] except A[i]. For example Output[0] will be multiplication of A[1] to A[N-1] and Output[1] will be multiplication of A[0] and from A[2] to A[N-1]. Solve it without division operator and in O(n).
Which tools do you like to use for keeping track of requirements?
Given two linked lists, return the intersection of the two lists: i.e. return a list containing only the elements that occur in both of the input lists.
What is the C-language command for opening a connection with a foreign host over the internet
What sort would you use if you required tight max time bounds and wanted highly regular performance.
What books have you read on software engineering that you would recommend to someone in the business?
How long it would take to sort 1 trillion numbers? Come up with a good estimate.
Which would you use to protect access to an increment operation?
How do you find out the fifth maximum element in an Binary Search Tree in efficient manner.