Practice Library
All MCQs
Browse exam-wise, subject-wise, and country-wise MCQs with explanations.
Choose an option to check your answer.
A.
Linear Search
B.
Memory Pool
C.
Radix Sort
D.
B+ Tree
Show Answer
Correct Answer: D. B+ Tree
Explanation:
B+ Tree fits because it supports database range queries and leaf nodes are commonly linked for sequential access.
Choose an option to check your answer.
A.
edges may be directed or undirected
B.
its merge step usually needs auxiliary storage for arrays
C.
leaf nodes are commonly linked for sequential access
D.
path quality can depend on the sum of weights
Show Answer
Correct Answer: C. leaf nodes are commonly linked for sequential access
Explanation:
The defining property is that leaf nodes are commonly linked for sequential access.
Choose an option to check your answer.
A.
ordered dictionary operations with expected logarithmic time
B.
database range queries
C.
fast random access when the index is known
D.
quickly rejecting items that are definitely absent
Show Answer
Correct Answer: B. database range queries
Explanation:
B+ Tree is commonly used for database range queries.
Choose an option to check your answer.
A.
B+ Tree
B.
Suffix Array
C.
Circular Queue
D.
Radix Tree
Show Answer
Correct Answer: A. B+ Tree
Explanation:
B+ Tree is a balanced multiway index tree that stores records or record pointers at leaf level.
Choose an option to check your answer.
A.
Radix Sort
B.
Counting Sort
C.
Hash Table
D.
B-Tree
Show Answer
Correct Answer: D. B-Tree
Explanation:
B-Tree fits because it supports database and file-system indexes and a node can store multiple keys and have multiple children.
Choose an option to check your answer.
A.
it can suffer from primary clustering
B.
an edge may represent a string rather than one character
C.
a node can store multiple keys and have multiple children
D.
it can support pattern search in time proportional to the pattern length
Show Answer
Correct Answer: C. a node can store multiple keys and have multiple children
Explanation:
The defining property is that a node can store multiple keys and have multiple children.
Choose an option to check your answer.
A.
expressing a guaranteed minimum growth rate
B.
database and file-system indexes
C.
maintaining an indexed sequence whose size changes
D.
reasoning about strictly binary branching structures
Show Answer
Correct Answer: B. database and file-system indexes
Explanation:
B-Tree is commonly used for database and file-system indexes.
Choose an option to check your answer.
A.
B-Tree
B.
Recursion Stack
C.
Complete Binary Tree
D.
Queue
Show Answer
Correct Answer: A. B-Tree
Explanation:
B-Tree is a balanced multiway search tree designed for block storage.
Choose an option to check your answer.
A.
Quadratic Probing
B.
Priority Queue
C.
Selection Sort
D.
Splay Tree
Show Answer
Correct Answer: D. Splay Tree
Explanation:
Splay Tree fits because it supports workloads with strong locality of reference and recently accessed elements become quicker to access again.
Choose an option to check your answer.
A.
the minimum element is stored at the root
B.
each edge connects two vertices bidirectionally
C.
recently accessed elements become quicker to access again
D.
poor pivot choices can produce quadratic time
Show Answer
Correct Answer: C. recently accessed elements become quicker to access again
Explanation:
The defining property is that recently accessed elements become quicker to access again.
Choose an option to check your answer.
A.
small or nearly sorted datasets
B.
workloads with strong locality of reference
C.
implementing ordered maps and sets
D.
small or unsorted collections
Show Answer
Correct Answer: B. workloads with strong locality of reference
Explanation:
Splay Tree is commonly used for workloads with strong locality of reference.
Choose an option to check your answer.
A.
Splay Tree
B.
Quadratic Probing
C.
Max-Heap
D.
Big-Theta Notation
Show Answer
Correct Answer: A. Splay Tree
Explanation:
Splay Tree is a self-adjusting binary search tree that moves accessed nodes toward the root.
