Algorithm MCQs

1. What is an algorithm?

a) A sequence of ambiguous instructions for solving a problem b) A sequence of unambiguous instructions for solving a problem c) A random set of steps to achieve a goal d) A theoretical concept with no practical application

2. Which of the following is NOT a characteristic of an algorithm?

a) Finiteness b) Unambiguity c) Effectiveness d) Ambiguity

3. What is the primary purpose of Euclid’s algorithm?

a) Sorting a list of numbers b) Finding the greatest common divisor (GCD) of two numbers c) Solving the traveling salesman problem d) Searching for an element in a sorted array

4. Which of the following is an example of a computational problem?

a) Sorting b) Searching c) Shortest paths in a graph d) All of the above

5. What is the time complexity of Euclid’s algorithm for finding the GCD of two numbers?

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

6. Which of the following is NOT a design strategy for algorithms?

a) Brute force b) Divide and conquer c) Random guessing d) Greedy approach

7. What is the main goal of analyzing algorithms?

a) To determine their correctness b) To evaluate their time and space efficiency c) To compare them with other algorithms d) All of the above

8. Which of the following is true about selection sort?

a) It is an unstable sorting algorithm b) It has a time complexity of O(n log n) c) It requires extra memory for sorting d) It is based on the divide and conquer strategy

9. What is the key requirement for binary search to work?

a) The input array must be unsorted b) The input array must be sorted c) The input array must contain only positive numbers d) The input array must be of even length

10. Which of the following is an example of a string processing problem?

a) Finding the shortest path in a graph b) Searching for a word in a document c) Sorting a list of numbers d) Computing the GCD of two numbers

11. What is the primary purpose of studying algorithms?

a) To understand theoretical concepts in computer science b) To develop practical problem-solving skills c) To design efficient solutions for real-world problems d) All of the above

12. Which of the following is NOT a property of a good algorithm?

a) Finiteness b) Definiteness c) Ambiguity d) Effectiveness

13. What is the time complexity of the middle-school procedure for finding the GCD of two numbers?

a) O(log n) b) O(n) c) O(sqrt(n)) d) O(n^2)

14. Which of the following is an example of a combinatorial problem?

a) Sorting b) Searching c) Traveling salesman problem d) String matching

15. What is the main advantage of using a greedy approach in algorithm design?

a) It always produces the optimal solution b) It is simple and easy to implement c) It works well for all types of problems d) It guarantees the best time complexity

Algorithm MCQs

Your Score: /15