DAA Divide and Conquer Algorithm

What is the main idea behind the Divide and Conquer algorithm?

• To avoid recursion entirely

• To use a single recursive call

• To break a problem into smaller subproblems

• To solve problems by brute force

Which of the following is NOT a step in the Divide and Conquer algorithm?

• Iterate

• Conquer

• Merge

• Divide

Which algorithm is an example of Divide and Conquer?

• Merge Sort

• Selection Sort

• Linear Search

• Bubble Sort

What is the first step in the Divide and Conquer approach?

• Combine

• Conquer

• Divide

• Analyze

In the context of Divide and Conquer, what does 'Merge' refer to?

• Ignoring the subproblems

• Combining the results of subproblems

• Dividing the problem into smaller parts

• Solving the base case

Which of the following problems can be solved using Divide and Conquer?

• Finding the maximum element in an array

• Calculating Fibonacci numbers

• Finding the greatest common divisor

• Sorting a list using Insertion Sort

What is a characteristic of subproblems in Divide and Conquer?

• They cannot be combined

• They are always of the same size

• They can be solved in parallel

• They must be dependent on each other

Which of the following is a disadvantage of the Divide and Conquer algorithm?

• It is easy to implement

• It can lead to overhead from recursion

• It is always efficient

• It requires no additional memory

In Divide and Conquer, what is the purpose of the 'Conquer' step?

• To solve the subproblems recursively

• To analyze the complexity of the algorithm

• To divide the problem into smaller parts

• To combine the results of the subproblems

Which of the following does not describe Divide and Conquer Strategy?

• Divide the main problem into subproblems.

• Conquers each subproblem individually.

• Process independent subproblems one at a time.

  
  

• Combine solutions to create the solution to the original problem.