Answered: Modify your bottom-up function DPchange…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Modify your bottom-up function DPchange to return not only the best number of coins but also the corresponding combination of denominations as a vector. Do this by creating a new function DPChange_bt that is largely the same as DPChange but declares an array coinsUsed that keeps track of the coin on the best path to a given entry M (between 1 and ?+1). DPChange_bt should return both bestNumCoins and coinsUsed.

# Bottom up DPchange
def DPChange (M, c, d):
bestnumcoins - [0] + [np.inf for in range (M)]
for m in range (1, M+1):
print ("\n")
for i in range (d):
if m >= c[i]:
print (f"M = {m}, c = {c[i]}")
if bestnumCoins[m-c[i]] + 1 < bestnumCoins[m]:
bestnumCoins [ m]
bestnumCoins[m-c[i]] + 1
print (bestnumCoins)
return bestnumCoins [M]

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions