Microsoft Interview Questions
- 0of 0 votes
AnswersReverse link list using recursion.
- Badri August 07, 2011| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test - 0of 0 votes
AnswersWrite a algo for implementing the word prediction for MS word.
- Badri August 07, 2011| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersAd Center SDET interview always asks
- masak July 26, 2011
Regular expression problems
Implement a lexical analyzer
Input string - a C program with Comments
Output- the input C program string without comments| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test String Manipulation - 0of 0 votes
AnswerHow are events handled in COM ?
- fountain July 26, 2011| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Experience - 0of 0 votes
AnswerSCVMM - Or Server tools -SDET position
- fountain July 26, 2011
Test the find /replace dialog| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Testing - 0of 0 votes
AnswersFind the element closest to a given input element in a BST
- fountain July 26, 2011 in United States for SCVMM (Server tools)| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Trees and Graphs - 0of 0 votes
AnswersYou are given a document having lot of words in it and many words have been used it the document more than once ... you are supposed to find each word with their occurrences in the document means its count .... assume you have been given a function char * GetNextWord() which fetches you next word from the document ....
- X July 25, 2011
1) propose the best data structure u will use to tackle this problem.
2) Write an algo to implement this
3) Tell the complexity| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test - 0of 0 votes
Answersyou are given a linked list and you are supposed to take it as input and return its node values as an integer ---
- X July 25, 2011
for example
if linked list it 2->3->4->5->NULL
it should return 2345 integer use functions definition as ---
int myconvert(Node *);
and structure for Node is
struct Node{
int data;
struct Node *root;
};
2) now you are given num1: 2->3->4->NULL;
and num2: 3->4->NULL;
you should take two linked list as input and return a list like 2->6->8->NULL; sum of corresponding elements and return a list
Node * newlist(Node *num1,Node *num2);
3) Write test cases to test 2nd program completely...| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test - 0of 0 votes
Answersfill all the numbers from 1 to 8 in the diagram shown below such that no two consecutive numbers are next to each other(either horizontally vertically or diagonally) i hope i am clear .. i mean 1 can not have a neighbor as 2 , 5 can't have neighbor as 6 or 4 ...
- X July 25, 2011----- | | ------------------- | | | | ------------------- | | | | ------------------- | | -------
| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test - 0of 0 votes
AnswersThese question were asked in Written test held in delhi...
- X July 25, 2011
1) find the bug in the following code which concatenates 2 strings ---
char * concatenate(char *s1,char *s2)
{
char buffer[1024];
int i=0;
while(*s1)
{
buffer[i++]=*s1;
s1++;
}
while(*s2)
{
buffer[++i]=s2;
s2++;
}
return buffer;
}| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test - 0of 0 votes
AnswersThese question were asked in Written test held in delhi...
- ajitpec July 25, 2011
1) find the bug in the following code which concatenates 2 strings ---
char * concatenate(char *s1,char *s2)
{
char buffer[1024];
int i=0;
while(*s1)
{
buffer[i++]=*s1;
s1++;
}
while(*s2)
{
buffer[++i]=s2;
s2++;
}
return buffer;
}| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test - 0of 0 votes
AnswersGiven a rectangle with known width and height, design an algorithms to fill the rectangle using n squares(n is integer, also given) and make sure in the result the wasting area is minimized. Length of square doesn't have to be integer.
- xdunder June 24, 2011
I.e, given width=3,height=2,n=5, one solution is that rectangle can be filled with five 1x1 squares and the wasting area is 1. Another solution could be filled with five 0.9x0.9 squares, but the wasting area is more than first solution.| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersDifference between Dictionary and a Hashtable ?
- soni vashisht June 09, 2011| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersWhats a Linked List ? Given Two linked list forming a Y shaped linked list . Find the intersecting node...where one list has more nodes than the other ? Runtime analysis etc etc .
- soni vashisht June 09, 2011| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test - 0of 0 votes
AnswersSpiral Matrix psuedo code(& logic) :|
- soni vashisht June 09, 2011| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersYou have multiple mail servers in different places around the world, servers have public and private datastores, resources in public datastore are shared obviously and can be read,modified by any user, how will you test the servers?
- ob June 08, 2011| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Testing - 0of 0 votes
AnswersHere I got one question: Merge two arrays and sort them in order as specified at runtime. The two arrays may share common entries between them, but the resultant array must not have duplicates.
- Siva May 19, 2011
Please define this with space and time complexity.| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersWrite test cases for
- Anonymous April 21, 2011
int divide(int a, int b)
you have to use subtract to get the result!| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test C - 0of 0 votes
AnswersGiven 2 sorted integer arrays, find the intersecting element in them.
- ST April 18, 2011| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test