### Microsoft Freshers Interview Questions

There will be 3 interviews:- The first two are compulsory, if you do well in these, you will be called for the 3rd one.

1. If the Fibonacci series is 1,2,3,5,8,13,..... then 10 can be written as 8 + 2 ==> 10010 and 17 can be written as 13 + 3 + 1 ==> 100101. Got it??
The Question was, given n, I need to get all possible representations of n in Fibonacci Binary Number System.
as 10 = 8 + 2 ==> 10010
also 10 = 5 + 3 + 2 ==> 1110

2. 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.

3. 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

4. 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.

1. Asked About My Btech Final year Project. Design your own compiler that does trace back optimization.Give hypothetical test cases for your compiler.

2. 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.

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

1. a) What is your CGPA?

b )What are your immediate goals?

c) What are your long term goals?

d) And some more questions on academics.

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

3. Simple questions on Probability.

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

1. first interview Q1
the encoding scheme is a bit map data
structure
read the bits from right if the bit is set corresponding fibo number is present in the required sequence
I think this hint was enough for the soln

2. first interview Q2
we can use the same data structure as in the first quest so we can have 4 billion bits to and we can set or reset the corresponding bit to indicate the presence of the number
this is a trade off of time for space
it is easy to check for the missing number in this way
and the problem of loading such a huge file would also be solved if we are constrained of memory

3. first interview Q4
he says all gods are offered flowers not goddess
so the answer is x=7 y=8

4. interview 1 : q no : 3
Just ex-or the given elements once. U ll get the number that occurs once.

Example 3 4 1 3 1 7 2 2 4

Ans : 3^4^1^3^1^7^2^2^4

5. first interview Q4
he says all gods if you take 4 idols into count then..
so the answer is x=15 y=16

6. I have provided two solutions in Java. I think method_2 is better than method_1 since in method_2, there is less chance of integer overflow.

- SS

/**
* @param sequence : Sequence of length N Contains integers 1 to (N + 1)
* with one number missing. The array is unsorted.
*
* @return The missing number
*/
public static int method_1(int [] sequence)
{
// this can overflow
int allSum = ((sequence.length + 1) * (sequence.length + 2)) / 2;

int seqSum = 0;
for (int i = 0; i < sequence.length; ++i)
{
// this can overflow
seqSum += sequence[i];
}

return allSum - seqSum;
}

/**
* @param sequence : Sequence of length N Contains integers 1 to (N + 1)
* with one number missing. The array is unsorted.
*
* @return The missing number
*/
public static int method_2(int [] sequence)
{
int missingNum = sequence.length + 1;
for (int i = 0; i < sequence.length; ++i)
{
missingNum += ((i+1) - sequence[i]);
}

return missingNum;
}

7. First interview Q2
Find the sum of 'n' natural numbers using
s(n)=n(n+1)/2 and sum of numbers in the file.subtact both sums,u'll get the required number.

8. intrvw1 : Q 4 x=15 y=8

9. yes ...
x=15 and y=8 is the correct answer

10. First interview:
Q4.x=30,y=16.

11. x=15/16y.....so any y can be any multiple of 16 like 16,32,48......and x=15,30,45.....respectively....so we will get multiple answers.....x=15,y=16....x=30,y=32...and so on...

12. can u pls teel the ans of Q1 of first round

13. Tks very much for your post.

Avoid surprises — interviews need preparation. Some questions come up time and time again — usually about you, your experience and the job itself. We've gathered together the most common questions so you can get your preparation off to a flying start.

You also find all interview questions at link at the end of this post.

Best rgs

14. Mu comment debini hela��

15. HI thanks for the useful interview questions ms office training courses

16. Hi Thanks for the nice information its very useful to read your blog.