-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 41
#SoftwareEngineer
#2017
##Round 1 : Online Test There were 60 questions divided in 3 sections. 30 mins were allotted for each section. On the elapse of 30 mins, it automatically moved on to the next section. 20 - general aptitude (logical reasoning, quantitative aptitude) 20 - basic programming in C/C++ 20 - advanced computer science(mainly from pointers and OS)
##Round 2 : First Technical Interview
- Tell me something about yourself and your academic qualifications.
- Detailed description of summer project (I was asked to explain the algorithm used in detail as well as the results) P.S. This was asked for both the projects done in summers of '16 and '17 with more stress on the more recent one.
- The interviewer asked me about the weakness mentioned in the CV.
P.S. : A lot of stress was placed on CV and everything mentioned had to be explained in detail.
He then asked two questions : a) Given a number 'n', find the number of set bits in the binary representation of 'n'. b) There are 3 boxes : one containing apples, the other oranges and the third one mixed. All these boxes are labelled wrong. You can pick up only one fruit from only one box. You have to relabel the boxes correctly.
##Round 3 : Second Technical Interview I was asked about the subjects covered in the curriculum and asked me my favourite subject. I answered 'Data Structures' and he asked the following questions.
- What is a data structure?
- Explain arrays vs linked list.
- Write the code for deletion from a linked list. (There should be no memory leakage and all possible cases should be considered)
- Given a hexadecimal number, convert it to decimal.
- Describe the 7-layered OSI model in detail and explain the functioning of each layer.
- What is firewire?
##Round 4 : HR I was again asked to describe about myself and the summer projects. She then asked me about my family, my future plans and the area I would prefer working on if I join the company.