MCQ Collection
Data Structures MCQs
Practice Data Structures questions with answers and explanations.
Choose an option to check your answer.
A.
stable sorting with guaranteed O(n log n) time
B.
reducing allocation overhead
C.
substring search and text indexing
D.
task scheduling and buffering
Show Answer
Correct Answer: B. reducing allocation overhead
Explanation:
Memory Pool is commonly used for reducing allocation overhead.
Choose an option to check your answer.
A.
expressing a guaranteed minimum growth rate
B.
tracking return addresses and local state
C.
round-robin scheduling
D.
small or nearly sorted datasets
Show Answer
Correct Answer: B. tracking return addresses and local state
Explanation:
Recursion Stack is commonly used for tracking return addresses and local state.
Choose an option to check your answer.
A.
no node has exactly one child
B.
it typically uses a queue
C.
very deep recursion can cause stack overflow
D.
the probe gaps grow quadratically
Show Answer
Correct Answer: C. very deep recursion can cause stack overflow
Explanation:
The defining property is that very deep recursion can cause stack overflow.
Choose an option to check your answer.
A.
fast general-purpose in-memory sorting
B.
expressing a guaranteed minimum growth rate
C.
accelerating repeated disjoint-set queries
D.
substring search and text indexing
Show Answer
Correct Answer: B. expressing a guaranteed minimum growth rate
Explanation:
Big-Omega Notation is commonly used for expressing a guaranteed minimum growth rate.
Choose an option to check your answer.
A.
it exists only for directed acyclic graphs
B.
it typically uses recursion or a stack
C.
it bounds a function from below for sufficiently large inputs
D.
every level is completely filled
Show Answer
Correct Answer: C. it bounds a function from below for sufficiently large inputs
Explanation:
The defining property is that it bounds a function from below for sufficiently large inputs.
Choose an option to check your answer.
A.
B+ Tree
B.
Topological Sort
C.
Suffix Array
D.
Big-Omega Notation
Show Answer
Correct Answer: D. Big-Omega Notation
Explanation:
Big-Omega Notation fits because it supports expressing a guaranteed minimum growth rate and it bounds a function from below for sufficiently large inputs.
Choose an option to check your answer.
A.
Recursion Stack
B.
Radix Sort
C.
Undirected Graph
D.
LRU Cache
Show Answer
Correct Answer: A. Recursion Stack
Explanation:
Recursion Stack is the stack of active function-call records used during recursion.
Choose an option to check your answer.
A.
Big-Theta Notation
B.
Separate Chaining
C.
Reference Counting
D.
Singly Linked List
Show Answer
Correct Answer: A. Big-Theta Notation
Explanation:
Big-Theta Notation is an asymptotically tight bound.
Choose an option to check your answer.
A.
modeling networks, routes, and relationships
B.
describing both upper and lower growth rates
C.
immediate reclamation when the count reaches zero
D.
function-call management and undo operations
Show Answer
Correct Answer: B. describing both upper and lower growth rates
Explanation:
Big-Theta Notation is commonly used for describing both upper and lower growth rates.
Choose an option to check your answer.
A.
an edge may represent a string rather than one character
B.
poor pivot choices can produce quadratic time
C.
the function is bounded above and below by constant multiples
D.
it avoids allocating an auxiliary structure proportional to input size
Show Answer
Correct Answer: C. the function is bounded above and below by constant multiples
Explanation:
The defining property is that the function is bounded above and below by constant multiples.
Choose an option to check your answer.
A.
Bubble Sort
B.
Directed Graph
C.
Heap
D.
Big-Theta Notation
Show Answer
Correct Answer: D. Big-Theta Notation
Explanation:
Big-Theta Notation fits because it supports describing both upper and lower growth rates and the function is bounded above and below by constant multiples.
Choose an option to check your answer.
A.
Big-Omega Notation
B.
Linear Search
C.
Counting Sort
D.
Full Binary Tree
Show Answer
Correct Answer: A. Big-Omega Notation
Explanation:
Big-Omega Notation is an asymptotic lower bound on growth rate.
