Alcatel Lucent Second Round F-2-F

SECOND ROUND F-2-F 

=================== 

1.Can you write a program to implement memcpy. copy must be successful even source and destination address overlap.
2. puzzel:
There are 100 doors, all closed. In a nearby cage are 100 monkeys. The first monkey is let out, and runs along the doors opening every one.
The second monkey is then let out, and runs along the doors closing the 2nd, 4th, 6th,... all the even-numbered doors.
The third monkey is let out. He attends only to the 3rd, 6th, 9th,... doors (every third door, in other words), closing any that is open and opening any
that is closed, and so on. After all 100 monkeys have done their work in this way, what state are the doors in after the last pass,which doors are left open and which are closed? 

3. what mechanism used to communicate between kernal and user-space.
4. what mechanism used to pass message between protocols.
5. In above question he touch the semaphore , mutex, and IPC.
6. what is deadlock condition, have you ever observed such scenario in ur carrier. 
7. what is lock ordering.
8. For a given stack dump, how you can analyse. how can you find the call trace.

9.  Can you implement a memory manager, which will detect the memory corruption.



If you would like to contribute, mail us your interview experience at "q4interview@gmail.com". We will like to publish it on "q4interview.blogspot.in" and let's help other job seekers.