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

What is a primary advantage of B-trees in large database storage?
a. Faster CPU computation
b. Efficient external storage searches
c. Improved encryption
d. Reduced RAM usage
Answer: b. Efficient external storage searcheswikipedia+2
In a B-tree of order n, the maximum number of children a node can have is:
a. n
b. n-1
c. n+1
d. 2n
Answer: a. nsanfoundry+2
Which property is guaranteed by a B-tree?
a. All leaves are at same depth
b. Every root has only one child
c. All internal nodes are empty
d. Every leaf node is full
Answer: a. All leaves are at same depthgeeksforgeeks+2
B-trees are best suited for:
a. Binary calculation
b. Small dataset storage
c. Disk-based or external storage indexing
d. Random number generation
Answer: c. Disk-based or external storage indexingalmabetter+2
The time complexity for searching in a B-tree of n keys is:
a. O(n)
b. O(log n)
c. O(n log n)
d. O(1)
Answer: b. O(log n)wscubetech+2
Each node in a B-tree (except root) has at least how many children (if order is m)?
a. m
b. m/2
c. ceil(m/2)
d. 1
Answer: c. ceil(m/2)sanfoundry+2
What happens when a node in a B-tree exceeds its limit of keys?
a. The node is removed
b. The tree is abandoned
c. The node is split
d. The entire tree is reorganized
Answer: c. The node is splitwikipedia+2
B-trees are self-balancing because:
a. Insertions and deletions always rebalance the tree
b. Keys always replace root
c. New leaves are always attached to root
d. No balance mechanism is needed
Answer: a. Insertions and deletions always rebalance the treegeeksforgeeks+2
In B-trees, leaf nodes appear at:
a. Varying levels
b. Top only
c. The same level
d. Random positions
Answer: c. The same levelgeeksforgeeks+2
The most significant application of B-trees is in:
a. Graph algorithms
b. Database and file system indexing
c. CPU scheduling
d. Encryption
Answer: b. Database and file system indexingwscubetech+2
Which of these is NOT a benefit of B-trees?
a. O(log n) access
b. Self-balance
c. Efficient disk access
d. Inefficient for large records
Answer: d. Inefficient for large recordsgeeksforgeeks
For a B-tree of order 4, what is the minimum number of keys in a non-root node?
a. 1
b. 2
c. 3
d. 4
Answer: b. 2geeksforgeeks+1
Which operation in B-trees can cause a merge?
a. Deletion
b. Insertion
c. Search
d. Traversal
Answer: a. Deletionwikipedia+1
What is the worst-case space complexity of a B-tree?
a. O(log n)
b. O(n)
c. O(1)
d. O(n log n)
Answer: b. O(n)wikipedia
Which machine learning scenario benefits most from B-tree indexes?
a. Training linear regression
b. Fast retrieval in massive datasets
c. Feature normalization
d. Data encoding
Answer: b. Fast retrieval in massive datasetsalmabetter+2
A non-root node in a B-tree of order n contains a maximum of:
a. n
b. n-1
c. n+1
d. n/2
Answer: b. n-1sanfoundry+1
Main difference between B-tree and binary search tree is:
a. B-tree is always sorted
b. B-tree supports multiple children per node
c. Binary trees always have more keys
d. Both have the same number of children
Answer: b. B-tree supports multiple children per nodebyjus+1
B-tree is considered a ______ tree.
a. Self-balancing
b. Random
c. Linked list
d. Hash
Answer: a. Self-balancingbyjus+2
Which structure do most modern file systems use for indexing?
a. AVL tree
b. Binary search tree
c. B-tree/B+ tree
d. Heap tree
Answer: c. B-tree/B+ treewscubetech+2
In a B-tree of height h and minimum degree t, the minimum number of keys is:
a. t^h
b. 2^h
c. 1
d. t^(h)-1
Answer: d. t^(h)-1wikipedia
Deletion in a B-tree might require:
a. Node split
b. Root cloning
c. Node merge or redistribution
d. Adding children
Answer: c. Node merge or redistributiongeeksforgeeks+2
What is stored in B-tree internal nodes?
a. Only values
b. Only keys
c. Keys and child pointers
d. Only child pointers
Answer: c. Keys and child pointerspingcap+1
What is the minimum degree t in a B-tree?
a. Max children per node
b. Minimum children per non-root node
c. Maximum keys in root
d. Minimum height of tree
Answer: b. Minimum children per non-root nodewscubetech+1
In a B-tree insertion, if a child becomes full:
a. The node is split and promoted
b. All nodes are deleted
c. Existing values are replaced
d. The operation fails
Answer: a. The node is split and promotedgeeksforgeeks+2
The root of a non-empty B-tree must have at least:
a. One child
b. Two children
c. Three children
d. t children
Answer: a. One childwikipedia
For best performance, B-tree nodes are:
a. Stored on separate files
b. Optimized to fit block size
c. Always in RAM
d. Linked lists
Answer: b. Optimized to fit block sizewscubetech+2
Which B-tree property is essential for efficient secondary storage?
a. Variable depth
b. Huge number of keys per node
c. Shallow, broad structure
d. Many duplicate keys
Answer: c. Shallow, broad structuregeeksforgeeks+2
When inserted, if root node overflows:
a. Ignore overflow
b. New intermediate root is created
c. All values are rehashed
d. All values are deleted
Answer: b. New intermediate root is createdwscubetech+2
B-tree is a generalization of:
a. AVL tree
b. Binary search tree
c. Heaps
d. Red-black tree
Answer: b. Binary search treewikipedia+1
Why is B-tree preferred over binary search tree for databases?
a. Fewer I/O operations
b. Simpler logic
c. Higher disk usage
d. Only for sorting
Answer: a. Fewer I/O operationsalmabetter+2
What is the purpose of the minimum degree (t) in B-trees?
a. Sets max keys
b. Sets min number of children
c. Limits tree height
d. Sets max number of leaf nodes
Answer: b. Sets min number of childrenwscubetech+1
B-tree search operation works by:
a. Linear traversal
b. Comparing key ranges recursively down the tree
c. Evaluating all nodes in parallel
d. Using hash tables
Answer: b. Comparing key ranges recursively down the treepingcap+1
Which operation is hardest to implement efficiently in B-trees?
a. Search
b. Insertion
c. Deletion
d. Traversal
Answer: c. Deletiongeeksforgeeks+2
For n keys in a B-tree of order p, maximum tree height is:
a. log_p n
b. log_p-1 n
c. log_(p/2) (n+1)
d. n/p
Answer: c. log_(p/2) (n+1)testbook
Which pointer in B-tree children points to subtree with keys less than the parent?
a. Leftmost
b. Rightmost
c. Middle
d. Any random pointer
Answer: a. Leftmostpingcap+1
What distinguishes B-tree from B+ tree?
a. B-tree stores values at all nodes
b. B+ tree only at leaves
c. Both a and b
d. B-trees always have only two children
Answer: c. Both a and bsanfoundry+1
B-trees are particularly poor for:
a. Random access in huge data
b. Indexing small datasets
c. Sorted sequence traversal
d. Large scale concurrent access
Answer: b. Indexing small datasetsgeeksforgeeks+1
How are keys organized in a B-tree node?
a. Randomly
b. Sorted order
c. Grouped by parity
d. Alternating even and odd
Answer: b. Sorted orderpingcap+1
What is the worst-case number of node splits during the insertion of m keys in B-tree?
a. O(1)
b. O(log m)
c. O(m)
d. O(m log m)
Answer: b. O(log m)wikipedia+1
Which data structure is fundamental to DBMS indexing?
a. Skip list
b. Heap
c. B-tree
d. Array
Answer: c. B-treewscubetech+2
In B-tree, splitting occurs during:
a. Insertion
b. Deletion
c. Occasionally in both insertion and deletion
d. Never
Answer: a. Insertionwikipedia+2
B-trees and their variants (e.g., B+ trees) provide:
a. Efficient point and range queries
b. Only point queries
c. Only range queries
d. Inefficient search operations
Answer: a. Efficient point and range queriesgeeksforgeeks+2
Main memory optimization with B-tree occurs due to:
a. Height reduction
b. Random child access
c. Hashing
d. Unsorted key storage
Answer: a. Height reductionpingcap+2
Typical B-tree order used for disks is:
a. 2
b. 50-200
c. 10
d. Any prime number
Answer: b. 50-200geeksforgeeks+1
Which statement about B-tree balancing is TRUE?
a. Manual rebalancing needed
b. Self-balancing after insertion/deletion
c. Needs periodic tree rebuilds
d. Only balanced at creation
Answer: b. Self-balancing after insertion/deletionwscubetech+2
What is NOT a typical B-tree application?
a. Databases
b. File Systems
c. Image Rendering
d. Indexes
Answer: c. Image Renderingalmabetter+2
In B-tree insertions, if the root splits, what happens?
a. Depth increases by one
b. Keys get deleted
c. The only child is replaced
d. New root is always a leaf
Answer: a. Depth increases by onewikipedia+2
B-tree is a _____ structure for fast data retrieval.
a. Sequential
b. Hierarchical
c. Linear
d. Circular
Answer: b. Hierarchicalpingcap+1
Key advantage of B-tree over Hash table in databases:
a. Hash tables are faster
b. B-trees support range queries
c. B-trees don’t use blocks
d. Hash tables never used in storage
Answer: b. B-trees support range queriesalmabetter+2
In a B-tree, if the total number of records is N, and block size is B, what is the approximate number of block accesses for search?
a. O(N)
b. O(B)
c. O(log_B N)
d. O(1)
Answer: c. O(log_B N)geeksforgeeks+2

Blog

Systemethic Technologies

Leave a Reply Cancel reply

Useful links

Other Terms & Policies

Contact Info