Question No.1 Coin Change Problem: Suppose we have a currency having following c

Question

Question No.1
Coin Change Problem:
Suppose we have a currency having following coins,
1. 1 cent
2. 5 cent
3. 10 cent
You have to find the solution of coin change problem using dynamicprogramming for
amount 15. [Your solution should include minimum number ofcoins].

Hint: Your Table will have coins (denominations) as rows and valuesfrom 1 to 15 as columns. This
problem is similar to knapsack problem with the difference thathere value is count of coins and we will
select minimum coins count, you can see further details in handoutsand video lecture.

Explanation / Answer

x.

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.