1. How does a spell checker routine (common to both, word and PowerPoint) used? Is the code copied 2 times for each of the processes in the main memory, if they are different processes or how is it used if they are threads.

2. Why are beer cans tapered at the top and bottom?

3. How many times a day a clock's hands overlap?

4. Given 2 set of arrays of size N(sorted +ve integers ) find the median of the resultent array of size 2N.

5. Validate a Binary search tree? ( as in the left- right child follow the property )

6. Given a NxN matrix with 0s and 1s. now whenever you encounter a 0 make the corresponding row and column elements 0.

Flip 1 to 0 and 0 remains as they are.

for example
1 0 1 1 0
0 1 1 1 0
1 1 1 1 1
1 0 1 1 1
1 1 1 1 1

results in

0 0 0 0 0
0 0 0 0 0
0 0 1 1 0
0 0 0 0 0
0 0 1 1 0

7. MIT math graduates bump into each other at Fairway on the upper west side. They hadn't seen each other in over 20 years.

The first grad says to the second: "how have you been?"
Second: "Great! I got married and I have three daughters now"
First: "Really? how old are they?"
Second: "Well, the product of their ages is 72, and the sum of their ages is the same as the number on that building over there.."
First: "Right, ok.. oh wait.. hmmmm.., I still don't know"
second: "Oh sorry, the oldest one just started to play the piano"
First: "Wonderful! my oldest is the same age!"
Problem: How old are the daughters?

8. Reverse a linked list ?

9. Find the first unrepeated character in a string of English language in O(n).

10. Difference between a 32-bit OS and a 64-bit OS