B- and B+ Tree Quiz Online Practice Test

1. Which data structure is most commonly used for managing external memory?

AVL Tree

B-Tree

Red-Black Tree

Both AVL and Red-Black Trees

2. In a B-tree of order (n), each non-root node holds __________ keys.

Up to (n - 1)/2

Exactly (n – 1)/2

At least ( 2n )

At least (n - 1)/2

3. A B-tree of order 4 and height 3 can contain up to _______ keys.

255

127

188

4. If five node splitting operations occur when an entry is inserted into a B-tree, the number of nodes written is:

5. Do B-trees and AVL trees have the same worst-case time complexity for insertion and deletion?

Yes, they have the same worst-case time complexity for both operations.

No, B-trees have better worst-case time complexity for insertion and deletion.

No, AVL trees have better worst-case time complexity for insertion and deletion.

It depends on the specific implementation and usage scenario

6. Which type of tree is isometric to 2-3-4 trees, which are B-trees of order 4?

AVL trees

AA trees

2-3 trees

Red-Black trees

7. For a B-tree of order ( n ) with ( k ) keys, what is the best-case height?

logn (k+1) - 1

n_k

log_k (n+1) - 1

klog_n

8. Which statement accurately describes the behavior of splits in a B-tree based on its order?

Higher the B-tree order, less frequent the splits

Higher the B-tree order, more frequent the splits

Lower the B-tree order, more frequent the splits

Lower the B-tree order, less frequent the splits

9. Which statement best describes the access capabilities of a B+ tree?

B+ tree supports only fast random access

B+ tree supports only fast sequential access

B+ tree supports both fast random and sequential access

B+ tree supports fast random access but slower sequential access

10. If a B+ tree node can have up to 7 pointers, what is the minimum number of keys that must be present in the leaf nodes?

11. Which of the following statements is incorrect?

A B+ tree expands downward

A B+ tree maintains balance

Sibling pointers in a B+ tree facilitate sequential searches

A B+ tree is deeper than a B-tree

12. How efficient is locating the next record in a B+ tree?

O(n)

O(log n)

O(n log n)

O(1)

13. For a B+ tree of order 3 with height 3, what is the maximum number of keys it can contain?

14. Which data structure is commonly preferred for database system implementations?

AVL tree

B-tree

B+ tree

Splay tree

Test Name:	B- and B+ Tree Quiz
Subject Category:	Computer Science
Test Type:	Multiple Choice Questions
Total Score / Questions:	14 / 14
Time Allowed:	10 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

B- and B+ Tree MCQ Quiz Online Practice Test