Change -making problem. Assume a given country has four-coin denomination types, namely, d =1, d =...

 

Transcribed Image Text:

Change -making problem. Assume a given country has four-coin denomination types, namely, d =1, d = 5, d3=10, d4 = 25. a) What is the minimum number coins needed for the exchange of 48 cents using Greedy algorithm? (1pt) b) What is the minimum number coins needed for the exchange of 48 cents using dynamic programming algorithm? (Hint: refer chapter 8, Example 2 in the reference take book) (4pt) c) Are the results in (a) and (b) are the same? (1pt) Change -making problem. Assume a given country has four-coin denomination types, namely, d =1, d = 5, d3=10, d4 = 25. a) What is the minimum number coins needed for the exchange of 48 cents using Greedy algorithm? (1pt) b) What is the minimum number coins needed for the exchange of 48 cents using dynamic programming algorithm? (Hint: refer chapter 8, Example 2 in the reference take book) (4pt) c) Are the results in (a) and (b) are the same? (1pt)

Answer rating: 100% (QA)

Changemaking problem Assume a given country has fourcoin denomination types namely d1 1 d2 5 d3 10 d4 25 a What is the minimum number coins needed for ... View the full answer