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

M

Mr. Dubey

🎓 Coach ⭐ 104.60K Points

📊 Design and Analysis of Algorithms

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

💬 Discuss

✅ Correct Answer: (D) fractional knapsack problem

Explanation: the fractional knapsack problem is solved using a greedy algorithm.

Explanation by: Mr. Dubey

the fractional knapsack problem is solved using a greedy algorithm.

💬 Discussion

📊 Question Analytics

👁️

504

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

99%

Success Rate