IBM PAPER ON 15th FEBRUARY AT HYDERABAD

IBM PAPER ON 15th FEBRUARY AT HYDERABAD

ROUND 1
It consisted of 4 sections :

Section 1 Verbal :

This section contains only 10 ques: out of which 5 are to be solved from a passage....( approx 100 words ) Try to do at last The remaining 5 ques will be based on Preposition or sentence completion

Section 2 : Aptitude :
It consisted of 25 ques :: Ques on binary conversion were there :

If $ represents 1 and * represents 0 , then evaluate , $$$+$**-$*$
Ques based on Probability
Ques baseed on If 10 can speak Hindi and Eng , 20 can speak hindi and Telegu , 25 can speak Telugu and Bengali ..Find how many can speak only HInd

Section 3 :: Attention To Detail ( 10 Ques )
Find are these alike or not
XXXLUJIJK , XXXLUJIJK , XXXLUJJIK
Be carefull for these ques as person in a hurry tend to do these scoring ques wrong

Section 4 Computers and Fundamentals ( 10 Ques)
Small C prog will be given and tell its output
Ques on ER Diagram
Ques on chmod 755
some more on Unix and DBMS
Out of 55 ques , try at least 35 ques should be correc

ROUND 2
After that they Called for Tech Interview and in that they will ask from ur Project if u r an experienced candidate .. otherwise they will stick to ur basics

ROUND 3 HR
Tell abt urself which is not mentioned in ur resume
Why IBM ?
Sell urself , Why should we recruit you when so many candidates are ther
Why do u wanna leave ur previous company ? ?
Dont mention any negative comments abt ur previous company
What do u expect from IBM ?
List all 48 subjects throughout ur engg ? ?
Tell any three good things abt ur college ..
They will ask u abt relocation .........Initially say anywhere through out the globe and u can speak ur prefernce once u smell the victory

IBM PAPER ON 23rd FEBRUARY

1. Where is your résumé? Sir invigilator stapled it with my ans sheet.
2. Introduce yourself.
3. Why do you want to switch to S/W industry? More opportunities.
4. Write a program in C to sort a list of numbers in descending order.
5. What is static & dynamic logic?
6. Differentiate b/w analog & digital communication.
7. What’s Bi-CMOS?
8. Why do you think we should recruit you?
9. Which is the last book that you have read?
10. Tell me something about the book?
11. Which is your preferred location?
12. Are you ready to relocate?
13. Do you have any questions for us?

MICROSOFT-Placement Paper part-2/2008

MICROSOFT-Placement Paper

Here is are some of the sample puzzles.

*1. Given two cubes, how will you represent all the dates in a month
by using numbers 0 to 9?
You can exchange the cubes and rotate them as you wish!!!
*2. Wife drives down to a meeting point everyday,and reaches this point
at 5.00pm to pick up her husband. Assuming it takes 3 hours reach home driving
back.
One day, husband reaches this point at 4.00pm and decides take a walk towards
home.
Somewhere on the way, his wife picks him up and reach home at 7.50pm.
At what time, his wife would have met her husband?

*3.A camel has to carry 3,000 bananas across a 1,000 mile dessert. There are two
conditions:

a. The camel can only carry 1,000 bananas at a time.

b. The camel eats one banana for each mile he travels.

What is the maximum number of bananas that will reach the other side of the
desert?

I will send you some more. Meanwhile, please visit some of the sites which
Contains puzzles and try solving them. Please do not look for answers!!!!
Unless it is really hard...

Happy preparation.

MICROSOFT-Placement Paper part-1/2008

MICROSOFT-Placement Paper

The paper had three sections(I am not sure about the names of the sections, but the times are correct, trust me!)

Verbal ability 25 qs 20 mts

Mental ability 25 qs 30 mts

Aptitude 20 qs 20 mts

If you just want to go thru the questions, just look at ‘à ’

The first section had basic English qs like use of prepositions, articles and two passages (both windows related):

à The first one was about RAM, and how Windows assigns a bit of RAM to each process and what happens in the case of multi-processing and all that.

à The second one was about DLL (Dynamic Linked Library) files and how they get an operation done.

These passages were followed by a set of questions which were simple if you carefully read the passage. My advice is that you better read the passages first clearly and only then start to answer the questions that follow. If you try to jump off in the middle to answer, you’ll only end up confused(because the choices given are such). That wraps up this section.

The second section mainly had questions involving union and intersection, for example:

à There are 2500 people in a club. 800 were drinkers, 1250 were smokers and 400 were both

drinkers and smokers. The number of teetotalers?

There was not much variation from question to question; I mean all were more or less of the same pattern.

And there were cube-based problems:

à A child was given to paint a cube with the following conditions:

White should face down.

Black and blue should be on the opposite faces.

Golden should be up.

..and some more like this. This was followed by a set of questions which were simple and direct.

The second one was a toughie.

à The cube again, with some conditions for colours. It is cut into two halves parallel to the black faced plane. The first half is cut into 4 equal cubes. And the second part into 32 equal cubes.

