| Other Data Structures Interview Questions |
| |
| Question | Asked @ | Answers |
| |
| How will inorder, preorder and postorder traversals print
the elements of a tree? | | 6 |
| Explain about the types of linked lists | | 4 |
| What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero) | Sasken | 8 |
| Write a Binary Search program | | 2 |
| 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 | 10 |
| 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 | 7 |
| Which sort show the best average behavior? | | 6 |
| What is a data structure? | Keane-India-Ltd | 3 |
| What data structure would you mostly likely see in a non
recursive implementation of a recursive algorithm? | | 2 |
| What do you mean by: Syntax Error, Logical Error, Runtime Error? | | 2 |
| In which data structure, elements can be added or removed at
either end, but not in the middle? | Wipro | 19 |
| Evaluate the following prefix expression " ++ 26 + - 1324" | Patni | 8 |
| What are the parts of root node?
| BMC | 2 |
| How would you sort a linked list? | | 2 |
| Parenthesis are never needed in prefix or postfix
expressions. Why? | | 6 |
| Explain binary searching, Fibinocci search. | IBM | 1 |
| What do you mean by Base case, Recursive case, Binding Time,
Run-Time Stack and Tail Recursion? | TCS | 1 |
| Write the programs for Linked List (Insertion and Deletion)
operations | | 1 |
| How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3? | iGate | 9 |
| Convert the following infix expression to post fix notation
((a+2)*(b+4)) -1 | | 7 |
| |
| For more Data Structures Interview Questions Click Here |