MICROSOFT PLACEMENT PAPER IN BIT MESRA

Microsoft visited our campus on 23rd of july 2007 for placement. Only Computer science and IT guys were eligible for the placement test.

The first round was a written round in which we had four questions. First one was to debug a program which contained a lot of errors. The second one was to predict the output for the given recursive program. This one was quite easy.

First 2 questions carried 5 marks each.

Question no 3 was to write a complete program. The question was as under :

there was a string of regular expression given
by a*b?a*c or it could be anything. The point is that

'*' denoted any number of repetition of the previous
character.

'?' denoted only one or zero occurence of the previous
character.

Now i was to input a string and output whether
the entered string is of the given format.

Question no 4 also was to write a program. The question was to convert a given binary search tree into a doubly linked list.

Question nos 3 & 4 carried 10 marks each.

I could write the correct output of the second question and could write only 4 errors in the first question. Along with this, i wrote the code for the third question.

However, i was not shortlisted for the interview. The main thing which they were looking for was the approach of the candidate.

Afterwards, they had three rounds of core technical interviews in which they asked to write all sorts of codes mainly stressing on data structure along with core C programming.

Wish all the best for all those appearing for the Microsoft.