MCQs

Disclaimer:

Educational Use Only:

The website links provided are to be used strictly for educational and knowledge-gaining purposes only.

No Misuse:

Do not misuse the links or the information contained therein for any commercial, illegal, or unethical activities.

Respect for Websites and Businesses:

Respect the intellectual property and business interests of the websites and their owners. Do not attempt to alter, copy, or redistribute content without proper authorization.

Acknowledge Value of Knowledge:

Recognize and value the knowledge and resources shared by these websites. Use the information responsibly and ethically.

No Endorsement:

The provision of these links does not imply endorsement of the linked sites, their content, or their products and services. Users are responsible for evaluating the suitability and accuracy of the information.

User Responsibility:

By accessing these links, you agree to use the information at your own risk and to comply with all applicable laws and website terms of use.

Overall MCQs for Reference

In a B+ tree, where are all actual data values stored?
a. Internal nodes
b. Leaf nodes
c. Root node
d. Parent nodes
Answer: b. Leaf nodesgeeksforgeeks+1
What is a unique property of the leaf nodes in a B+ tree?
a. They are not linked
b. They are linked in a sequential list
c. They store only keys
d. They store pointers to internal nodes
Answer: b. They are linked in a sequential listtutorialspoint+1
In a B+ tree of order , what is the maximum number of children a non-leaf node can have?
a.
b.
c.
d.
Answer: c. geeksforgeeks+1
Which one of the following is an advantage of B+ trees in databases?
a. Lower disk access time
b. Random node distribution
c. Only leaf nodes are balanced
d. Unordered keys
Answer: a. Lower disk access timegeeksforgeeks+1
B+ trees are largely preferred in databases over binary search trees because:
a. Faster disk data transfer rates
b. They require less disk space
c. Disk access is much slower than memory access
d. B+ trees are easier to implement
Answer: c. Disk access is much slower than memory accessgeeksforgeeks
In a B+ tree of order 3, what is the maximum number of keys in a leaf node?
a. 2
b. 3
c. 4
d. 5
Answer: a. 2sanfoundry+1
Which statement about B+ tree properties is FALSE?
a. B+ tree grows downwards
b. B+ tree is balanced
c. Sibling pointers in leaves allow sequential searching
d. B+ tree is shallower than B-tree
Answer: a. B+ tree grows downwardssanfoundry
What happens when a non-root node in a B+ tree becomes less than half full?
a. Node merges or redistributes
b. Node is removed
c. Tree is reconstructed
d. Node is locked
Answer: a. Node merges or redistributesedurev+1
What is true about B+ trees and sorted data?
a. Only internal nodes are sorted
b. Only leaves store sorted data
c. All leaf nodes are sorted
d. Sorting is not guaranteed
Answer: c. All leaf nodes are sortedtutorialspoint+1
What data structure underlies the index in a B+ tree?
a. Array
b. Heap
c. Multilevel clustered indices
d. Binary tree
Answer: c. Multilevel clustered indicesmcqslearn
Which level in the B+ tree contains the actual record pointers?
a. Root
b. Internal nodes
c. Leaf nodes
d. Parent nodes
Answer: c. Leaf nodesgeeksforgeeks+1
The primary use for B+ trees is:
a. Sorting data only
b. Implementing priority queues
c. Indexing and fast retrieval in databases
d. Compressing data
Answer: c. Indexing and fast retrieval in databasestestbook+2
In a B+ tree, how is range search efficiency improved?
a. Using a hash map
b. Linked leaf nodes
c. Internal node caching
d. Binary search
Answer: b. Linked leaf nodestutorialspoint+1
What is the worst-case time complexity of search in a B+ tree with keys?
a.
b.
c.
d.
Answer: b. wikipedia+1
The order of a B+ tree refers to:
a. The height of the tree
b. The number of keys in each node
c. The maximum number of children per node
d. The number of leaf nodes
Answer: c. The maximum number of children per nodewikipedia+2
To keep a B+ tree balanced, all leaf nodes:
a. Must be at the same level
b. Must contain the same keys
c. Must point to the root node
d. Are unbalanced
Answer: a. Must be at the same levelwikipedia+2
When a B+ tree node splits, the middle key is:
a. Deleted
b. Retained only in left node
c. Promoted to parent and retained in right node
d. Ignored
Answer: c. Promoted to parent and retained in right nodescribd+1
What is the typical fan-out in a B+ tree used for databases?
a. 2
b. 4
c. High (hundreds or thousands)
d. 1
Answer: c. High (hundreds or thousands)geeksforgeeks+1
In B+ trees, which nodes contain duplicate copies of keys?
a. Internal nodes
b. Leaf nodes
c. Root nodes
d. None
Answer: a. Internal nodessanfoundry+2
Which of the following is a key difference between B-tree and B+ tree?
a. B-tree stores data only in leaves
b. B+ tree stores all data in leaves
c. B-tree is used for indexing
d. B+ tree is always unbalanced
Answer: b. B+ tree stores all data in leavestutorialspoint+1
What happens during insertion when a leaf node overflows in a B+ tree?
a. Node is deleted
b. Node splits
c. Root is reset
d. Tree is rebalanced without splitting
Answer: b. Node splitsscribd+2
When all nodes except leaves are full, what is the height of a B+ tree with keys and order ?
a.
b.
c.
d.
Answer: a. wikipedia+2
Internal nodes in B+ trees contain:
a. Only keys
b. Data records
c. Both keys and data
d. Hash values
Answer: a. Only keysgeeksforgeeks+1
How are the leaf nodes of a B+ tree connected?
a. Directly to the root
b. In a doubly-linked list
c. In a singly-linked list
d. By parent pointers only
Answer: c. In a singly-linked listtutorialspoint+1
What is one major benefit of B+ trees over hash indexing?
a. Efficient range queries
b. Constant time updates
c. Smaller memory size
d. Unordered storage
Answer: a. Efficient range querieswikipedia+1
The smallest allowed number of children a non-root node can have in a B+ tree of order is:
a.
b.
c. 1
d.
Answer: a. sanfoundry+1
In a B+ tree of order 5, what is the minimum number of keys in a non-root node?
a. 1
b. 2
c. 3
d. 4
Answer: b. 2geeksforgeeks+1
If the B+ tree order is 7, the minimum number of keys in a leaf node is:
a. 2
b. 3
c. 4
d. 6
Answer: b. 3sanfoundry+1
Which B+ tree operation can cause the tree’s height to increase?
a. Deletion at root
b. Node splitting after insertion
c. Key lookup
d. Node balancing
Answer: b. Node splitting after insertionscribd+1
The height of a B+ tree affects:
a. Only sequential access time
b. Both search and update time
c. Only insertion operations
d. None
Answer: b. Both search and update timegeeksforgeeks+2
What is promoted during a split in a B+ tree?
a. The minimum value
b. The largest value
c. The middle key
d. The smallest key
Answer: c. The middle keyscribd+1
B+ trees support which types of data retrieval efficiently?
a. Only point queries
b. Only range queries
c. Both point and range queries
d. Only hash queries
Answer: c. Both point and range querieswikipedia+2
What is maintained at each level of the B+ tree except the leaf level?
a. Data pointers
b. Sorted keys
c. Linked lists
d. Only leaf data
Answer: b. Sorted keystutorialspoint+1
How does B+ tree indexing improve database performance?
a. By increasing memory usage
b. By lowering disk access and providing faster search
c. By duplicating all data
d. By removing duplicate keys
Answer: b. By lowering disk access and providing faster searchmytectra+2
In B+ trees, root splitting causes:
a. Height reduction
b. Height increase
c. Data loss
d. Loss of keys
Answer: b. Height increaseedurev+1
Which operation in B+ trees often requires merging nodes?
a. Insertion
b. Deletion
c. Sequential access
d. Redistribution
Answer: b. Deletionedurev+1
What structure do the leaf nodes of a B+ tree form?
a. Circular array
b. Linked list
c. Tree
d. Stack
Answer: b. Linked listgeeksforgeeks+2
B+ trees assure what about search path length?
a. Variable path length
b. Same length for all keys
c. Longest search time
d. Minimal disk access
Answer: b. Same length for all keystutorialspoint+1
Reason for B+ tree’s popularity in DBMS:
a. Random data insertion
b. Sequential and range query efficiency
c. No support for search
d. Tree is always unbalanced
Answer: b. Sequential and range query efficiencywikipedia+1
What must be true for B+ tree root node if it’s not a leaf?
a. At least two children
b. At least one key
c. No children
d. Only leaves as children
Answer: a. At least two childrensanfoundry+1
What does high fan-out in B+ tree nodes provide?
a. Deeper trees
b. Shallower trees
c. More leaf nodes
d. More root nodes
Answer: b. Shallower treesgeeksforgeeks+1
Which of the following does a B+ tree NOT support efficiently?
a. Point queries
b. Range queries
c. Random deletions
d. Hashing operations
Answer: d. Hashing operationswikipedia+1
For which scenario is a B+ tree most suitable?
a. Dynamic in-memory data
b. Persistent large-scale disk data
c. Simple arrays
d. Quicksort implementation
Answer: b. Persistent large-scale disk datatestbook+2
What is the relationship between B+ tree order and disk block size in databases?
a. No relation
b. Order is chosen to match disk block size for efficiency
c. Order is always fixed
d. Order must be prime
Answer: b. Order is chosen to match disk block size for efficiencytestbook+1
What does a B+ tree leaf node contain?
a. Pointers only
b. Keys only
c. Keys and data pointers
d. No data
Answer: c. Keys and data pointerstestbook+2
Which statement about non-leaf nodes in a B+ tree is correct?
a. Store only data
b. Store only keys
c. Store data and keys
d. Store no information
Answer: b. Store only keystutorialspoint+1
What distinguishes a B+ tree from a binary search tree for search time efficiency?
a. B+ trees have longer search paths
b. B+ trees are always binary
c. B+ trees have higher node branching, reducing tree height
d. No difference
Answer: c. B+ trees have higher node branching, reducing tree heighttestbook+2
Range queries are supported in B+ trees due to:
a. Keys in root
b. Sequentially linked leaves
c. No balancing
d. All internal nodes are leaves
Answer: b. Sequentially linked leavesgeeksforgeeks+1
What is a common application of B+ trees in machine learning data pipelines?
a. Maintaining sorted lookup indices for fast batch retrievals
b. Only used for model training
c. Sorting neural network weights
d. GPU memory management
Answer: a. Maintaining sorted lookup indices for fast batch retrievalswscubetech+1
Which of the following is a correct statement about B+ trees?
a. Height does not change with insertion
b. B+ tree loses balancing when deleting
c. B+ tree maintains balanced structure during updates
d. Data stored only in internal nodes
Answer: c. B+ tree maintains balanced structure during updatestestbook+2

Blog

Systemethic Technologies

Leave a Reply Cancel reply

Useful links

Other Terms & Policies

Contact Info