Informatica Interview Experience 2019

• Last Updated : 13 Apr, 2020

Round 1: ONLINE TECHNICAL MCQ ROUND

30 MCQs in 45 minutes related to Data Structures, Algorithms, Operating System and Database Management System. If you are preparing for GATE then it is very easy task for you as all the questions were from previous year gate papers. This test was conducted on cocubes platform.

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

*Only 118 students were shortlisted out of 700 students.

Round 2: ONLINE CODING TEST

We were given 4 problems for 90 minutes, language was optional but preferred was Java or C++ on cocubes platform.
The questions were divided into 2 easy and 2 hard, Easy were of 5 Marks, Hard were of 10 marks.

1. Given an array with n elements and an integer k. Divide the array into subarrays, each of them containing k elements. For example:
Input: arr[]={1, 32, 5, 6, 9, 3} and k=2

The subarrays will have elements

{132}, {56}, {93}.

Now sort these subarrays as {56}, {93}, {132}. Merge these subarrays together and display them as the elements of original array in sorted order as

Final output: arr[]={5, 6, 9, 3, 1, 32}

1. find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum.

https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/

1. Check whether first string is contained in the second string in sequence or not.

For ex. String 1: bcdf

Output: Yes

Ex 2: String 1: abcdddef

String 2: bacd

Output: No

1. Count no. of substrings of a number which are divisible by k.
• Students who had done 3 or 4 questions were shortlisted for the next round. Only 23 students were shortlisted for next round.

Round 3: TECHNICAL ROUND 1

This Interview was purely based on oops with C++, Data Structures, Algorithms and Operating System and this interview was gone for around 1 hour.

1. Projects
2. OOPS concepts in C++
3. Virtual function & pure virtual function in C++ along with code.
4. Abstract class in C++
5. STL (Maps, Vector, Pair etc.) in C++
6. Internal working of vector in C++ STL
7. Quick Sort VS Merge Sort (with dry run on any random example)
8. Which data structures do you know?
9. Memory layout in C
10. Storage of local variables, static variables, global variables etc.
11. What is the role of heap in memory layout of C?
12. Pseudo code for prime numbers generation from 1 to n. (They will ask why to check a number to its square root for checking it is prime or not)
13. There is infinite stream of data coming then tell the approach to tell top 5 elements up to any point. (Best approach is using min heap)
14. Binary Search Tree
15. Pseudo code to check whether the given Binary tree is BST or not.
16. Semaphore and mutex
17. Process Synchronization
18. Pseudo code to check whether the given linked list is palindrome or not.
19. Optimized solution for finding middle node of the linked list.
20. Reverse a singly linked list (Approach only)
21. Can we find the no. of elements in array using sizeof() operator? If yes,   then why do we pass no. of elements in the array as a parameter in function?
22. As my all the projects were in python then they’ve asked why you code in c++ then?
23. Recursion
24. Some basic problems on recursion.
• Only 15 students were shortlisted for next round.

Round 4: TECHNICAL ROUND 2

1. Find first intersection node of 2 linked list.
2. Find maximum node data in Binary tree.
3. Balanced Parenthesis problem.
4. Pseudo code to determine whether 2 binary trees are identical or not.
5. Pseudo code to determine whether 2 binary trees are mirror of each other or not.
6. Time and space complexity of above all codes.
• Only 10 students were shortlisted for the next round.

Round 5: TECHNICAL ROUND 3

1. Tell one project which you consider is your favourite.
2. Which data structures are your favourite?
3. Given 2 Binary trees, write pseudo code to check whether the second tree is a subset of 1st one or not.
4. Given 2 large nos. in form of linked list where each node contains single digit. Write a program to add these 2 nos. and give the output in the new linked list. (Optimized solution)
5. Reverse a singly linked list.

Round 6: HIRING MANAGER ROUND

1. Given 4-5 C/C++ code snippets on strings and pointers. They asked about their output with the explanation.
2. Given 1 function and they asked to predict possible output when 2 threads are accessing that code.
3. Critical section and its 3 conditions.
4. Semaphore vs mutex.
5. What are atomic operations?
6. Pseudo code to swap two constant strings using functions.
9. Difficulty faced during team work.
10. Your biggest achievement till now.
• Now, only 5 students were shortlisted for the HR round.

Round 7: HR ROUND

1. How have your previous rounds gone?
2. Family background.
3. Strengths and weaknesses.
4. Current placement offers.
5. Any plans for higher studies and Why?
6. Why have you opted Computer Science?
7. In which companies you’ve given interviews or written rounds?
8. 1 or 2 easy puzzles
• Out of 5, 2 were finally selected for the job and 2 were kept on waiting list and I was one of them. But after 4 weeks we both also were selected for the job.
• Never lose hope, in all the rounds confidence was checked and please keep patience.
My Personal Notes arrow_drop_up