Oracle Internship Interview Experience | On-Campus 2021

Oracle came to our campus for Intern positions for the profile – Server Technology. 
Eligibility criteria: Above 7 CGPA.
Branch: CSE

Total number of rounds: 3

Round 1 (Online MCQ Round): Conducted on Oracle’s online platform. It was MCQ based test. 

• It had 4 sections which were Verbal Ability, Coding Skills, Core CSE Concepts, and Software Engineering Aptitude. The sections among themselves had various other subsections. 
• Some of the subsections for Core CSE Concepts were Object-Oriented Programming, DBMS, OS, Complexity analysis, etc. 
• Software engineering aptitude had an interesting subsection that was flowchart-based. The Algorithm/task is given and some of the fields are already filled in the flowchart but some fields are empty. We need to choose the appropriate option from the given options for that particular field. 
• The coding skills section was majorly based on, MCQs related to binary trees and AVL trees.
• The test was in the evening from 6:00 pm- 9:00 pm. The webcam and timer were enabled only after you begin each subsection, as soon as you finish the subsection the timer and webcam stop. This feature helped me in collecting my thoughts and perform well in further sections if I messed up in any previous subsection. 
• 16 students were shortlisted for the next round

Round 2 (Technical Interview): This round was held in the morning at 7:45 AM. It was scheduled on Zoom. He asked me my language preference, I replied with C, C++. Then he asked questions like: 

• What is dynamic memory allocation? What exactly happens when you allocate memory dynamically?
• Difference between calloc and malloc?
• Different memory segments from memory layout in C, like static, heap, stack, etc.
• Why do we use pointers in C?

Then he moved on to ask OOPS concepts like:

• What are the basic principles of OOPS?
• Types of polymorphism and explanation with a use case scenario.
• Overriding and virtual pointer. 
• Then he dropped a question in the chat which was: https://www.geeksforgeeks.org/problems/kth-smallest-element5635/1. I explained to him the naive approach first, which uses sorting, and mentioned the time complexity as well. Then I moved on to the solution which uses heap. I finished writing the code and the interviewer seemed satisfied.
  

Round 3(Technical Interview): This round was more focused on the things that I had mentioned in my Resume. 

• He asked me questions that were derived from the concepts used in my projects.
• He gave me a scenario and asked questions like which data structure I would use, declare a class/struct for the given problem, etc.

Verdict: Selected