Develop a solution that would return the fewest coins in change from a purchase of under one dollar. (include pennies, nickels, dimes, quarters, and half dollars) Example : purchase 63¢ Change 37¢ Coins 1 quarter 1 dime 2 pennies Develop a solution that would return the fewest bills and coins for a purchase under $50.

Develop a solution that would return the fewest coins in change from a purchase of under one dollar. (include pennies, nickels, dimes, quarters, and half dollars) Example : purchase 63¢ Change 37¢ Coins 1 quarter 1 dime 2 pennies Develop a solution that would return the fewest bills and coins for a purchase under $50.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter18: Deterministic Dynamic Programming

Section18.1: Two Puzzles

Problem 2P

See similar textbooks

Similar questions

Project Optimization and regression: Exact and approximate methods to solve 0-1 Knapsack problem Description The 0/1 Knapsack Problem and Logistics Transportation companies such as TNT and Royal Mail face daily problems in logistics. Consider the following simple logistics problem, which you will solve: An airline cargo company has 1 aeroplane which it flies from the UK to the US on a daily basis to transport some cargo. In advance of a flight, it receives bids for deliveries from (many) customers. Customers state the weight of the cargo item they would like delivered, and the amount they are prepared to pay. The airline is constrained by the total amount of weight the plane is allowed to carry. The company must choose a subset of the packages (bids) to carry in order to make the maximum possible profit, given the weight limit that they must respect. In mathematical form the problem is: Given a set of N items each with weight wi and value vi, for i=1 to N, choose a subset of items…
Python Knapsack Problem: imagine you are carrying a knapsack with capacity to hold a total of weight C. You are selecting among n items with values A={a_1, a_2, ... , a_n} and associated weights W={w_1, w_2, ... , w_n}. Here the weights and values are all positive. You wish to maximize the total value of the items you select not exceeding the given weight capacity, example, maximize sum_{a in A} such that sum_{w in W} <= C. Note that you can only select your items once. Reformulate this as a bottom-up dynamic programming problem as follows. Define K_{i,j} as the highest possible value sum considering items 1 through i and total weight capacity j (j <= C). What is the base case i.e. K_{0,j} for all j and K_{i,0} for all i. What is the loop statement?
Interest on a credit card’s unpaid balance is calculated using the average daily balance. Suppose that netBalance is the balance shown in the bill, payment is the payment made, d1 is the number of days in the billing cycle, and d2 is the number of days payment is made before billing cycle. Then, the average daily balance is: averageDailyBalance =netBalance x d1-payment x d2d1 If the interest rate per month is, say, 0.0152, then the interest on the unpaid balance is: Interest= averageDailyBalance * 0.0152 Write a program using c++ compiler that accepts as inputnetBalance, payment, d1,d2, and interest rate per month. The program outputs the interest. Format your output to two decimal places.
Computer Science Investing in stocks is a way to create assets that are supposed to provide financial security over time. In solving this problem, we assume that an investor buys several shares of stock at a certain price. These shares are going to be sold later on for a different price. Obviously, if the selling price is higher than the acquisition price, the investor makes a profit, registering capital gain. If the shares are sold at a lower price, the investor has a loss, which marks a negative capital gain. This whole process is done over a period of time, and you are required to create a scenario for buying and selling shares. The assumption is that the investor sells shares in the order in which they were purchased. The goal is to calculate the capital gain over time. Suppose that you buy n shares of stock or mutual fund for d dollars each. Later, you sell some of these shares. If the sale price exceeds the purchase price, you have made a profit—a capital gain. On the other…
Quadratic Root Solver For a general quadratic equation y = ax? + bx + c, the roots can be classified into three categories depending upon the value of the discriminant which is given by b2 - 4ac First, if the discriminant is equal to 0, there is only one real root. Then, if the discriminant is a positive value, there are two roots which are real and unequal. The roots can be computed as follows: -b+ Vb? – 4ac 2a Further, if the discriminant is a negative value, then there are two imaginary roots. In this case, the roots are given by b ь? - 4ас 2a 2a Programming tasks: A text file, coeff.txt has the following information: coeff.txt 3 4 4 4 1 4 Each line represents the values of a, b and c, for a quadratic equation. Write a program that read these coefficient values, calculate the roots of each quadratic equation, and display the results. Your program should perform the following tasks: • Check if the file is successfully opened before reading • Use loop to read the file from main…
• A circuit consists of a 12 V battery connected across a single resistor. If the current in the circuit is 3 A, calculate the size of the resistor. If a small appliance is rated at a current of 10 amps and a voltage of 120 volts, the power rating would be?.
Section: FactThyroid function is measured using a factor called TSH, which stands for thyroid-stimulatinghormone. A TSH test is a blood test that measures this hormone. TSH normal values are 0.5 to 5.0mIU/L. If TSH is over 5.0 thyroid is underactive. On the other hand, if TSH is less than 0.5 thyroid isoveractive.
In the US Higher Education sector, a degree is classified using a Grade Point Average (GPA). The grades ‘A’, ‘B’, ‘C’, ‘D’ or ‘F’ are called academic grades. Each ‘A’ is worth 4 points, each ‘B’ is worth 3 points, each ‘C’ is worth 2 points, each ‘D’ is worth 1 point and each ‘F’ is worth 0 points. The GPA is found by calculating the number of points and then dividing by the number of academic grades. A student may also have a non-academic grade of ‘W’ (for withdrew) which is not counted at all in the calculation. You can assume that the student will have at least one academic grade in their list of grades. There are many ways of calculating a GPA from a list of grades, but you must follow the algorithm given by this top-level decomposition: > Find GPA. >> Input a list of academic and non-academic grades. >> Create a new list that consists of the number of points for each academic grade in the input list. >> Add up the values in the new list and divide by the…
Story: Once upon a time a farmer went to a market and purchased a wolf, a goat, and a cabbage. On his way home, the farmer came to the bank of a river and rented a boat. But crossing the river by boat, the farmer could carry only himself and a single one of his purchases: the wolf, the goat, or the cabbage. If left unattended together, the wolf would eat the goat, or the goat would eat the cabbage. Problem: Create a Flowchart and Algorithm of all the possible solutions on how the farmer carry himself and his purchases to the far bank of the river, leaving each purchase intact.
please code in python# Write code to indicate how many tickets one has to buy approximately to have at least three white ball matching# Logic # Step 1: Buy a ticket with 5 white balls [not identical, between 1-69] and 1 red ball [between 1-26]# Step 2: Continue buying tickets until getting the ticket with at least three white ball matching# Step 3: Record how many tickets one has bought - M #print(totaltry) # Step 4: Repeat steps 1-3 10000 times and record # of tickets as M1, M2, M3, ... M100000 # Step 5: Sum(M1, M2, ... Mn)/10000 is the tickets one has to buy approximately to have at least three white ball matching
Suppose you wanted to harness to power of wind to generate electricity. One question you might want to ask is: what is the amount of power my wind turbine can produce? To answer this question, you will need at least the following information: The average wind speed (in m/s) The operating efficiency of your wind turbine (in %) The radius of the blades on your wind turbine (in meters) To compute the maximum power output for your wind turbine, you would need the following math formulas: A= πr2, which represents the cross-sectional area of a circle (π = 3.14159265). Pmax = 0.5ρAv3, which calculates the maximum available power given the wind speed in m/s (ν), cross-sectional area of the blades in m2 (A), and the density of the air (ρ = 1.2 kg/m3). Once you have the maximum available power, computing the actual amount of power (not the maximum) produced by the wind turbine is a matter of determining the amount of power based on the operating efficiency. Exercise #1: Create a Java class…
QUADRATIC PRIMES This question is adopted from Project Euler Question 27. (https://projecteuler.net/problem=27) The quadratic formula n^2 + n + 41 will produce 40 primes for consecutive integer values 0 <= n <= 39. However, when n = 40, this formula will not generate a prime number. Another interesting quadratic formula n^2 – 79n + 1601 produces 80 prime numbers for consecutive values 0 <= n <= 79. The Question: find a and b such that when -999 <= a <= 999 and -1000 <= b <= 1000, the quadratic form ?^2 + ? × ? + ? produces the maximum number of primes for consecutive values of n, starting with n = 0. Requirement: MUST BE WRITTEN IN C++ - Print the 40 primes generated by formula n 2 + n + 41 - Print the 80 primes generated by formula n 2 – 79n + 1601 - Write a function that takes in an integer and returns whether the given number is prime or not. - Output the value of a, b and how many consecutive values of n (count the starting zero!) can be generated. - Submit…