NEC-HCL Interview of Samarth Rastogi

Written(50 mins)
It contained 20 C ques n 20 apti. C was average bt apti was really very tough.

Coding test(30 mins)
After Ist written there was a coding test, It contained 4 questions and one had to do 2 out of them-
1. Insert n delete in a doubly link list at a given position
2. Make a balanced BST
3. Reverse a string word by word ex- “i m ram” ans is “ram m i”
4. Find min from array of integer recursively
They told us to define very clearly the data structures we wud use.

Ist Technical 
I did 1st and 3rd ques of prev round.
He asked me about myself
He analysized my codes n asked few ques from that.
what  is  sizeof(int *) and sizeof(char *)?
why 4?
What is maximum value of the pointer?
what is system call?
what will happen exactly when a process make a sys call?
what is context switching?
He wrote an instruction n asked me exactly what will happen if the context switch takes place at this pt?
what is a tree? Suppose You have m-nary tree how will u implement it? What will be your datastructure?
If number of values at a single node gets increased? Like we promote our tree from m to n (n greater than m). i.e. give a general structure
/*
Node{
              *parent;
              *headOfLLOfValues;
              *headOfLLOfPtrs;
}
*/

How to find a loop in LL.
I gave hair n tortoise approach. He said don’t give internet solutions. Give your own one.
I said ok mark every node as visited after checking it if finds an already visited node then its a loop. He said you can’t modify the structure. I said ok take an array and put address of nodes in them and check it every time you move in LL. If address found in array then loop. Then he said you have a limit in array. Then use LL.

2nd technical
It was an easy n short round.
He asked an hr ques: You are at a place where you don't know the local language if you have to go to somewhere, what will you do?
Then after that whatever i said he said suppose that is not possible. I tried many approaches n finally he changed the topic.
He asked me you have an array of  n int. Exactly how many comparisons will take place for an unsuccessful search.
 /* 2n+1 */
Favorite subject: os
What is scheduling?
How a process is selected to run?
How and at what time its priority is calculated?
How does OS manage priority?
Difference b/w FAT n unix FS?
How do u append a file in both of them?
Suppose you have 1 dir block, 1 first level indirect block n 1 sec level indirect block, what will b the max size of file? Assume block size.
A situation where virtual destructors are used?
He made a linklist with 3 nodes, n asked to reverse it. He asked me to write only the conversions.

HR Round
It was the very simple round n i enjoyed it most. HR was a girl. She asked me abt myself, then my strengths n weakness, then abt team work n then many standard ques. After it she asked whether i can stay in a place where i dnt know the lang. Then she said ok Samarth now i just wanted to know wat is Samarth all abt. N i realized that i was waiting for it n then i started speaking like hell. I told her so many things, sum so much funny that she started laughing. N ultimately she said that it was nice talking to u. I said same here thank you.

Best of luck guys......