Algorithm MCQs

1. What is the time complexity of Counting Sort?

a) O(n) b) O(n log n) c) O(n + k) d) O(n²)

2. Which of the following is true about Counting Sort?

a) It is a comparison-based sorting algorithm. b) It is suitable for sorting large datasets with a small range of values. c) It has a space complexity of O(1). d) It is not a stable sorting algorithm.

3. What is the time complexity of Radix Sort?

a) O(n) b) O(n log n) c) O(d(n + k)) d) O(n²)

4. Which of the following is true about Radix Sort?

a) It is a comparison-based sorting algorithm. b) It processes digits from the most significant digit (MSD) to the least significant digit (LSD). c) It is suitable for sorting integers and strings. d) It has a space complexity of O(1).

5. What is the time complexity of Bucket Sort?

a) O(n) b) O(n log n) c) O(n + k) d) O(n²)

6. Which of the following is true about Bucket Sort?

a) It is suitable for sorting uniformly distributed data. b) It is a comparison-based sorting algorithm. c) It has a space complexity of O(1). d) It is not a stable sorting algorithm.

7. What is the time complexity of Heapsort?

a) O(n) b) O(n log n) c) O(n + k) d) O(n²)

8. Which of the following is true about Heaps?

a) A heap is a complete binary tree. b) A heap can be represented as an array. c) A heap has a time complexity of O(log n) for insertion and deletion. d) All of the above.

9. What is the time complexity of inserting an element into a heap?

a) O(1) b) O(log n) c) O(n) d) O(n log n)

10. Which of the following is true about Hashing?

a) It is used to map keys to values. b) It has a time complexity of O(1) for search, insert, and delete operations in the average case. c) It is used to resolve collisions using techniques like chaining and open addressing. d) All of the above.

11. What is the time complexity of Selection Sort?

a) O(n) b) O(n log n) c) O(n²) d) O(n + k)

12. Which of the following is true about Selection Sort?

a) It is an in-place sorting algorithm. b) It has a time complexity of O(n²) in all cases. c) It is not suitable for large datasets. d) All of the above.

13. What is the time complexity of Bubble Sort?

a) O(n) b) O(n log n) c) O(n²) d) O(n + k)

14. Which of the following is true about Bubble Sort?

a) It is an in-place sorting algorithm. b) It has a time complexity of O(n²) in the worst case. c) It is not suitable for large datasets. d) All of the above.

15. Which of the following sorting algorithms is stable?

a) Counting Sort b) Radix Sort c) Bubble Sort d) All of the above

Sorting and Hashing Algorithms MCQs

Your Score: /15