For freshers Campus recruitment
The whole selection process consisted of one written, 3 technical and the last HR round.
The written test consisted of 3 papers(for each paper half an hour was given): Aptitude MCQ (around 28 questions) , Technical MCQ( 30 questions) and subjective paper which had 4 questions out of which 3 were coding ques and 1 was about drawing ER diagram of 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, he 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 give 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, inversing elements in stack in optimized way. He also asked me about web 2.0 and one more "network fly" something term which i didn't know. But then also I was sent for 2nd round of interview which went for 2 hrs. Firstly, he asked about my projects and in which language I made them and why did I choose that specific language. I told C++ and then he asked me it's advantages over C. I started telling about OOPs concept like inheritance, polymorphism etc.. He then asked to give and explain any real time example of inheritance. Then he asked me to design algo for reversing a link list of characters and to find number of right shifts in an array in ascending order. I answered the first question quickly and got stuck in 2nd question in which I was using algo 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 the nuber of shifts which are 3 in this case. Then in 2nd 1 hr, another guy 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 dart board with a bull eye at the center. If some one throws a dart, what is the probability that it will hit the point which near to the center i.e. bull eye. The answer is 1/4. Then they asked questions on networks(explain in detail what happens in background when we type a website address in address bar), database(queries) and OS. The 2 more data structure problems: one was finding finding common parent of 2 given nodes and another was reversing a link list of characters using recursion with no use of temporary pointer variables. First I told but the second one I could do using 1 temporary variable in recursion function.
After all this, I was among top five students. But they selected 2 for HR round and finally 1 student for job+internship.
