Coriolis Interview Experience

Round1:(Online Assessment)

It was containing three coding questions, 1 SQL question, and 10 aptitude questions.

• Coding: 1 easy, 1 medium, 1 hard. (array, mathematics, strings)
• SQL It was an easy Question.
• Aptitude: These were easy to medium level.

Round 2:(Technical 1)

It was purely a Technical round.

Topics Asked:

• Pointers
• OOPS
• Operating systems
• DBMS
• Linked List
• Complexity analysis
• Stack/Heap

He asked me everything in depth. 

Preparation: You can use “GFG Articles” to prepare for the first round as it was just basic but in-depth.

Round 3:(Technical Round 2):

It was harder than the first round. His main focus was on Oops in depth. 

He asked me to implement a linked list at runtime. He was checking my implementation and how to modify it as well. I was also asked about the Binary tree.

Questions:

• Why do we need to encapsulate the member function in the class, the same function can be used globally.
• How an inheritance is working.
•  Add a node at the end of the linked list at runtime.
• Delete the node with a given value.
• where binary trees are used in real life.
• In the execution context who provides us with the stack?