MCQ Collection
Data Structures MCQs
Practice Data Structures questions with answers and explanations.
Choose an option to check your answer.
A.
Fibonacci Heap
B.
Weighted Graph
C.
Binomial Heap
D.
Path Compression
Show Answer
Correct Answer: A. Fibonacci Heap
Explanation:
Fibonacci Heap is a collection of heap-ordered trees using lazy consolidation.
Choose an option to check your answer.
A.
priority queues requiring efficient meld operations
B.
algorithms with many decrease-key operations
C.
modeling networks, routes, and relationships
D.
multi-key sorting
Show Answer
Correct Answer: B. algorithms with many decrease-key operations
Explanation:
Fibonacci Heap is commonly used for algorithms with many decrease-key operations.
Choose an option to check your answer.
A.
each digit pass must use a stable subroutine in common LSD implementations
B.
the probe sequence depends on two hash functions
C.
it provides excellent amortized decrease-key performance
D.
insertion occurs at the rear and removal at the front
Show Answer
Correct Answer: C. it provides excellent amortized decrease-key performance
Explanation:
The defining property is that it provides excellent amortized decrease-key performance.
Choose an option to check your answer.
A.
cycle detection, topological reasoning, and connectivity
B.
repeatedly retrieving the smallest element
C.
event simulation and shortest-path algorithms
D.
maintaining an indexed sequence whose size changes
Show Answer
Correct Answer: B. repeatedly retrieving the smallest element
Explanation:
Min-Heap is commonly used for repeatedly retrieving the smallest element.
Choose an option to check your answer.
A.
its merge step usually needs auxiliary storage for arrays
B.
reachability analysis helps determine which objects can be reclaimed
C.
the minimum element is stored at the root
D.
nodes on the last level are as far left as possible
Show Answer
Correct Answer: C. the minimum element is stored at the root
Explanation:
The defining property is that the minimum element is stored at the root.
Choose an option to check your answer.
A.
Priority Queue
B.
Big-Theta Notation
C.
Hash Table
D.
Min-Heap
Show Answer
Correct Answer: D. Min-Heap
Explanation:
Min-Heap fits because it supports repeatedly retrieving the smallest element and the minimum element is stored at the root.
Choose an option to check your answer.
A.
Max-Heap
B.
Stable Sorting
C.
Graph
D.
AVL Tree
Show Answer
Correct Answer: A. Max-Heap
Explanation:
Max-Heap is a heap in which every parent key is no less than its children's keys.
Choose an option to check your answer.
A.
keeping union-find trees short
B.
repeatedly retrieving the largest element
C.
sliding-window algorithms
D.
reducing primary clustering compared with linear probing
Show Answer
Correct Answer: B. repeatedly retrieving the largest element
Explanation:
Max-Heap is commonly used for repeatedly retrieving the largest element.
Choose an option to check your answer.
A.
it does not naturally support frequent updates
B.
path quality can depend on the sum of weights
C.
the maximum element is stored at the root
D.
leaf nodes are commonly linked for sequential access
Show Answer
Correct Answer: C. the maximum element is stored at the root
Explanation:
The defining property is that the maximum element is stored at the root.
Choose an option to check your answer.
A.
Selection Sort
B.
Big-Omega Notation
C.
Adjacency List
D.
Max-Heap
Show Answer
Correct Answer: D. Max-Heap
Explanation:
Max-Heap fits because it supports repeatedly retrieving the largest element and the maximum element is stored at the root.
Choose an option to check your answer.
A.
Binomial Heap
B.
Big-O Notation
C.
Dynamic Array
D.
Recursion Stack
Show Answer
Correct Answer: A. Binomial Heap
Explanation:
Binomial Heap is a mergeable heap represented as a collection of binomial trees.
Choose an option to check your answer.
A.
Linear Probing
B.
Graph
C.
LRU Cache
D.
Heap
Show Answer
Correct Answer: D. Heap
Explanation:
Heap fits because it supports priority queue implementation and only the root is guaranteed to contain the global minimum or maximum.
