| Other Data Structures Interview Questions |
| |
| Question |
Asked @ |
Answers |
| |
| Convert the following infix expression to post fix notation
((a+2)*(b+4)) -1 |
| 9 |
| How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3? |
iGate | 28 |
| Explain binary searching, Fibinocci search. |
IBM | 5 |
| applications of stacks and their uses? |
Samsung | 1 |
| What is the average number of comparisons in a sequential
search? |
| 4 |
| How will inorder, preorder and postorder traversals print
the elements of a tree? |
| 11 |
| The element being searched for is not found in an array of
100 elements. What is the average number of comparisons
needed in a sequential search to determine that the element
is not there, if the elements are completely unordered? |
Morgan-Stanley | 11 |
| simple algorithm for bubble sort? |
| 1 |
| how to find the number of possible tree in the given tree. |
Wipro | 12 |
| what is mean by d-queue? |
| 10 |
| What does abstract data type means? |
TCS | 23 |
| 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 |
| |
| 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
