Tip 1 : Revise data structures and operating systems very well.
Tip 2 : Have a good resume with self-made projects and internship experiences as they add value to the candidature.
Tip 3 : Be confident and know the basics well.
Tip 1 : Have some good projects and know the tech stack well enough.
Tip 2 : Never include anything which you are not confident about.
The test had 3 parts:
1. Aptitude - 20 questions to be done in 25 minutes. (Medium level)
2. Technical MCQs - 25 questions to be done in 35 minutes. (Medium-Hard level) (HTML, JS, CSS, SQL)
3. Coding - 2 out of 3 questions to be done in 40 minutes. 20 minutes were allotted for each question. No switching between the codes was allowed. (1-easy, 2-medium in total)
Do not print anything, just return the number of set bits in the binary representation of all integers between 1 and ‘N’.
‘N’ = 90
Possible values for ‘M’ are:
1. 259 (2*5*9 = 90)
2. 3352 (3*3*5*2 = 90)
3. 2335 (2*3*3*5 = 90)
4. 952 (9*5*2 = 90), and so on.
Here, ‘259’ is the smallest possible ‘M’. Thus, you should return ‘259’ as the answer.
It was the first face-to-face technical round. The medium was ModernHire. There was only 1 member in the interview panel. This round tested me on C fundaments, Operating System basics, and problem-solving skills.
Questions asked:
What are the TRUNCATE, DELETE and DROP statements?
What are void elements in HTML?
Define multipart form data?
1. How does the C compiler works?
2. What are deadlocks and why does it happen?
3. How to resolve deadlock?
4. What is a kernel?
5. How to dynamically allocate memory in C?
6. What is makefile?
7. What is multi-threading and why is it useful?
8. What is the need for synchronization in OS?
9. How do you run a program of 10 GB using 2 GB memory?
10. What are semaphores and mutex?
11. How is HashMap implemented?
12. Difference between linker and loader.
13. Importance of header files.
14. What is Dynamic binding?
15. What type of database should you use where transactions are involved?
16. Brief discussion on the Internship experience.
Merge Sort Algorithm -
Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.
The above illustrates shows how merge sort works.
It is compulsory to use the ‘Merge Sort’ algorithm.
This was a managerial cum technical round. I was asked to introduce myself (both technical details and hobbies). Then I was asked about my internship experiences and what I learnt from them. After that, he asked me questions about the projects mentioned in my resume. He tested my in-depth knowledge of the technologies that I used. He also asked me about the alternative solutions and the drawbacks of my solution.
After that, he asked me to speak about Operating Systems for 5 minutes without giving a pause. Then he asked me to speak about the OSI model and the TCP/IP model for the next 5-10 minutes again without giving a pause. He appreciated my perfomance and gave me a coding question.
What is User-defined function? What are its various types in SQL. What is an Alias in SQL?
Then he asked me whether I had any questions.
Assume that the Indexing for the singly linked list always starts from 0.
Typical HR questions were asked in this round.
Introduce yourself.
Mention something that is not in your resume.
Why are you fit for this role?
Why HPE?
Plans for higher studies.
Tip 1 : Be Honest
Tip 2 : Be confident.
Tip 3 : Keep a smile always.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?