| Other Data Structures Interview Questions |
| |
| Question | Asked @ | Answers |
| |
| Stack can be described as a pointer. Explain. | Wipro | 1 |
| Which sort show the best average behavior? | | 6 |
| When will you sort an array of pointers to list elements,
rather than sorting the elements themselves? | | 2 |
| How is it possible to insert different type of elements in
stack? | | 5 |
| Explain about the types of linked lists | | 4 |
| Convert the following infix expression to post fix notation
((a+2)*(b+4)) -1 | | 7 |
| Evaluate the following prefix expression " ++ 26 + - 1324" | Patni | 8 |
| What are the parts of root node?
| BMC | 2 |
| A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute? | | 8 |
| What is the average number of comparisons in a sequential
search? | | 2 |
| A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute? | | 4 |
| Parenthesis are never needed in prefix or postfix
expressions. Why? | | 6 |
| What is a data structure? | Keane-India-Ltd | 3 |
| What is B+ tree? | BMC | 3 |
| What do you mean by: Syntax Error, Logical Error, Runtime Error? | | 2 |
| 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 |
| sir plz. send me a bunch of questions related to this topic
which may help me in campus selection | ABC | 1 |
| What does abstract data type means? | TCS | 6 |
| What is binary tree?
| BMC | 5 |
| Explain binary searching, Fibinocci search. | IBM | 1 |
| |
| For more Data Structures Interview Questions Click Here |
Site Map