The questions were:

Number of cubes with at least one face coloured.

Number of cubes with no face coloured.

Number of cubes which have green on one of their faces.

And some more(this was the last question in the section so I couldn’t get to all).

And finally, the last section. It was a bit easy, comparitively.

It started off with 8 qs of the same type:

à Three set of words(or numbers) are given. If the first and second are exactly same opt for choice 1, if second and third are same, 2, and if first and third, choice3 and if none are same, then choice 4.

amarakbaraliKhan amarakhbaraliKhan amarakbaraliKhan

The answer here would be choice 3(All the choices were 3, by the way).

And then there were these set of questions(till the end, I think):

à Some qualification and conditions were given for a particular job( a bank job):

1. Age should be 25 or less as on Nov1, 2003

2. Should have passed X and XII with 60%.

3. Should have had Economics as a subject in 12^th.

4. Should be fit physically.

If the candidate doesn’t satisfy the 2 norm, he should take a aptitude test.

And some more(not in this order)

And the questions were : Raj passed X and XII with distinction and has ecomics as a subject.

Choices: a. He can be selected.

b. He has to write the test.

c. He will get rejected.

There were 3(?) more questions of this sort.

That wraps up the test. Phew!!! And if you did read till here, do let me know if this helped you in any way.

MICROSOFT 2007

Q1: given a string search it in a set of strings (say among 1000s of
string). What datastructure would you use to store those 1000 strings
and get the results fastest?

Q2: Reverse a linked list?

Q3: Find if there is a loop in a linked List?

Q4: given 2 arrays of no find if each of the two arrays have
the same set of integers ? Suggest a algo which can run faster
than NlogN ?

Q5: Validate a Binary search tree? ( as in the left- right child follow
the property )

Q6: Write a routine that takes as input a string such as ("aabbccdef"
and o/p "a2b2c2def" or "a4bd2g4" for "aaaabddgggg".

Q7: Given a NxN matrix with 0s and 1s. now whenever you
encounter a 0 make the corresponding row and column elements 0.
Flip 1 to 0 and 0 remains as they are.

for eg 1 0 1 1 0
0 1 1 1 0
1 1 1 1 1
1 0 1 1 1
1 1 1 1 1
results in

0 0 0 0 0
0 0 0 0 0
0 0 1 1 0
0 0 0 0 0
0 0 1 1 0

Q8: Given 2 set of arrays of size N(sorted +ve integers ) find the
median of the resultent array of size 2N. (dont even think of
sorting the two arrays in a third array , though u can sort them).
Try smthng better than order N ..order LogN >:) .

Q9: given 1000 bottles of juice, one of them contains poison and tastes
bitter. Spot the spoiled bottle in minimum sips?
(hint: try to mix them)

Q10: whats the diff b/w a thread and a process? are Word and
powerpoint different processes or threads of a single process?

Q11: How does a spell cheaker routine (common to both, word and
Powerpoint) used.. I mean is the code copied 2 times for each of the
processes in teh main memory, if they are diffent processes or how is
it used if they are threads.

Q12. IF the Fibonacci series is 1,2,3,5,8,13,.....
then 10 can be written as 8 + 2 ==> 10010
17 can be written as 13 + 3 + 1 ==> 100101


Q13. I have a file in which there are supposed to be 4 billion numbers,
starting from 1 to 4,000,000,000 but unfortunately one number is missing,
i.e there are only 3,999,999,999 numbers, I need to find the missing
number. In this question he asked me concepts like fopen, what will be the
size of such a file and how such a big file will get loaded into RAM,
and also concepts of logical/virtual/physical memory and memory paging.


Q14. I have an array consisting of 2n+1 elements. n elements in it are
married, i.e they occur twice in the array, however there is one element
which only appears once in the array. I need to find that number in a
single pass using constant memory. {assume all are positive numbers}
Eg :- 3 4 1 3 1 7 2 2 4
Ans:- 7


Q15. There is a temple, whose premises have a garden and a pond. It has 4
idols, each of Ram, Shiv, Vishnu and Durga. The priest plucks x flowers
from the garden and places them in the pond. The number of flowers
doubles up, and he picks y flowers out of them and goes to offer it to
Lord Ram. By the time he reaches to the pond, he finds the remaining
flowers also have doubled up in the meantime, so he again picks up y from
the pond and goes to Lord Shiv.This process is repeated till all the Gods
have y flowers offered to them, such that in the end no flower is left in
the pond. Find x and y.

Q16.There is a central server and some clients connected to it. All the
changes made to data occur at the server, and all the clients have just
read access. You have two options:-
1. Push :- The server keeps pushing data to the clients.
2. Pull :- The client keeps requesting the server to send data.
What are the advantages and disadvantages of each type.
Design a system which uses both the push as well as pull strategy.

Q17.Implement atof function.
Write solid secure code only.

Q18. Find the first unrepeated character in a string of English language in O(n).

Q10. Difference between a 32-bit OS and a 64-bit OS.
Some questions on address space and fetch cycles/ Instruction Set of a
processor.