Placement Papers - Microsoft

Why Microsoft Placement Papers?

Learn and practice the placement papers of Microsoft and find out how much you score before you appear for your next interview and written test.

Where can I get Microsoft Placement Papers with Answers?

IndiaBIX provides you lots of fully solved Microsoft Placement Papers with answers. You can easily solve all kind of placement test papers by practicing the exercises given below.

How to solve Microsoft Placement Papers?

You can easily solve all kind of questions by practicing the following exercises.

MICROSOFT PLACEMENT PAPER (ALGORITHM & PROGRAMMING)

Posted By : Sarika Datir Rating : +9, -0

PAPER: MICROSOFT PLACEMENT PAPER (ALGORITHM & PROGRAMMING)

Algorithms and Programming
 
1. Given a rectangular (cuboidal for the puritans) cake with a rectangular piece removed (any size or orientation), how would you cut the remainder of the cake into two equal halves with one straight cut of a knife ?
 
2. You're given an array containing both positive and negative integers and required to find the sub-array with the largest sum (O(N) a la KBL). Write a routine in C for the above.
 
3. Given an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
 
4. Write a routine to draw a circle (x ** 2 + y ** 2 = r ** 2) without making use of any floating point computations at all. [ This one had me stuck for quite some time and I first gave a solution that did have floating point computations ].
 
5. Given only putchar (no sprintf, itoa, etc.) write a routine putlong that prints out an unsigned long in decimal. [ I gave the obvious solution of taking % 10 and / 10, which gives us the decimal value in reverse order. This requires an array since we need to print it out in the correct order. The interviewer wasn't too pleased and asked me to give a solution which didn't need the array ].
 
6. Give a one-line C expression to test whether a number is a power of 2. [No loops allowed - it's a simple test.]
 
7. Given an array of characters which form a sentence of words, give an efficient algorithm to reverse the order of the words (not characters) in it.
 
8. How many points are there on the globe where by walking one mile south, one mile east and one mile north you reach the place where you started.
 
9. Give a very good method to count the number of ones in a "n" (e.g. 32) bit number.
 
ANS. Given below are simple solutions, find a solution that does it in log (n) steps. Iterative
 
function iterativecount (unsigned int n)
begin
 
int count=0;
 
while (n)
 
begin
 
count += n & 0x1 ;
 
n >>= 1;
 
end
 
return count;
 
end
 
Sparse Count
 
function sparsecount (unsigned int n)
 
begin
 
int count=0;
 
while (n)
 
begin
 
count++;
 
n &= (n-1);
 
end
 
return count ;
 
end
 
10. What are the different ways to implement a condition where the value of x can be either a 0 or a 1. Apparently the if then else solution has a jump when written out in assembly. if (x == 0) y=a else y=b There is a logical, arithmetic and a data structure solution to the above problem.
 
11. Reverse a linked list.
 
12. Insert in a sorted list
 
13. In a X's and 0's game (i.e. TIC TAC TOE) if you write a program for this give a fast way to generate the moves by the computer. I mean this should be the fastest way possible.
  ANS:- The answer is that you need to store all possible configurations of the board and the move that is associated with that. Then it boils down to just accessing the right element and getting the corresponding move for it. Do some analysis and do some more optimization in storage since otherwise it becomes infeasible to get the required storage in a DOS machine.
 
14. I was given two lines of assembly code which found the absolute value of a number stored in two's complement form. I had to recognize what the code was doing. Pretty simple if you know some assembly and some fundas on number representation.
 
15. Give a fast way to multiply a number by 7.
 
16. How would go about finding out where to find a book in a library. (You don't know how exactly the books are organized beforehand).
 
17. Linked list manipulation.
 
18. Tradeoff between time spent in testing a product and getting into the market first.
 
19. What to test for given that there isn't enough time to test everything you want to.
 
20. First some definitions for this problem: a) An ASCII character is one byte long and the most significant bit in the byte is always '0'. b) A Kanji character is two bytes long. The only characteristic of a Kanji character is that in its first byte the most significant bit is '1'.
 
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
 
21. Delete an element from a doubly linked list.
 
22. Write a function to find the depth of a binary tree.
 
23. Given two strings S1 and S2. Delete from S2 all those characters which occur in S1 also and finally create a clean S2 with the relevant characters deleted.
 
24. Assuming that locks are the only reason due to which deadlocks can occur in a system. What would be a foolproof method of avoiding deadlocks in the system.
 

25. Reverse a linked list.
 
Ans: Possible answers -
 
iterative loop
curr->next = prev;
prev = curr;
curr = next;
next = curr->next
endloop
 
recursive reverse(ptr)
if (ptr->next == NULL)
return ptr;
temp = reverse(ptr->next);
temp->next = ptr;
return ptr;
end
 
26. Write a small lexical analyzer - interviewer gave tokens. expressions like "a*b" etc

Like this page? +9 -0




Companies List:

3i Infotech - AAI - ABACUS - ABB - Accel Frontline - Accenture - Aditi - Adobe - ADP - Agreeya - Akamai - Alcatel Lucent - Allfon - Alumnus - Amazon - Amdocs - AMI - Andhra Bank - AppLabs - Apps Associates - Aricent - Ashok Leyland - Aspire - Atos Origin - Axes - Bajaj - Bank of Maharashtra - BEL - BEML - BHEL - BirlaSoft - Blue Dart - Blue Star - BOB - BPCL - BPL - Brakes - BSNL - C-DOT - Cadence - Calsoft - Canara Bank - Canarys - Capgemini - Caritor - Caterpillar - CDAC - CGI - Changepond - Ciena - Cisco - Citicorp - CMC - Consagous - Convergys - CORDYS - Crompton - CSC - CTS - Cummins - Dell - Deloitte - Delphi-TVS - DeShaw - Deutsche - Dotcom - DRDO - EDS - EIL - ELGI - ELICO - ERICSSON - Essar - Fidelity - Flextronics - Freescale - FXLabs - GAIL - GE - Genpact - Geodesic - Geometric - Globaledge - GlobalLogic - Godrej - Google - Grapecity - HAL - HCL - Hexaware - Honeywell - HP - HPCL - HSBC - Huawei - Hughes - IBM - IBS - ICICI - iGate - Impetus - iNautix - Indian Airforce - Indian Airlines - Infosys - Infotech - Intec - Integra - Intergraph - IOCL - iSOFT - ISRO - Ittiam - JSW - Keane - Kenexa - L & T - L & T Infotech - LG Soft - Lifetree - LionBridge - Mahindra Satyam - Mastek - Maveric - McAfee - MECON - Microsoft - MindTree - Miraclesoft - Mistral - Motorola - Mphasis - MTNL - NIC - Nokia Siemens - Novell - NTPC - Nucleus - ORACLE - Patni - Perot - Polaris - Ramco - Robert Bosch - Samsung - SAP - Sapient - Sasken - SBI - Sierra Atlantic - Sonata - Sony India - Sutherland - Syntel - TCS - Tech Mahindra - VeriFone - Virtusa - Wipro - Zensar.