Practice Library
All MCQs
Browse exam-wise, subject-wise, and country-wise MCQs with explanations.
Choose an option to check your answer.
A.
Radix Sort
B.
Memory Pool
C.
Open Addressing
D.
Bubble Sort
Show Answer
Correct Answer: D. Bubble Sort
Explanation:
Bubble Sort fits because it supports teaching basic sorting mechanics and after each full pass, an extreme element reaches its final region.
Choose an option to check your answer.
A.
children are commonly called left and right
B.
probing searches for another available slot
C.
after each full pass, an extreme element reaches its final region
D.
suffixes are ordered lexicographically
Show Answer
Correct Answer: C. after each full pass, an extreme element reaches its final region
Explanation:
The defining property is that after each full pass, an extreme element reaches its final region.
Choose an option to check your answer.
A.
maintaining an indexed sequence whose size changes
B.
teaching basic sorting mechanics
C.
explaining occasional expensive dynamic-array operations
D.
repeatedly retrieving the smallest element
Show Answer
Correct Answer: B. teaching basic sorting mechanics
Explanation:
Bubble Sort is commonly used for teaching basic sorting mechanics.
Choose an option to check your answer.
A.
Bubble Sort
B.
Disjoint Set Union
C.
Directed Graph
D.
Memory Pool
Show Answer
Correct Answer: A. Bubble Sort
Explanation:
Bubble Sort is a comparison sort that repeatedly swaps adjacent out-of-order elements.
Choose an option to check your answer.
A.
Fibonacci Heap
B.
Union by Rank
C.
Double Hashing
D.
Linear Search
Show Answer
Correct Answer: D. Linear Search
Explanation:
Linear Search fits because it supports small or unsorted collections and it may examine every element.
Choose an option to check your answer.
A.
it typically uses recursion or a stack
B.
only the root is guaranteed to contain the global minimum or maximum
C.
it may examine every element
D.
each digit pass must use a stable subroutine in common LSD implementations
Show Answer
Correct Answer: C. it may examine every element
Explanation:
The defining property is that it may examine every element.
Choose an option to check your answer.
A.
connectivity queries and Kruskal's algorithm
B.
small or unsorted collections
C.
efficient insertion or deletion when a node reference is available
D.
uniformly distributed numeric data
Show Answer
Correct Answer: B. small or unsorted collections
Explanation:
Linear Search is commonly used for small or unsorted collections.
Choose an option to check your answer.
A.
Linear Search
B.
Quick Sort
C.
Garbage Collection
D.
Sparse Table
Show Answer
Correct Answer: A. Linear Search
Explanation:
Linear Search is a searching algorithm that inspects elements one by one.
Choose an option to check your answer.
A.
Directed Graph
B.
Insertion Sort
C.
Linear Probing
D.
Binary Search
Show Answer
Correct Answer: D. Binary Search
Explanation:
Binary Search fits because it supports finding an item in sorted random-access data and it compares with a middle element at each step.
Choose an option to check your answer.
A.
it typically uses recursion or a stack
B.
it can suffer from primary clustering
C.
it compares with a middle element at each step
D.
no node has exactly one child
Show Answer
Correct Answer: C. it compares with a middle element at each step
Explanation:
The defining property is that it compares with a middle element at each step.
Choose an option to check your answer.
A.
fast general-purpose in-memory sorting
B.
finding an item in sorted random-access data
C.
teaching basic sorting mechanics
D.
modeling networks, routes, and relationships
Show Answer
Correct Answer: B. finding an item in sorted random-access data
Explanation:
Binary Search is commonly used for finding an item in sorted random-access data.
Choose an option to check your answer.
A.
Binary Search
B.
Graph
C.
Big-Theta Notation
D.
Counting Sort
Show Answer
Correct Answer: A. Binary Search
Explanation:
Binary Search is a searching algorithm that repeatedly halves a sorted search interval.
