Question:

The greedy approach is optimal for _______ .

Show Hint

When tackling optimization problems like the Fractional Knapsack, the greedy method works best. For other problems, consider dynamic programming.
Updated On: Jun 16, 2025
  • 0/1 Knapsack
  • Fractional Knapsack
  • Longest Increasing Subsequence
  • Matrix Chain Multiplication
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

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.
Was this answer helpful?
0
0