Algorithm MCQs

1. What is the time complexity of the brute-force polynomial evaluation algorithm?

a) O(n) b) O(n log n) c) O(n²) d) O(n³)

2. Which of the following is a brute-force sorting algorithm?

a) MergeSort b) QuickSort c) Selection Sort d) Heap Sort

3. What is the worst-case time complexity of brute-force string matching?

a) O(n) b) O(mn) c) O(n log n) d) O(m + n)

4. What is the time complexity of the brute-force closest-pair algorithm?

a) O(n) b) O(n log n) c) O(n²) d) O(n³)

5. Which of the following is a strength of brute-force algorithms?

a) High efficiency b) Wide applicability c) Low space complexity d) Constructive design

6. What is the time complexity of the Traveling Salesman Problem using exhaustive search?

a) O(n) b) O(n log n) c) O(n²) d) O((n-1)!)

7. What is the time complexity of the Knapsack Problem using exhaustive search?

a) O(n) b) O(n log n) c) O(2ⁿ) d) O(n²)

8. Which of the following is a brute-force algorithm for matrix multiplication?

a) Strassen's Algorithm b) Coppersmith-Winograd Algorithm c) Standard Matrix Multiplication d) None of the above

9. What is the time complexity of the brute-force Assignment Problem?

a) O(n) b) O(n log n) c) O(n!) d) O(n²)

10. Which of the following is a weakness of brute-force algorithms?

a) High efficiency b) Wide applicability c) Unacceptably slow for large inputs d) Constructive design

Brute Force Algorithms MCQs