MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 20 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which one of the following data structures are preferred in database-system implementation? |
| A. | AVL tree |
| B. | B-tree |
| C. | B+ -tree |
| D. | Splay tree |
| Answer» D. Splay tree | |
| 2. |
Which of the following is not true about the 2-3 tree? |
| A. | all leaves are at the same level |
| B. | it is perfectly balanced |
| C. | postorder traversal yields elements in sorted order |
| D. | it is B-tree of order 3 |
| Answer» D. it is B-tree of order 3 | |
| 3. |
A B-tree of order 4 and of height 3 will have a maximum of _______ keys. |
| A. | 255 |
| B. | 63 |
| C. | 127 |
| D. | 188 |
| Answer» B. 63 | |
| 4. |
B-tree of order n is a order-n multiway tree in which each non-root node contains __________ |
| A. | at most (n – 1)/2 keys |
| B. | exact (n – 1)/2 keys |
| C. | at least 2n keys |
| D. | at least (n – 1)/2 keys |
| Answer» E. | |
| 5. |
Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written? |
| A. | 14 |
| B. | 7 |
| C. | 11 |
| D. | 5 |
| Answer» D. 5 | |
| 6. |
Which of the following data structure can provide efficient searching of the elements? |
| A. | unordered lists |
| B. | binary search tree |
| C. | treap |
| D. | 2-3 tree |
| Answer» E. | |
| 7. |
What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have? |
| A. | 3 |
| B. | 80 |
| C. | 27 |
| D. | 26 |
| Answer» E. | |
| 8. |
What is the best case height of a B-tree of order n and which has k keys? |
| A. | logn (k+1) – 1 |
| B. | nk |
| C. | logk (n+1) – 1 |
| D. | klogn |
| Answer» B. nk | |
| 9. |
In a B+ tree, both the internal nodes and the leaves have keys. |
| A. | True |
| B. | False |
| Answer» C. | |
| 10. |
AVL trees provide better insertion the 2-3 trees. |
| A. | True |
| B. | False |
| Answer» C. | |
| 11. |
Compression techniques can be used on the keys to reduce both space and time requirements in a B-tree. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 12. |
Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node.Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree. |
| A. | Statement 1 is true but statement 2 is false |
| B. | Statement 2 is true but statement 1 is false |
| C. | Both the statements are true |
| D. | Both the statements are false |
| Answer» B. Statement 2 is true but statement 1 is false | |
| 13. |
The height of 2-3 tree with n elements is ______ |
| A. | between (n/2) and (n/3) |
| B. | (n/6) |
| C. | between (n) and log2(n + 1) |
| D. | between log3(n + 1) and log2(n + 1) |
| Answer» E. | |
| 14. |
Which of the following is the most widely used external memory data structure? |
| A. | AVL tree |
| B. | B-tree |
| C. | Red-black tree |
| D. | Both AVL tree and Red-black tree |
| Answer» C. Red-black tree | |
| 15. |
Which of the following the BST is isometric with the 2-3 tree? |
| A. | Splay tree |
| B. | AA tree |
| C. | Heap |
| D. | Red – Black tree |
| Answer» C. Heap | |
| 16. |
B-tree and AVL tree have the same worst case time complexity for insertion and deletion. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 17. |
A B+ tree can contain a maximum of 7 pointers in a node. What is the minimum number of keys in leaves? |
| A. | 6 |
| B. | 3 |
| C. | 4 |
| D. | 7 |
| Answer» C. 4 | |
| 18. |
2-3 tree is a specific form of _________ |
| A. | B – tree |
| B. | B+ – tree |
| C. | AVL tree |
| D. | Heap |
| Answer» B. B+ – tree | |
| 19. |
Efficiency of finding the next record in B+ tree is ____ |
| A. | O(n) |
| B. | O(log n) |
| C. | O(nlog n) |
| D. | O(1) |
| Answer» E. | |
| 20. |
2-3-4 trees are B-trees of order 4. They are an isometric of _____ trees. |
| A. | AVL |
| B. | AA |
| C. | 2-3 |
| D. | Red-Black |
| Answer» E. | |