1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. Which of the following problems is NOT s...
Q.

Which of the following problems is NOT solved using dynamic programming?

A. 0/1 knapsack problem
B. matrix chain multiplication problem
C. edit distance problem
D. fractional knapsack problem
Answer» D. fractional knapsack problem
Explanation: the fractional knapsack problem is solved using a greedy algorithm.

Discussion