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.

Published by Mr. Dubey ⭐ 111.54K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

the fractional knapsack problem is solved using a greedy algorithm.

💬 Discussion

📊 Question Analytics

👁️

539

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

96%

Success Rate