Round: Test Experience: Section I: 1.How to find 2^x quickly. 2.How to find middle node in a linked list. 3.Explain bubble sort and merge sort and which is better. 4.What are stack and heap data structures. 5.Explain use of Volatile keyword in C. 6.What is a Mutex ,Semaphore and a Spin Lock. 7.What is execve system call. 8.How to declare and use function pointers in C. 9.What is BFS and DFS. 10.How will you search for an integer in a sorted array. Section II: 1.Write are malloc() and free() implemented in C? write an algorithm. 2.write a function or macro to implement set bit, clear bit and toggle bit operations to set,clear or toggle the 10th bit of a 32 bit integer. 3.Write a C program to implement Red Black tree. 4.Write a C program to implement pipe. 5.Write a C program to implement ring buffer. 6.Write a C program to implement a Shell . 7.Write a C program to print all possible anagrams of a string.
Round: Technical Interview Experience: In this round the interviewer saw my answer sheet and said that he was impressed with my answers in section I but he expected me to perform section II also well.So he asked me to write either the full code for a linked list or Binary search tree. I wrote the full code for a BST implementing all operations like insert,delete and search.He examined my code and asked me to explain it.I explained each module to him.But he told my code was full of recursive type and asked me to modify it to reduce stack size. Modified it by using a current pointer to point to root and update it suitably with some help from. him
Round: Technical Interview Experience: Second Technical interview- I was asked to demonstrate parallelism in the multiplication of 123456 and 437123.I suggested by multiplying 123456 with each of the second number’s digits in 6 separate GPUs each.
Skills: College Name: Anna University Chennai
Share
Campus Placement Interview Questions at Top Colleges