For freshers Campus recruitment.

The whole selection process consisted of one written test, 3 technical rounds, and the last HR round.

The written test consisted of 3 papers (half an hour was given for each paper):

• Aptitude MCQ (around 28 questions)
• Technical MCQ (30 questions)
• Subjective paper which had 4 questions, out of which 3 were coding questions and 1 was about drawing an ER diagram for a given detailed question.

I cleared the 1st round, in which they selected 14 out of 280 students. Then we had technical interviews.

In my 1st technical interview, the interviewer asked about my area of interest. I told him that I am mainly interested in coding in C/C++. He gave a problem and asked me to provide an algorithm for it. It was a pattern that I had to print:

n=2               n=3
 00                000
 01                001
 10                002
 11                010
                   011
                   012
                   020
                   021
                   022

similarly, total combinations: pow(3,3)=27.

I gave the algorithm that will print this pattern. Then he asked me other simple programs like reversing a string using recursion, and inverting elements in a stack in an optimized way. He also asked me about Web 2.0 and one more term, "network fly", which I didn't know. But then also, I was sent for the 2nd round of interview, which went for 2 hours.

Firstly, he asked about my projects and in which language I made them and why I chose that specific language. I told him C++, and then he asked me its advantages over C. I started telling him about OOPs concepts like inheritance, polymorphism, etc. He then asked me to give and explain any real-time example of inheritance. Then he asked me to design an algorithm for reversing a linked list of characters and to find the number of right shifts in an array in ascending order. I answered the first question quickly and got stuck in the 2nd question, in which I was using an algorithm similar to binary search technique. The 2nd question was: For example, there is an array in ascending order: 1, 2, 3, 4, 5, 6, and it is right-shifted as 4, 5, 6, 1, 2, 3. We have to calculate the number of shifts, which is 3 in this case.

Then, in the 2nd hour, another interviewer came, and he asked me one question on probability, which is my weakest area in maths. The question was pretty simple, but I took time to answer it. It was: There is a dartboard with a bullseye at the center. If someone throws a dart, what is the probability that it will hit a point near the center, i.e., the bullseye? The answer is 1/4.

Then they asked questions on networks (explain in detail what happens in the background when we type a website address in the address bar), databases (queries), and OS. There were 2 more data structure problems: one was finding the common parent of 2 given nodes, and another was reversing a linked list of characters using recursion with no use of temporary pointer variables. First, I told him, but the second one I could do using 1 temporary variable in the recursion function.

After all this, I was among the top five students. But they selected 2 for the HR round and finally 1 student for the job + internship.

Probability question.

(It was okay, but unexpected.)