MCQ Collection
Data Structures MCQs
Practice Data Structures questions with answers and explanations.
Choose an option to check your answer.
A.
tracking return addresses and local state
B.
analyzing balanced full trees
C.
memory-efficient prefix indexing
D.
modeling networks, routes, and relationships
Show Answer
Correct Answer: B. analyzing balanced full trees
Explanation:
Perfect Binary Tree is commonly used for analyzing balanced full trees.
Choose an option to check your answer.
A.
constant factors and lower-order terms are ignored asymptotically
B.
it may examine every element
C.
every level is completely filled
D.
collisions must be handled when keys map to the same position
Show Answer
Correct Answer: C. every level is completely filled
Explanation:
The defining property is that every level is completely filled.
Choose an option to check your answer.
A.
Big-Omega Notation
B.
Binomial Heap
C.
Breadth-First Search
D.
Perfect Binary Tree
Show Answer
Correct Answer: D. Perfect Binary Tree
Explanation:
Perfect Binary Tree fits because it supports analyzing balanced full trees and every level is completely filled.
Choose an option to check your answer.
A.
Balanced Binary Tree
B.
Suffix Array
C.
Sparse Table
D.
Selection Sort
Show Answer
Correct Answer: A. Balanced Binary Tree
Explanation:
Balanced Binary Tree is a binary tree whose height remains proportional to the logarithm of its number of nodes.
Choose an option to check your answer.
A.
explaining occasional expensive dynamic-array operations
B.
keeping tree operations efficient
C.
small or nearly sorted datasets
D.
search-intensive applications requiring predictable logarithmic height
Show Answer
Correct Answer: B. keeping tree operations efficient
Explanation:
Balanced Binary Tree is commonly used for keeping tree operations efficient.
Choose an option to check your answer.
A.
the probe gaps grow quadratically
B.
each bucket commonly references a list or another secondary structure
C.
its subtrees do not become excessively skewed
D.
both front and rear operations can be efficient
Show Answer
Correct Answer: C. its subtrees do not become excessively skewed
Explanation:
The defining property is that its subtrees do not become excessively skewed.
Choose an option to check your answer.
A.
Path Compression
B.
Singly Linked List
C.
Recursion Stack
D.
Balanced Binary Tree
Show Answer
Correct Answer: D. Balanced Binary Tree
Explanation:
Balanced Binary Tree fits because it supports keeping tree operations efficient and its subtrees do not become excessively skewed.
Choose an option to check your answer.
A.
Binary Search Tree
B.
Open Addressing
C.
Separate Chaining
D.
Array
Show Answer
Correct Answer: A. Binary Search Tree
Explanation:
Binary Search Tree is a binary tree where left-subtree keys are smaller and right-subtree keys are larger under a chosen ordering.
Choose an option to check your answer.
A.
Big-O Notation
B.
Array
C.
Topological Sort
D.
Full Binary Tree
Show Answer
Correct Answer: D. Full Binary Tree
Explanation:
Full Binary Tree fits because it supports reasoning about strictly binary branching structures and no node has exactly one child.
Choose an option to check your answer.
A.
Complete Binary Tree
B.
Radix Sort
C.
Singly Linked List
D.
Binary Search Tree
Show Answer
Correct Answer: A. Complete Binary Tree
Explanation:
Complete Binary Tree is a binary tree whose levels are full except possibly the last, which is filled left to right.
Choose an option to check your answer.
A.
prefix sums with updates
B.
array-based heap representation
C.
shortest paths in unweighted graphs
D.
simple hash-table implementations
Show Answer
Correct Answer: B. array-based heap representation
Explanation:
Complete Binary Tree is commonly used for array-based heap representation.
Choose an option to check your answer.
A.
the rear index can wrap to the beginning of the array
B.
it can suffer from primary clustering
C.
nodes on the last level are as far left as possible
D.
reachability analysis helps determine which objects can be reclaimed
Show Answer
Correct Answer: C. nodes on the last level are as far left as possible
Explanation:
The defining property is that nodes on the last level are as far left as possible.
