Informatica recently visited our campus to hire full time employees and interns. About 70 students appeared out of which 4 were given internship and two were given both internship and full time job offer. I was lucky to get an internship. Here is my interview experience.
Round 1:(online MCQs)
MCQs on Data structures, C/C++, DBMS, OS and networking
Round 2:(online subjective)
20 questions of easy level. Time constraint exists. No one was able to solve all 20 questions. We had to write codes, algos, point out mistakes in given code etc
1. Discussion on ethical hacking
2. Discussion on my projects at Microsoft IDC(I was an intern there)
3. Print all nodes at same vertical in a tree.(very tough)
4. Remove all occurrences of a particular value from a linked list
5. Find all root to leaf paths with a given sum
1. Implement insertion sort using stacks. Temporary memory, input, output etc, everything is in stacks.
2. Implement 2-D array in heap segment. This has to be used for page faults and related OS tasks. What modifications will you make?
3. Polymorphism, run time polymorphism and implementational details
4. Find a magic index ‘i’ in an array in o(1) time, such that a[i] = i. The array is already sorted
1. Flatten a multi level linked list
2. Find Next greater element in an array.
3. Check whether an array of strings can form a cycle, i.e., last element of one node can occur anywhere in the first of other
Basic HR questions, relocation questions, family background etc.
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses
are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!