Way 2 Freshers

You are browsing the archives of MICROSOFT pattern.

Question 1. [10]
Find the output of the following program segment
#include
char *c[]={“ENTNG”, “NST”,”AMAZI”,”FIRBE”};
char** cp[]={c+3, c+2, c+1, c};
char ***cpp= cp;
void main() {
printf(“%s”,**++cpp);
printf(“%s “,*–*++cpp+3);
printf(“%s”,*cpp[-2]+3);
printf(“%s”,cpp[-1][-1]+1);
}
Question 2. [5]
Write a function delete(struct node** Head) to delete the linked list node by node by deallocating them from the memory and at the end assign the head pointer to NULL.
void deleteListTest(struct node* headRef) [...]

It had
1] Written test
2] Group Discussion
3] Followed by Multiple Technical Rounds.
Written test was for 2 hours.
I remember only few question
1.Aptitude
2.C
3.C++
4.Datastructure
5.OS
6.Algorithms
7.RDBMS
8..Net
I don’t remember questions, as I had written test a month before. How much I remember I m writing here.
1.There was question on Analytical Reasoning, which had 5 questions
2.They gave a square (5*5 square table). And [...]

There were basically two rounds… One written test and one Technical Interview.
In written test they asked 5 questions and time for completing those questions was 90 mins.
The lvl of difficulty was on an average 8 out of ten (mean real tough paper)… in which one question was purely program writting (it was quick sort actually [...]

Selection procedure and interview questions of Microsoft at Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT)
There were 4 rounds for selection procedure. First round was a written test, second round was group interview and 3rd and 4th rounds were technical interview. Each round had eliminations. Total 143 students were eligible for written test and [...]

These are some of the Microsoft Interview Questions
Round 1:
1. What are your interests? (as in academics/topics)
2. Given a string, search it in a set of strings (say among 1000s of string). What data structure would you use to store those 1000 strings and get the results fastest?
Answer: I answered hash tables but he said suggest [...]