Design and Analysis of Algorithms MCQs with Answers
Practice important Design and Analysis of Algorithms MCQs with answers and explanations.
Multiple Choice Questions
Q91: The average-case complexity of Quicksort is represented by ______.
- A: Θ(n)
- B: Θ(n²)
- C: Θ(n log n)
- D: Θ(log n)
View Answer
C
Q92: Which part of the Quicksort algorithm takes Θ(n) time?
- A: Merging
- B: Partitioning
- C: Insertion
- D: Deletion
View Answer
B
Q93: Which of the following represents the function that recursively sorts two subarrays?
- A: QUICKSORT
- B: PARTITION
- C: SORT
- D: BINARY_SORT
View Answer
A
Q94: Which sorting algorithm uses no additional array for storage?
- A: In-place sorting
- B: Stable sorting
- C: Merge sorting
- D: Quick sorting
View Answer
A
Q95: Which of the following sorting algorithms is stable?
- A: Quicksort
- B: Heapsort
- C: Mergesort
- D: Selection sort
View Answer
C
Q96: What is the minimum time complexity for comparison-based sorting algorithms?
- A: O(n)
- B: O(n^2)
- C: O(n log n)
- D: Ω(n log n)
View Answer
D
Q97: How many possible combinations exist when sorting three elements (a1, a2, a3)?
- A: 3
- B: 6
- C: 9
- D: 12
View Answer
B
Q98: In sorting, which type of tree represents the comparison-based decision-making process?
- A: Binary tree
- B: Decision tree
- C: Sorting tree
- D: Trie
View Answer
B
Q99: Which of the following is NOT an in-place sorting algorithm?
- A: Bubble sort
- B: Insertion sort
- C: Selection sort
- D: Mergesort
View Answer
D
Q100: Which sorting algorithm is not stable but in-place?
- A: Quick sort
- B: Merge sort
- C: Bubble sort
- D: Insertion sort
View Answer
A