B-trees and B+ trees MCQs – T4Tutorials.com

20
Score: 0
Attempted: 0/20
Subscribe

1. : What is a B-tree?
(A) A balanced search tree with multiple keys per node
(B) A binary search tree
(C) A tree with only two children per node
(D) A linear data structure

2. : What is the main purpose of B-trees?
(A) To perform in-memory sorting
(B) To provide efficient access to disk-based data
(C) To store data in a linear fashion
(D) To represent hierarchical data

3. : What property defines a B-tree?
(A) All leaf nodes are at the same level
(B) Each node has at most two children
(C) All keys are stored in the leaf nodes
(D) The tree is unbalanced

4. : In a B-tree, what is the maximum number of children a node can have?
(A) 2
(B) m (where m is the order of the tree)
(C) 3
(D) 4

5. : What is a B+ tree?
(A) A variation of a B-tree that stores data only in leaf nodes
(B) A binary search tree
(C) A tree where each internal node can store only one key
(D) A tree with only one child per node

6. : How are B-trees and B+ trees different in terms of storage?
(A) B-trees store keys in all nodes, while B+ trees store keys only in leaves
(B) B+ trees can have fewer keys than B-trees
(C) B-trees do not allow duplicate keys, while B+ trees do
(D) B+ trees are always deeper than B-trees

7. : What is the height of a B-tree with a large number of keys?
(A) Very high
(B) Constant
(C) Logarithmic
(D) Linear

8. : What happens to a B-tree when it becomes full?
(A) It cannot store any more data
(B) A new level is created
(C) It merges with a sibling
(D) It converts to a binary tree

9. : Which of the following operations is more efficient in a B+ tree compared to a B-tree?
(A) Searching
(B) Insertion
(C) Deletion
(D) None of the above

10. : What is the minimum degree of a B-tree?
(A) 1
(B) 2
(C) 3
(D) m/2, where m is the order of the tree

11. : How does a B+ tree ensure that all leaf nodes are at the same level?
(A) By balancing during insertion
(B) By allowing only one key in internal nodes
(C) By deleting excess nodes
(D) By not allowing duplicates

12. : What is a significant advantage of B+ trees over B-trees?
(A) More efficient use of disk space
(B) Faster search times due to linked leaves
(C) Simplicity in implementation
(D) Fewer nodes needed

13. : In a B-tree, how are keys organized within a node?
(A) In random order
(B) In a circular manner
(C) In sorted order
(D) In reverse order

14. : What does the “order” of a B-tree refer to?
(A) The number of keys in each node
(B) The maximum number of children each node can have
(C) The total number of nodes
(D) The height of the tree

15. : Which operation can cause a B-tree to split?
(A) Searching
(B) Inserting a key into a full node
(C) Deleting a key
(D) Balancing

16. : How is data retrieved from a B+ tree?
(A) By searching the internal nodes only
(B) By traversing leaf nodes in a linked manner
(C) By searching all nodes
(D) By using a binary search

17. : What is the maximum number of keys in a B-tree node with order m?
(A) m
(B) m – 1
(C) m + 1
(D) 2m

18. : Which type of tree is best suited for databases?
(A) Binary trees
(B) B-trees and B+ trees
(C) AVL trees
(D) Red-black trees

19. : In a B+ tree, how are the leaf nodes linked?
(A) Randomly
(B) By pointers
(C) By their parent nodes
(D) There is no linking

20. : Which operation is typically faster in a B+ tree compared to a B-tree?
(A) Insertion
(B) Deletion
(C) Searching for a range of values
(D) None of the above

Data Structures MCQs

Basic Concepts

Introduction to Data Structures
- Abstract Data Types (ADT) MCQs
Complexity Analysis MCQs

Linear Data Structures MCQs

Arrays MCQs
Linked Lists MCQs
Stacks MCQs
- Stack operations (push, pop, peek) MCQs
- Applications of stacks (expression evaluation, recursion) MCQs
Queues MCQs
- Queue operations (enqueue, dequeue, front, rear) MCQs
- Types: Simple queue, circular queue, priority queue, deque MCQs

Non-Linear Data Structures MCQs

Trees MCQs
Heaps MCQs
Graphs MCQs

Hashing MCQs MCQs

Hash Tables

Sorting and Searching Algorithms MCQs

Sorting Algorithms MCQs
Searching Algorithms MCQs

Miscellaneous

Memory Management in data structures MCQs
- Dynamic memory allocation MCQs
- Garbage collection MCQs
String Manipulation Algorithms MCQs
- Pattern matching (KMP, Rabin-Karp) MCQs
- String hashing MCQs

Data Structures MCQs 1
Data Structures MCQs 2
Data Structures MCQs 3
Data Structures MCQs 4
Data Structures MCQs 5
Stacks Solved MCQs
Queues MCQs
pointer mcqs
Array MCQs

Parse trees and derivations MCQs
Parse trees and derivations(MCQs)
Indexing (B-trees, hash indexing) MCQs in DBMS
Trees MCQs
Decision Trees MCQs Artificial Intelligence
Decision Trees MCQs

B-trees and B+ trees MCQs
By: Prof. Dr. Fazal Rehman | Last updated: May 15, 2025

Related Posts: