Coding Question for Shortlisting:

Given a graph, find out if it can be colored using 2 colors. Different colors for alternate nodes.

(3 hours)

People who passed all 10 test cases were shortlisted.

Note:

You can compile your code as many number of times as you want, but a maximum of 5 submissions were allowed to test on the given test cases.

Round 1 (Technical - around 50 minutes):

1. Introduce yourself.

2. Reviewed my CV, asked questions about my Experiences, Projects, and Courses (specifically Networks).

3. "Which language are you comfortable with?" I said C++.

4. Wrote a few code snippets on run-time polymorphism and asked me to predict their outputs. Examples included virtual destructors and inheritance with the virtual keyword.

5. Asked, "What are pure virtual classes?"

6. Presented code snippets involving pointers and asked for their outputs. Examples included const pointers and pointers to const.

7. Asked how I solved the coding round question. I said BFS. The interviewer did not inquire further.

8. Asked if I knew Dijkstra's Algorithm. I said yes and was asked to write the pseudocode, which I did quickly. I was then asked to explain why Dijkstra's algorithm fails when negative weights are present in the graph.

9. Asked me to write my own typedef operator. I used a function template to write a generic function.

10. OOPS Concepts: Critical Section, Mutex, Semaphores, Paging, Techniques to swap out pages (Least Recently Used, Least Frequently Used).

11. "Do you have any questions?" I asked about ongoing projects and R&D work.