Background: Engineer (Computer)
Date: 08 March 2019
Slot: Afternoon
WAT Topic:
Sadly I do not remember the exact WAT topic, but it was something related to a social cause and was a general topic.
Personal Interview:
So there were 3 panelists for the PI round. One was a faculty of SJMSOM [P1], on was an alumnus [P2] and the other was a professor of the Engineering department of IIT Bombay [P3]. So after all the greeting and all, I sat down.
P1: So tell me something about yourself in brief.
Answer: Started with the well-rehearsed answer about academics, co-curricular, etc.
P3: [cuts in between] wait you told you have a channel on youtube. What’s it about ?
Answer: Told him about my channel on youtube by the name of The Data Structures, what it is all about etc.
P3: So being an engineer tell me what is theoretical resistance.
Answer: I was completely unaware of the same hence stated I do not know.
He asked me 4 to 5 questions of similar types and by the terms in the question, I was thinking that it might be from physics. However, I answered that I did not know anything about the same. [nervous moments]
P3: Did you study anything in the first year of your degree or just time pass. All of this is thought in the first year of engineering.
Answer: This was when I realized why I had never heard those terminologies. I told him politely that since I am a DIPLOMA holder we never study the first year and directly get admission in the second year of engineering.
Hearing this all 3 started seeing each other’s face and finally changed the questions back to my strong parts.
P3: So it seems data structures was your favorite subject.
Answer: I answered in the affirmative.
P3: Explain to me what is a binary search and the complete process of the same.
Answer: Explained to him what is a binary search, the complete process of eliminating one half of the list each time and the advantages over linear search.
P3: So explain to me what is a Tree and how to construct a Binary Search Tree.
Answer: Explained to him about trees and how to keep adding nodes to the left and right of a node in Binary Search Tree.
P3: [Drew a tree on a sheet of paper] Explain to me Pre-order, Post-order and In-order traversal.
Answer: Was confused in the beginning but finally explained to him and gave him the serial order of traversal through the nodes of the tree for each traversal.
P3: Tell me the difference between directed graphs and undirected graphs.
Answer: Took a piece of paper and drew out two diagrams and explained to him the same.
P3: Explain to me the Djikstra’s algorithm.
Answer: Sadly, I forgot this at the end moment and told him politely that I was not able to recollect.
P3: Ok so that’s it from my side. [Looking at the other 2] You may ask if you want.
P2: So you had stated you have a certification in Digital Marketing. Explain to me the difference between SEO and SEM.
Answer: Gave him the complete difference between the two and how each impacts the amount of traffic that would be drawn to your website.
P2: And how do you improve or optimize the monetary payment for SEM. What factors are to be taken into consideration?
Answer: Explained the keyword factor and how the bidding process is done. [He looked satisfied with the answer.]
P1: Ok so tell me have you heard about the term sustainability with regards to environmental protection? [I answered yes to the same] So explain what is this sustainability.
Answer: Explained what is sustainability and also gave an example of the bullet train project on how the JICA is moving the full-grown trees to another location rather than chopping them down.
P1: So if you might have heard then please tell me about the 7 goals of Sustainability as specified by the United Nations.
Answer: I was completely unaware of those sustainability goals hence told him the same politely.
P1: Ok so that’s it from our side. All the very best.
Said thank you to the panelists and came out of the interview room. Overall a good interview [except the initial setback of questions from the first year] lasting around 15 - 18 minutes.
VERDICT: CONVERTED
