Software Engineer in Test Interview Questions
- 0of 0 votes
AnswersHow do implement Circular Queue?
- manish August 04, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersHow do implement Queue using Stack and Stack using Queue
- manish August 04, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersGiven two arrays, 1,2,3,4,5 and 2,3,1,0,5 find which number is not present in the second array.
- manish August 04, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersGiven a book find out the number of times each word appeared. Upon clarification I was told the following things 1. punctuations should be removed 2. case sensitive 3. assume book is given as a huge string to the function prototype 4. Words need not be ordered in any way
- prolific.coder July 13, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test String Manipulation - 0of 0 votes
AnswerTesting a text box.
- sps July 11, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Testing - 0of 0 votes
AnswersTesting a object(paper weight) kind of question.
- sps July 11, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Testing - 0of 0 votes
Answerimplement File.Copy functionality in C#
- sps July 11, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test C# - 0of 0 votes
Answersfind the maximum subsequence sum in a linked list. Consider the node as shown below.This node class has a extra item isvertex which determines whether the node is a vertex r not.
- sps July 11, 2010
so find the longest distance between any 2 vertex in the linked list.
Node SLL{
int data;
Node n;
bool isVertex;
}| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Linked Lists - 0of 0 votes
AnswersFind the least common ancestor .
- Neha July 09, 2010| Report Duplicate | Flag | PURGE
Google Software Engineer in Test Algorithm - 2of 2 votes
AnswersInput : Two large singly linked lists representing numbers with most significant digit as head and least significant as last node.
- Abhay Srivastava July 01, 2010
Output: Difference between the numbers as a third linked list with Most significant digit as the head.
Eg:
---
Input:
A = 5->4->2->0->0->9->0->0
B = 1->9->9
Output:
C = 5->4->2->0->0->7->0->1
Required complexity :
O(n)
Constraint:
Reversing linked list is NOT allowed| Report Duplicate | Flag | PURGE
National Instruments Software Engineer in Test - 0of 0 votes
AnswersWhat should be the test strategy for testing a text engine?
- manish June 27, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Testing - 1of 1 vote
AnswersWrite test case for sorting an interger array.This is a simple sort program.
- GD June 15, 2010| Report Duplicate | Flag | PURGE
Software Engineer in Test Testing - 0of 0 votes
Answers
- Paladin June 09, 2010int IsAnagram(char* str1, char* str2)
| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
Answers
- Paladin June 09, 2010int CutNPaste(char* str, int start, int stop, int destination)
| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test String Manipulation - 0of 0 votes
AnswersThere is an array of size 'n' in which first 'a' elements are sorted in either ascending/descending order . The remaining elements 'n-a' elements are again sorted in ascending/descending. Find the index of the point of inflexion.If both parts are sorted in the same way return -1.
- Tenali June 08, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersWrite a program to convert infix expression to postfix expression
- Anonymous June 07, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersWrite a program to find the mirror image of a n-ary tree
- Anonymous June 07, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Trees and Graphs - 1of 1 vote
AnswersPrint a matrix spirally
- Anonymous June 07, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Matrix - 0of 0 votes
AnswersConsider 2 integer Arrays A and B. The elements in both arrays are arranged in ascending order. One of the arrays has exact sufficient space at the end to accommodate the other. Write a function to merge both arrays in ascending order and place it in the largest array.
- Babu Hemanth Kumar May 29, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test C - 0of 0 votes
AnswersConsider a right angled Triangle ABC, right angled at B. Lenght of side A (side opposite to angle A)is given. Write a function to find the lengths of side B and side C. The function should take the inputs ( Length of side A and one acute angle either B or C in radians).
- Babu Hemanth Kumar May 29, 2010
1. Write all test cases.
2. Avoid division by zero.
3. Give different ways to implement cosine and sine functions. which one is best and why.| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test C - 0of 0 votes
AnswersThere are 10 Apple trees. A Farmer has placed these trees in 5 rows of 4 each... Can you tell me how to do it???
- Babu Hemanth Kumar May 29, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Brain Teasers - 0of 0 votes
Answershow will you implement pow(a,b) without using multiplication or division operators. You can use only add/substract operators.
- Anonymous May 23, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm - 0of 0 votes
AnswersGiven an array , delete all duplicates in it.
- Abhinav May 19, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test - 0of 0 votes
AnswersTwo unsorted linked lists are given.
- Abhinav May 19, 2010
Find the union.
Eg: a) 1->9->9->5->7->8->9->7
b) 44->33->1->9->55
Result:
1->9->5->7->8->44->33->55
The elements in the result can be in any order| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test - 0of 0 votes
AnswersGiven a very very long linked list with 'n' nodes.
- Abhinav May 19, 2010
Also given a positive integer 't'>1.
Delete every 't'th node. In the resultant linked list, again delete 't'th node. Repeat this till only t-1 nodes remains.
Find the node.
Eg:
Linked list : 10->20->30->40->50->60->70
n = 7
t = 3
Phase 1:
10->20->40->50->70
Phase-2:
10->20->50->70
Phase-3:
10->20->70
Phase-4:
10->20
Simple solution with many traversals is obvious.
Is there a solution with one traversal or O(n)?
b) Similar for circular linked list.
Keep deleting 't'th node till 1 node remains.
Note here not till 't-1' nodes but till 1 node remains.| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test Algorithm C Coding - 1of 1 vote
AnswersGiven a Hash -
my %hash = ( ABC => [123,456,789], PQR => 345, XYZ => 567, LMN => { abc => 0, pqr => 1, lmn => 2, xyz => { A => 0, B => 1, c => [ {1 => 'ONE', 2 => 'TWO',}, {ONE => 1, TWO => 2,}, {Number => 'Decimals'}, {Words => 'Alphas'}, 'Sample' ] } }, OPQ => 'WORD' );
Write a generic function to find value of key input by user.
- Roshan May 19, 2010
e.g. In above example if key input by user is 'Words' then value found by search function should be 'Alphas'
Write Search($hashRef,$key) function where, hash could be of any type/level such as -
Hash of Hash of Hash of Hash
Hash of Array of Hash.
etc. etc.| Report Duplicate | Flag | PURGE
Amazon Software Engineer in Test Perl - 0of 0 votes
AnswersImagine you have a hard disk with blocks of memory 1..n. Files can be stored on one or more of these blocks. If a file spans more than one block, you can know the next block by querying the current block. Also you can query block with Node.isEmpty() method to know if it has any data. The system has a table which has a list of the files and the first node of each file. But that table has been corrupted, reconstruct that table. The names of the files are immaterial and you can get the index as well as the name of the nextblock when you query for Node.NextBlock()
- prolific.coder May 15, 2010| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test - 0of 0 votes
AnswersGiven a array of random integers, sort the odd elements in descending order and even numbers in ascending order.
- k May 09, 2010
e.g. for i/p (1,4,5,2,3,6,7)
O/p = (7,5,3,1,2,4,6)
Optimize for time complexity.| Report Duplicate | Flag | PURGE
Microsoft Software Engineer in Test