Question

The greedy approach is optimal for _______ .

• A. 0/1 Knapsack
• B. Fractional Knapsack
• C. Longest Increasing Subsequence
• D. Matrix Chain Multiplication

Hint:

When tackling optimization problems like the Fractional Knapsack, the greedy method works best. For other problems, consider dynamic programming.

Answer 1

The Correct Option is B

The greedy approach is optimal for the Fractional Knapsack problem, as it can always make the locally optimal choice to maximize the total value. For problems like the 0/1 Knapsack, the greedy approach does not guarantee an optimal solution. The Longest Increasing Subsequence and Matrix Chain Multiplication problems require dynamic programming for optimal solutions.