DC and DP Quiz

In divide and conquer approach, the problem in hand, is divided into smaller sub-problems and then each problem is solved independently.

• True

• False

This step generally takes a recursive approach to divide the problem until no sub-problem is further divisible.

• Conquer/Solve

• Divide/Break

• Merge/Combine

• None of the Above

Generally, at this level, the problems are considered 'solved' on their own.

• Conquer/Solve

• Divide/Break

• Merge/Combine

• None of the Above

At this stage, sub-problems become atomic in nature but still represent some part of the actual problem.

• Conquer/Solve

• Divide/Break

• Merge/Combine

• None of the Above

When the smaller sub-problems are solved, this stage recursively combines them until they formulate a solution of the original problem.

• Conquer/Solve

• Divide/Break

• Merge/Combine

• None of the Above

This step receives a lot of smaller sub-problems to be solved.

• Conquer/Solve

• Divide/Break

• Merge/Combine

• None of the Above

The following computer algorithms are based on divide-and-conquer programming approach except?

• Merge Sort

• Binary Search

• Tower of Hanoi

• Closest Pair

The following computer problems can be solved using dynamic programming approach except?

• Fibonacci number series

• Project scheduling

• Tower of Hanoi

• Closest Pair

Dynamic algorithms use __________ to remember the output of already solved sub-problems.

• overall solution

• memorization

• overall optimization

• overlapping sub-problem

One advantage of the D & C approach is that recursion is fast.

• True

• False