Microsoft papers for NIT JSR juniors

Microsoft placement papers for quick revision:

Give a one-line C expression to test whether a number is a power of 2.

Give a very good method to count the number of ones in a "n" (e.g.32) bit number.

Give a fast way to multiply a number by 7.

Write a function to find the depth of a binary tree.

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.

Given a linked list which is sorted. How will u insert in sorted way.

Do a breadth first traversal of a tree. 

Write a program to find whether a given m/c is big-endian or little-endian!

What is the scope of a static function in C ?

Given a singly linked list, print out its contents in reverse
order. Can you do it without using any extra space?

Given a singly linked list, find the middle of the lis

Pairs of primes separated by a single number are called prime pairs.
Examples are 17 and 19. find nth prime pairs.

visit for more questions


Post a Comment

Popular posts from this blog