Practice Library
All MCQs
Browse exam-wise, subject-wise, and country-wise MCQs with explanations.
Choose an option to check your answer.
A.
Recursion Stack
B.
B-Tree
C.
Directed Graph
D.
Binomial Heap
Show Answer
Correct Answer: D. Binomial Heap
Explanation:
Binomial Heap fits because it supports priority queues requiring efficient meld operations and there is at most one binomial tree of each degree.
Choose an option to check your answer.
A.
edges may be directed or undirected
B.
its subtrees do not become excessively skewed
C.
there is at most one binomial tree of each degree
D.
every level is completely filled
Show Answer
Correct Answer: C. there is at most one binomial tree of each degree
Explanation:
The defining property is that there is at most one binomial tree of each degree.
Choose an option to check your answer.
A.
sparse graphs
B.
priority queues requiring efficient meld operations
C.
analyzing balanced full trees
D.
implementing ordered maps and sets
Show Answer
Correct Answer: B. priority queues requiring efficient meld operations
Explanation:
Binomial Heap is commonly used for priority queues requiring efficient meld operations.
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.
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.
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.
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.
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.
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.
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.
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.
Min-Heap
B.
AVL Tree
C.
Adjacency List
D.
Merge Sort
Show Answer
Correct Answer: A. Min-Heap
Explanation:
Min-Heap is a heap in which every parent key is no greater than its children's keys.
