SDE - 1

A research team wants to establish a research centre in a region where they have found some rare elements. They aim to locate the research centre as close as possible to all the rare elements to minimize the overall research costs. It is given that all the rare elements' locations are connected by roads, and the research centre can only be built on a road. The team has decided to assign this task to a coder if you feel you have the potential.

Task: Find the shortest of the longest distances from the research centre to the given locations of the rare elements.

Locations are represented in a matrix where 1 denotes a road and 0 denotes no road. The number of rare elements and their locations are given (number ≤ 5), and the order of the square matrix is less than or equal to 20.

He asked me about users, kernels and threads.

1. Asked me about scheduling algorithms. (Learn)
2. Preemptive vs non-preamptive, (Learn)
3. FCFS, The shortest job first, (Learn)

He then asked me a few questions on OOPs, particularly on inheritance and polymorphism. 
He wrote a small code related to a class inheriting some properties from a parent class and then asked me to completely describe the flow of the constructor, destructor, how an object would be created etc. 
Then he asked even more follow-up questions on it.

A brief about myself. She asked me about my involvement in extracurricular activities at the college since I had mentioned a Position of Responsibility in my resume. Then she asked me how I manage all those stuff and the interview pretty much revolved around my college life only.