Which of the following problems can be solved using the greedy algorithm…
2026
Which of the following problems can be solved using the greedy algorithm approach ?
- A.
0/1 Knapsack problem
- B.
Longest Common Subsequence
- C.
Fractional Knapsack problem
- D.
Matrix Chain Multiplication
Attempted by 160 students.
Show answer & explanation
Correct answer: C
The Fractional Knapsack problem is a classic example solvable with greedy algorithms by selecting items based on value-to-weight ratio. The 0/1 Knapsack, LCS, and Matrix Chain Multiplication require dynamic programming instead.