Software Engineer in Test Interview Questions
- 0of 0 votes
AnswerA test plan and cases for a highway system that has three components: (a) a camera that takes pictures of vehicle license plates (b) an embedded system that sends the image taken by the camera and send it to (c) some OCR... link server that actually processes the image and sends details to DMV ticketting system
- Curious August 09, 2011| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Testing - 0of 0 votes
Answer* What exactly I work and my responsibilities
- Curious August 09, 2011
* How do I approach improving efficiency and testing plans| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Experience - 0of 0 votes
AnswersConvert the BST to sorted doubly linked list , don't use additional data struct.
- Badri August 08, 2011| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersPrint the M*N matrix in spiral manner.
- Badri August 08, 2011| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 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 - 1of 1 vote
AnswersWAP to check a tree is symmetric.
- Anonymous August 06, 2011| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test Algorithm - 0of 0 votes
AnswersWAP to reverse pair of nodes in linked list
- Anonymous August 06, 2011| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test Algorithm - 0of 0 votes
Answersfind third largest element of a array in a single pass?
- Anonymous August 06, 2011| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test Algorithm - 0of 0 votes
AnswersWe have two sorted int arrays
- Kavitha fucker July 27, 2011
a[] --> size N --> contains N elements
b[] --> size 2N --> contains N elements, and N vacant locations
Write an algorithm of complexity O(n) such that b[] contains elements of a[] and b[] in ascending order.| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test Algorithm - 0of 0 votes
AnswersFind all the pairs of integers whose sum is S in an int array.
- Kavitha fucker July 27, 2011| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test Algorithm - 0of 0 votes
AnswersWe have two int arrays, find duplicate among them.
- Kavitha fucker July 27, 2011| Report Duplicate | Flag | PURGE
Amazon 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
AnswersThe best data structure to store the phone book.
- Nikhil July 22, 2011
Refer : http://en.wikipedia.org/wiki/Trie| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test - 0of 0 votes
AnswersHow to find a first non repeating character in a String ?
- Nikhil July 21, 2011| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test Java - 0of 0 votes
AnswersWhat is the time to get min element from the binary max heap !!
- Seth July 21, 2011
o(n)
o(logn)
o(log log n))
o(1)| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test