This round had 1 coding question for 40 marks (30 mins), followed by 10 Aptitude MCQs in 20 mins (+2 / -0.5 marks per question), 10 Computer Science MCQs in 20 mins (+2 / -0.5) and 5 Systems Engineering MCQs in the last 10 mins (+2 / -0.5).
The coding question was of Dynamic Programming. I was not able to solve it fully but the MCQs were pretty easy. I was selected for the next round.
The round started with the interviewer asking my inputs on the Technical test. Then they went ahead asked me questions about virtual memory, the difference between python and c++, what does 32 bit system mean.
After a few questions the interview was completed CV based they asked me about the projects that I had done, about the work I had done at S.H.E.L.L. Club etc. Questions were on the tools and approaches that I had used in my projects, why did I take that approach, can I do better etc.
So it's very important to build your CV honestly and know your projects in and out.
At the end, I was to ask a question to the panel. This is where you can make an impression and appear unique.
So I talked about the recent enterprise scale cyberattacks and what De Shaw does to be safe. We had a very good talk about the various roles in the organisation and the regulations followed etc.
Fortunately I was selected for the last round.
This round started with the panel asking me to say a few words about myself. Then they questioned me about every thing I had mentioned. I had mentioned that I was the President of SHELL currently and wish to get into the field of Information Security.
As a result my interview was centred around infosec I guess because Systems Engineering and Cybersecurity go hand in hand. I was about to name and justify some vulnerabilities or risks that De Shaw as a hedge fund could have and how they could be resolved. I was asked a GK question about what all happens between between typing www.youtube.com on the browser and its page appearing. Differences in HTTP and HTTPS, CAs in browsers.
Then some DSA questions: describe a binary tree, balanced binary tree, search method that works best with binary tree, why balanced is better.
And one coding question about minimum distance between instances of two integers in an array. Which I was unable to do in linear time at first but with the help of the interviewers the solution came to me.
- Be very interactive and always think loud.
- The interviewers always have a poker face on purposely, don't let that affect your thinking.
- Do not lie on the resume and know it well.
- Brush on GK about Computer Science.