Company: Aspiring Minds (AMCAT)
Technical Interview (3 Rounds):
Q1. Given a doubly linked list with one pointer of each node pointing to the next node just like in a singly linked list. The second pointer(arbit pointer) however can point to any node in the list and not just the previous node. Write a program in to create a copy of this list.
Q2. Implement funcionality of 1000 of students giving a online test and timer is running. You have to calculate th etime when test is tarted and auto-matically stop the test when test is ended. Handle the scenarios like power failure. test should start from where it stopped.
Q3. WAP of prime number using reursion?
Q4. Reverse a linked list?
Q5. Some sql related questions – not very tough : some inner joins and self join based?
Q6. How can you stop man in the middle attack over an insecure communication line without using any kind of encryption ?
Q7. What is the difference between http and https?
Q8. Heap memory and stack memory? Local variables are stored where? What is memory tables?
Finally, I got offer from Aspiring Minds after 15 days of negotiation.
Thanks CFC for all the hard work you do in putting up lot of good content.
