| Other Data Structures Interview Questions |
| |
| Question |
Asked @ |
Answers |
| |
| Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements. |
Syntel | 22 |
| What is the average number of comparisons needed in a
sequential search to determine the position of an element in
an array of 100 elements, if the elements are ordered from
largest to smallest? |
ABB | 17 |
| I am given a sequential algorithm that does a routine search
on an unordered list. N = 20.
The probability that the value x does NOT appear in the list
is exactly 60%, and the probability that x DOES appear is 40%.
The 3 questions that I could not get were:
A) What is the avg number of element comparisons performed
when n = 20 and x does NOT appear in the List.
(my answer was 20, is this correct?)
B) What is the avg number of element comparisons peformed
when n = 20 and x DOES appear in the list?
C) What is the avg number of element comparisons performed
when n = 20. This should be a single number answer they said. |
| 3 |
| simple algorithm for bubble sort? |
| 1 |
| wt is a datastructure |
CybAge | 8 |
| No. of possible ordered trees with n nodes ? Please give
formula (if any). |
| 1 |
| Parenthesis are never needed in prefix or postfix
expressions. Why? |
Microsoft | 11 |
| why do tree always takes o(log n) time? |
TCS | 1 |
| what is the different between B-tree and B+ tree. |
Syntel | 6 |
| what is AVL tree? |
ADS | 5 |
| Convert the following infix expression to post fix notation
((a+2)*(b+4)) -1 |
| 9 |
| Write a Binary Search program |
Microsoft | 7 |
| |
| For more Data Structures Interview Questions Click Here |
To Refer this Site to Your Friends 
Site Map
