MCQ Collection
Data Structures MCQs
Practice Data Structures questions with answers and explanations.
Choose an option to check your answer.
A.
substring search and text indexing
B.
sliding-window algorithms
C.
prefix sums with updates
D.
hash tables with flexible load factors
Show Answer
Correct Answer: B. sliding-window algorithms
Explanation:
Deque is commonly used for sliding-window algorithms.
Choose an option to check your answer.
A.
recently accessed elements become quicker to access again
B.
it avoids allocating an auxiliary structure proportional to input size
C.
both front and rear operations can be efficient
D.
performance depends on how evenly items spread across buckets
Show Answer
Correct Answer: C. both front and rear operations can be efficient
Explanation:
The defining property is that both front and rear operations can be efficient.
Choose an option to check your answer.
A.
Complete Binary Tree
B.
Queue
C.
Binary Search Tree
D.
Deque
Show Answer
Correct Answer: D. Deque
Explanation:
Deque fits because it supports sliding-window algorithms and both front and rear operations can be efficient.
Choose an option to check your answer.
A.
Priority Queue
B.
B+ Tree
C.
Trie
D.
Linear Search
Show Answer
Correct Answer: A. Priority Queue
Explanation:
Priority Queue is a structure that removes elements according to priority rather than arrival time.
Choose an option to check your answer.
A.
sliding-window algorithms
B.
event simulation and shortest-path algorithms
C.
quickly rejecting items that are definitely absent
D.
ordered dictionary operations with expected logarithmic time
Show Answer
Correct Answer: B. event simulation and shortest-path algorithms
Explanation:
Priority Queue is commonly used for event simulation and shortest-path algorithms.
Choose an option to check your answer.
A.
its merge step usually needs auxiliary storage for arrays
B.
a node can store multiple keys and have multiple children
C.
the rear index can wrap to the beginning of the array
D.
edges may be directed or undirected
Show Answer
Correct Answer: C. the rear index can wrap to the beginning of the array
Explanation:
The defining property is that the rear index can wrap to the beginning of the array.
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.
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.
Choose an option to check your answer.
A.
Queue
B.
Skip List
C.
Directed Graph
D.
Memory Pool
Show Answer
Correct Answer: A. Queue
Explanation:
Queue is a linear structure that follows First In, First Out order.
Choose an option to check your answer.
A.
hash tables with flexible load factors
B.
task scheduling and buffering
C.
scheduling tasks with dependencies
D.
sliding-window algorithms
Show Answer
Correct Answer: B. task scheduling and buffering
Explanation:
Queue is commonly used for task scheduling and buffering.
Choose an option to check your answer.
A.
probing searches for another available slot
B.
traversal can continue cyclically without reaching a null link
C.
insertion occurs at the rear and removal at the front
D.
it typically uses recursion or a stack
Show Answer
Correct Answer: C. insertion occurs at the rear and removal at the front
Explanation:
The defining property is that insertion occurs at the rear and removal at the front.
Choose an option to check your answer.
A.
Suffix Array
B.
Directed Graph
C.
Priority Queue
D.
Queue
Show Answer
Correct Answer: D. Queue
Explanation:
Queue fits because it supports task scheduling and buffering and insertion occurs at the rear and removal at the front.
