Practice Library
All MCQs
Browse exam-wise, subject-wise, and country-wise MCQs with explanations.
Choose an option to check your answer.
A.
Quadratic Probing
B.
Trie
C.
Quick Sort
D.
Stack
Show Answer
Correct Answer: D. Stack
Explanation:
Stack fits because it supports function-call management and undo operations and push and pop occur at the same end.
Both clues point to this choice.
Choose an option to check your answer.
A.
children are commonly called left and right
B.
an edge may represent a string rather than one character
C.
push and pop occur at the same end
D.
the function is bounded above and below by constant multiples
Show Answer
Correct Answer: C. push and pop occur at the same end
Explanation:
The defining property is that push and pop occur at the same end.
The other statements describe different structures or concepts.
Choose an option to check your answer.
A.
range queries with point or range updates
B.
function-call management and undo operations
C.
algorithms with many decrease-key operations
D.
modeling one-way relationships
Show Answer
Correct Answer: B. function-call management and undo operations
Explanation:
Stack is commonly used for function-call management and undo operations.
Its design supports this task efficiently or naturally.
Choose an option to check your answer.
A.
Stack
B.
Fenwick Tree
C.
Trie
D.
Sparse Table
Show Answer
Correct Answer: A. Stack
Explanation:
Stack is a linear structure that follows Last In, First Out order.
This description distinguishes it from the other choices.
Choose an option to check your answer.
A.
Skip List
B.
Undirected Graph
C.
Merge Sort
D.
Circular Linked List
Show Answer
Correct Answer: D. Circular Linked List
Explanation:
Circular Linked List fits because it supports round-robin scheduling and traversal can continue cyclically without reaching a null link.
Both clues point to this choice.
Choose an option to check your answer.
A.
no node has exactly one child
B.
probing searches for another available slot
C.
traversal can continue cyclically without reaching a null link
D.
every level is completely filled
Show Answer
Correct Answer: C. traversal can continue cyclically without reaching a null link
Explanation:
The defining property is that traversal can continue cyclically without reaching a null link.
The other statements describe different structures or concepts.
Choose an option to check your answer.
A.
task scheduling and buffering
B.
round-robin scheduling
C.
cache-friendly hash tables
D.
dense graphs and constant-time edge-existence tests
Show Answer
Correct Answer: B. round-robin scheduling
Explanation:
Circular Linked List is commonly used for round-robin scheduling.
Its design supports this task efficiently or naturally.
Choose an option to check your answer.
A.
Circular Linked List
B.
Reference Counting
C.
Max-Heap
D.
Priority Queue
Show Answer
Correct Answer: A. Circular Linked List
Explanation:
Circular Linked List is a linked list whose last node points back to the first node.
This description distinguishes it from the other choices.
Choose an option to check your answer.
A.
Recursion Stack
B.
Adjacency Matrix
C.
Fenwick Tree
D.
Doubly Linked List
Show Answer
Correct Answer: D. Doubly Linked List
Explanation:
Doubly Linked List fits because it supports efficient insertion or deletion when a node reference is available and each node stores two links.
Both clues point to this choice.
Choose an option to check your answer.
A.
each node's balance factor is typically -1, 0, or 1
B.
higher levels allow traversal to skip many nodes
C.
each node stores two links
D.
no node has exactly one child
Show Answer
Correct Answer: C. each node stores two links
Explanation:
The defining property is that each node stores two links.
The other statements describe different structures or concepts.
Choose an option to check your answer.
A.
task scheduling and buffering
B.
efficient insertion or deletion when a node reference is available
C.
stable sorting with guaranteed O(n log n) time
D.
describing both upper and lower growth rates
Show Answer
Correct Answer: B. efficient insertion or deletion when a node reference is available
Explanation:
Doubly Linked List is commonly used for efficient insertion or deletion when a node reference is available.
Its design supports this task efficiently or naturally.
Choose an option to check your answer.
A.
Doubly Linked List
B.
Segment Tree
C.
Union by Rank
D.
Graph
Show Answer
Correct Answer: A. Doubly Linked List
Explanation:
Doubly Linked List is a sequence of nodes with links to both the next and previous nodes.
This description distinguishes it from the other choices.