The interview went around for 25 minutes.

It started with my introduction, then asked questions about my projects, core subjects like DBMS, OOPs, followed by some cross-questioning and follow-ups.

There were some puzzles and questions related to basic DSA like linked lists, sorting techniques, binary search, complexities of various algorithms, etc.

1. Introduction
2. He asked me to design a table in 2NF and convert it to 3NF.
3. Pillars of OOPs
4. Why can't there be two primary keys in a single table?
5. Sorting techniques
6. Which one among the merge sort and quick sort has better space complexity, and why?