Design and Analysis of Algorithms MCQs with Answers
Practice important Design and Analysis of Algorithms MCQs with answers and explanations.
Multiple Choice Questions
Q121: In a bucket sort with linked lists, what operation is required to add an item to a bin's linked list?
- A: O(n)
- B: O(m)
- C: O(1)
- D: O(log n)
View Answer
C
Q122: In bucket sort, the step to "link all lists into one list" takes _____.
- A: O(n)
- B: O(m)
- C: O(n + m)
- D: O(log m)
View Answer
B
Q123: Which of the following describes Radix Sort?
- A: Sorts numbers one digit at a time
- B: Sorts numbers based on key
- C: Sorts numbers in random order
- D: Sorts numbers by bin range
View Answer
A
Q124: Radix Sort is advantageous for sorting large _______.
- A: small integers
- B: small characters
- C: large integers
- D: short text
View Answer
C
Q125: In Radix Sort, stable sorting occurs with respect to the ______ digit first.
- A: highest order
- B: second lowest order
- C: lowest order
- D: any random
View Answer
C
Q126: The Bucket Sort algorithm's sorting order depends on ______.
- A: bin placement
- B: linked list usage
- C: initial array order
- D: item uniqueness
View Answer
A
Q127: What is a limitation of counting sort, addressed by Radix Sort?
- A: Small data storage
- B: Requires linked lists
- C: Limited to small integers
- D: Needs sorting in O(n*m)
View Answer
C
Q128: Which data structure can replace bins in Bucket Sort for duplicate handling?
- A: Stacks
- B: Queues
- C: Linked lists
- D: Binary trees
View Answer
C
Q129: The time complexity of Radix Sort for n elements, each d digits, is O(______).
- A: n+d
- B: nd
- C: d^2
- D: 2n
View Answer
B
Q130: Which algorithm is better suited for data with wide-ranging integer values?
- A: Bucket Sort
- B: Radix Sort
- C: Insertion Sort
- D: Bubble Sort
View Answer
B