# B Tree MCQs

Q1. 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.

Q2. B-tree and AVL tree have the same worst case time complexity for insertion and deletion..

A. TRUE.

B. FALSE.

C.  Nothing can be said.

D.  None of the mentioned.

Q3. 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.

Q4. Compression techniques can be used on the keys to reduce both space and time requirements in a B-tree..

A. TRUE.

B. FALSE.

C.  Nothing can be said.

D.  None of the mentioned.

Q5. Which of the following is true?.

A. larger the order of B-tree, less frequently the split occurs.

B. larger the order of B-tree, more frequently the split occurs.

C. smaller the order of B-tree, more frequently the split occurs.

D. smaller the order of B-tree, less frequently the split occurs.

Answer= larger the order of B-tree, less frequently the split occurs

Q6. In a B+ tree, both the internal nodes and the leaves have keys..

A. TRUE.

B. FALSE.

C.  Nothing can be said.

D.  None of the mentioned.

Q7. Which of the following is true?.

A. B + tree allows only the rapid random access.

B. B + tree allows only the rapid sequential access.

C. B + tree allows rapid random access as well as rapid sequential access.

D. B + tree allows rapid random access and slower sequential access.

Answer= B + tree allows rapid random access as well as rapid sequential access

Q8. 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.

Q9. Which of the following is false?.

A. A B+ -tree grows downwards.

B. A B+ -tree is balanced.

C. In a B+ -tree, the sibling pointers allow sequential searching.

D. B+ -tree is shallower than B-tree.

Answer= A B+ -tree grows downwards

Q10. 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= Statement 1 is true but statement 2 is false

Q11. Efficiency of finding the next record in B+ tree is ____.

A. O(n).

B. O(log n).

C. O(nlog n).

D. O(1).

Q12. 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.

Q13. Which of the following is false?.

A. Compared to B-tree, B+ -tree has larger fanout.

B. Deletion in B-tree is more complicated than in B+ -tree.

C. B+ -tree has greater depth than corresponding B-tree.

D. Both B-tree and B+ -tree have same search and insertion efficiencies.

Answer= B+ -tree has greater depth than corresponding B-tree

Q14. 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.

Q15. 2-3 tree is a specific form of _________.

A. B - tree.

B. B+ - tree.

C. AVL tree.

D. Heap.

Q16. 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= between log3(n + 1) and log2(n + 1)

Q17. 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.

Q18. 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.

Q19. LLRB maintains 1-1 correspondence with 2-3 trees..

A. TRUE.

B. FALSE.

C.  Nothing Can be said.

D.  None of the mentioned.

Q20. 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= postorder traversal yields elements in sorted order

Q21. AVL trees provide better insertion the 2-3 trees..

A. TRUE.

B. FALSE.

C.  Nothing can be said.

D.  None of the mentioned.

Q22. Which of the following is false?.

A. 2-3 tree requires less storage than the BST.

B. lookup in 2-3 tree is more efficient than in BST.

C. 2-3 tree is shallower than BST.

D. 2-3 tree is a balanced tree.

Answer= 2-3 tree requires less storage than the BST

Q23. How many child nodes does each node of Ternary Tree contain?.

A. 4.

B. 6.

C. 5.

D. 3.

Q24. Which of the following is the name of the node having child nodes?.

A. Brother.

B. Sister.

C. Mother.

D. Parent.