Q273
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
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board