This section contains more frequently asked Data Structure and Algorithms Fundamentals Multiple Choice Questions Answers in the various University level and competitive examinations.
1. A binary tree whose every node has either zero or two children is called
- Complete binary tree
- Binary search tree
- Extended binary tree
- None of above
2. When converting binary tree into extended binary tree, all the original nodes in binary tree are
- internal nodes on extended tree
- external nodes on extended tree
- vanished on extended tree
- None of above
3. An algorithm that calls itself directly or indirectly is known as
- Sub algorithm
- Recursion
- Polish notation
- Traversal algorithm
4. In a Heap tree
- Values in a node is greater than every value in left sub tree and smaller than right sub tree
- Values in a node is greater than every value in children of it
- Both of above conditions applies
- None of above conditions applies
5. A connected graph T without any cycles is called
- a tree graph
- free tree
- a tree
- All of above
6. The in order traversal of tree will yield a sorted listing of elements of tree in
- Binary trees
- Binary search trees
- Heaps
- None of above
7. The application of heap tree is
- To Sort the elements in array
- To evaluate the mathematical expression
- To search the element in array
- None of these
8. The deletion mechanism in the stack is called as
- PUSH
- POP
- Delete
- None of these
9. LIFO mechanism is used in
- Stack
- Queue
- Array
- linked list
10. The element which is inserted first will be removed last in the
- Queue
- Array
- Linked list
- None of these