Microsoft Placement Papers

Paper1        Paper2

Microsoft

Hi All,

I attended the Microsoft GSC test on
15th at Mumbai.
The paper was easy except the programming question
part which was very lengthy compared to the time
alloted.

I m giving below the paper pattern. I m not very good
at remembering the questions exactly so i m just
giving the overview of the test.
There were four sections. All were separate. The time
alloted as well as the question papers also were
separate for each section.

Section I : English language test -25 Qstns.-20
Mints.

It contained usual & easy english language qustns.
like prepositions, articles, antonyms-synonyms etc.
There were two paragraphs. One was about types of
networks & another was about CGI scripting. There were
some easy qstns. asking info. from the para.

Section II : Mental ability -25 Qstns.-30 Mints.

It contained qstns. related to union & intersection
like there r N no. of students in a class, S no. of
them passed in 3 subjects, T no. of them passed in 2
subjects & U no. of them passes in all subjects, what
no. of students failed in all subjects.
Another type of qstns. were related to cubes, like
there is a cube, one side of it is painted with blue
color, the opposite side is painted with yellow color,
now it is cut into 16 cubes of equal size, now how
many cubes r having blue color at one side & no color
at its adjucent side, how many cubes r having no color
at any side etc.
Then there were qstns. like if + means -, * means /,
means *, / means +, then which of the following is
true ; there were four options. Each having some
calculation like 12+8-3*5/32=13. We have to select the
option having the correct calculation.
Most of the questions were similar to the above
mentioned patterns.

Section III : Aptitude test -20 Qstns.-20 Mins.

This section contained qstns. exactly like those asked
in the Bank PO, Railways & UPSC exams. Its different
from usual apti. qstns.

E.g. which two of the following are same : 11225689 :
11225986 : 11225689.

Then Data sufficiency qstns. like statement 1 is
sufficient to get the answer, both 1 & 2 needed,
neither 1 nor 2 can give the answer etc.
Then Condition checking qstns. like there is a
recruitment of clerk. Some conditions r given like the
candidate should be graduate with 60%, his age should
be less then 30 years, typing speed should be atleast
45 wpm. etc.
Based on this we have to answer a perticular candidate
will be selected or not given his details.
Then Some simple & usual riddles like Ram goes to 5 km
east, then 5 km south, then west, now in which
direction he is. Then a man pointing to a photo says
he is the son of my grandmothers' son like that.

Section IV : Programming -C & DFS OR VB -40 Qstns.
30 Mins.

U can choose either C & DFS paper or VB paper. I chose
C & DFS.
This was the toughest part bcoz qstns. were lengthy &
time was very short. Both C & DFS qstns. were almost
equal. Most of the C qstns. were asking about the
output of the given code. The DFS qstns. were about
link list, array, queue & also the graph theory.
This section demands a thorough preparation of C & DFS
& Graph theory.