Round 1 – MCQs (45mins)
Total questions - 31
This round was based on the topics listed below,
DSA (mostly based on Linked Lists, Trees (traversals important))
RISC/CISC Architecture
Predict the output (C++)
Aptitude questions (maximum 3 to 4 questions)
Memory Management, Multithreading, Scheduling Algorithms (OS)
Time complexity
Focus more on C++ and Python
Round 2 – Coding (15mins + 20mins + 30mins)
You have to solve each question within the time constraint
1)Array based question (easy one)
2)Course Schedule (graph based question)
3)Perimeter of an Island (matrix based question)
Round 3 – Tech HR 1 (upto 1hr)
In the third round of my interview, which was with the Tech HR, I began with an introduction before being asked to explain my projects. It's crucial to list your best project first on your resume. Explain the concept using pen and paper, and be ready to show the live working of your project on your laptop. Ensure you have a solid understanding of all the terms and technologies mentioned in your resume, and avoid adding anything you're not familiar with.
There’s no need to act overly professional. They prefer a friendly and relaxed conversation, so try to be natural.
I was asked to rate my knowledge of Data Structures and Algorithms (DSA). They then provided some questions and asked me to explain the logic using pen and paper, as well as to write the pseudocode. The questions included:
1. Finding the longest palindromic substring.
2. Reversing a linked list using a while loop.
3. Finding the number of odd-numbered palindromes within a given range (there is a specific pattern to look for).
It's important to present your approach in an optimized way to stand out from others.
I was asked to explain various Machine Learning algorithms and their practical applications. The interviewer questioned why I would choose one algorithm over another in specific scenarios. It’s important to understand the internal workings of the components in your domain thoroughly.
I was also asked about CPU scheduling algorithms and memory management topics like paging and framing. Additionally, they expect a good understanding of multithreading, locks, and other operating system concepts.
Round 4 – Tech HR 2 (upto 1.5 hrs)
This round started with my introduction and was conducted by the most senior members of the team.
Firstly, I was asked to explain my project. They were impressed with my project and appreciated my work. I also showcased a live demo of the project.
Questions in this round also focused on memory management and OS-related concepts. You can expect tree-level questions as well. I was asked to implement the following problems on my laptop after explaining my approach:
1.Convert a normal Binary Tree to a Binary Search Tree without changing the existing structure. (You should have the knowledge of implementing data structures from scratch.)
2.Determine whether there is a cycle in a Linked List.
3.Zigzag conversion (a string-based problem).
Having a strong understanding of DSA and core concepts is essential to succeed in this round.
Additional Tips:
Ensure your resume looks professional and well-organized.
Highlight significant achievements and projects from your college life.
Mention any internships, research, or extracurricular activities that demonstrate your skills and dedication.
Round 5 – Final HR (30mins)
The final HR round was also conducted by a senior technical person.
I was asked to suggest my approach for creating a shortest path algorithm in a given matrix with blockages. Additionally, I was asked to implement the operation of an XOR gate using other gates.
After these technical questions, the discussion moved to more general topics about my college life, favorite subject, short-term goals, and long-term goals.