The interviewer was a head hunter, he said he has answers and questions in his hand and he would ask 11 questions.  Here are the questions. I forgot 2-3. here are the rest

1. What is the difference between mutex and CRITICAL_SECTION

2. You have a file with many many intergers in the range 0  to 1000. What is the best way to print them in sorted order
Ans Bucket sort

3.Which is the associated strcutire with search time complexity of O(log n).
Ans . Binary Search tree

4.What is the run time and space time complexity of Binary serach tree
Ans. Run time is O(log n) and space: O(1)

5. You are given a hash table with input value as 16 bit unsigned integer and and key as 8 bit key. What is the obvious problem. The UPB is 255.

Ans.Collision

6. How will you solve problem of Q5
Ans Rehashing

7.How will you find the middle node in a single linked list in fastest way?
Ans. Two pointers one moving twice as fast as the first one and when faster one reaches the end , the first one has reached th middle.

8.Difference between arrays and linked list.