Free Test B+ Trees and Other Ind... – Databas...

Q1: What is a B+ tree?

A. A balanced tree data structure used for indexing in databases B. A binary search tree C. A linear list D. A hash table

Q2: In a B+ tree, where are the actual data records stored?

A. Only at the leaf nodes B. Only at internal nodes C. At the root D. Randomly

Q3: What is the main difference between B-tree and B+ tree?

A. B+ tree stores data only at leaf nodes; B-tree stores data at all nodes B. B-tree is faster C. B+ tree has no internal nodes D. B-tree stores data only at leaf nodes

Q4: What does the order of a B+ tree represent?

A. Maximum number of children per node B. Height of the tree C. Number of leaf nodes D. Number of data records

Q5: Why are B+ trees preferred in database indexing?

A. Because they reduce disk I/O by maximizing node utilization B. Because they use hashing C. Because they are simple D. Because they store data randomly

Q6: What kind of search time complexity does B+ tree provide?

A. O(log n) B. O(n) C. O(1) D. O(n log n)

Q7: How are leaf nodes in B+ trees linked?

A. In a linked list for efficient range queries B. Randomly connected C. Not linked D. By parent nodes

Q8: What happens when a B+ tree node becomes full?

A. It splits into two nodes B. It deletes data C. It merges with siblings D. It becomes root

Q9: Which index structure is especially good for range queries?

A. B+ tree B. Hash index C. Heap file D. Sequential file

Q10: What is a prefix key in B+ trees?

A. A key used to reduce storage by sharing common prefixes B. A full key C. A hash value D. A random value

Q11: Which of these is NOT an advantage of B+ trees?

A. Poor support for point queries B. Efficient range queries C. Balanced height D. Good disk utilization

Q12: What does fan-out mean in B+ trees?

A. Number of pointers in a node B. Number of data records C. Height of tree D. Number of keys

Q13: What is the height of a B+ tree typically related to?

A. Logarithm of number of keys B. Number of leaf nodes C. Number of data blocks D. Size of root node

Q14: What kind of data structure is a B+ tree node?

A. Array of keys and pointers B. Single linked list C. Stack D. Queue

Q15: How does B+ tree handle deletions?

A. By merging or redistributing keys among nodes B. By ignoring the deletion C. By deleting the entire tree D. By converting to heap

Q16: Which index structure is faster for exact-match queries?

A. Hash index B. B+ tree C. Sequential index D. Heap index

Q17: What is the main disadvantage of B+ trees compared to hashing?

A. Slower for exact-match queries B. Consumes more memory C. Cannot handle range queries D. Not balanced

Q18: How is the root node in a B+ tree different?

A. It may have fewer children than other nodes B. It has no keys C. It is always a leaf D. It stores data records

Q19: Which of the following is a variant of B+ trees?

A. B-trees B. Binary search tree C. AVL tree D. Heap tree

Q20: What property ensures B+ trees are balanced?

A. All leaf nodes are at the same level B. Root node contains all data C. Nodes are linked D. Data is hashed

Quiz for B+ Trees and Other Index Structures