Design and Analysis of Algorithms MCQs with Answers
Practice important Design and Analysis of Algorithms MCQs with answers and explanations.
Multiple Choice Questions
Q61: Which of the following is NOT a sorting algorithm?
- A: Bubble Sort
- B: Insertion Sort
- C: Selection Sort
- D: Queue Sort
View Answer
D
Q62: What is the time complexity of Bubble Sort in the worst case?
- A: Θ(n log n)
- B: Θ(n^2)
- C: Θ(n)
- D: Θ(log n)
View Answer
B
Q63: Which of the following is true about Selection Sort?
- A: It finds the largest element each pass
- B: It finds the smallest element each pass
- C: It uses recursion
- D: It is a parallel algorithm
View Answer
B
Q64: What does a min-heap store at its root node?
- A: The largest key
- B: The smallest key
- C: The average key
- D: The first inserted key
View Answer
B
Q65: What is the principal operation in maintaining heap order called?
- A: BuildHeap
- B: Heapify
- C: Sortify
- D: ReHeap
View Answer
B
Q66: In a binary heap, the left child of a node at index i is located at which index?
- A: i/2
- B: i+2
- C: 2*i
- D: 2*i + 1
View Answer
C
Q67: Which sorting algorithm has a time complexity of Θ(n log n) in the best and worst cases?
- A: Quick Sort
- B: Merge Sort
- C: Selection Sort
- D: Bubble Sort
View Answer
B
Q68: In Heapsort, after removing the maximum item, what step is performed next?
- A: Insert item at root
- B: Replace it with last leaf
- C: Insert item at end
- D: Swap items at random
View Answer
B
Q69: What is the purpose of the ‘Heapify’ procedure?
- A: To keep the heap sorted
- B: To restore heap order
- C: To delete nodes from the heap
- D: To remove duplicates
View Answer
B
Q70: In a min-heap, which of the following is always true for any two nodes X and Y?
- A: X < Y
- B: X > Y
- C: Parent of X is greater than Y
- D: Parent of X is smaller than Y
View Answer
D