| 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 |
| 1) Program A and B are analyzed and found to have worst-
case running times no greater than 150nlog2n and n2
respectively.Answer the folloWing questions if possible..
i) which program has the better guarantee on the running
time,for larger values of n(n>10000) ?
ii) which program has the better guarantee on the running
time,for small values of n(n<100) ?
iii) which program will run faster on average for n =1000
2) wRite a program to compute the number of collisions
required in a long random sequence of
insertions using linear probing ,quadratic probing and
double hashing
3) what is the optimal way to compute A1 A2 A3 A4 A5 A6
where the dimensions of the matrices are
A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30
A6 : 30 X 15
|
KPIT | 3 |
| In which data structure, elements can be added or removed at
either end, but not in the middle? |
Wipro | 41 |
| Q#1: An algorithm is made up of 2 modules M1 and M2.If
order of M1 is F(n) and order of M2 is g (n) then what is
the order of the algorithm.
Q # 2 : How many binary trees are possible with 3 nodes?
with 4 nodes? |
| 4 |
| how to find the number of possible tree in the given tree. |
Wipro | 12 |
| What data structure would you mostly likely see in a non
recursive implementation of a recursive algorithm? |
CTS | 3 |
| What are the parts of root node?
|
BMC | 7 |
| what is AVL tree? |
ADS | 5 |
| A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute? |
| 12 |
| Explain about the types of linked lists |
| 5 |
| How would you sort a linked list? |
| 4 |
| 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 |
| |
| For more Data Structures Interview Questions Click Here |
Did you received any Funny E-Mails from your Friends and like to share with rest of our friends? Yeah!! you can post that stuff 
Site Map
