Suppose we wanted to make change for purchases and wanted to use the least number of coins possible. Here is a greedy algorithm:
1 answer:
Answer:
Explanation:
The following code is a Python function that takes in the amount of change. Then it uses division and the modulo operator to calculate the number of coins that make up the changes, using the greatest coin values first.
import math
def amountOfCoins(change):
print("Change: " + str(change))
quarters = math.floor(change / 0.25)
change = change % 0.25
dimes = math.floor(change / 0.20)
change = change % 0.20
pennies = math.floor(change / 0.01)
print("Quarters: " + str(quarters) + "\nDimes: " + str(dimes) + "\nPennies: " + str(pennies))
You might be interested in
Answer:
The ER Diagram is in the attachment. And I an including the membership details in the use case:
Applicants: Coach will ask for iD.
if the application is not registered, coach sends to registration department.
Applicants registers-->> shows registration ID-->> goes to account section
Submits the fee->> goes to coach again-->>coach asks for fee sjip-->> On yes-->> entrance allowed else-->> sent to account section
Applicants apply for course-->>if prerequisite is met, registration allowed
else-->>registration denied
Note: If registration is allowed the applicant is sent to account section and
Also note:
First check, then registration, then course prerequisite check,then account->entrance
If registered->direct entry.
Explanation:
The answer is self explanatory.
