Introduction to Algorithms
3rd Edition
ISBN: 9780262033848
Author: Thomas H. Cormen, Ronald L. Rivest, Charles E. Leiserson, Clifford Stein
Publisher: MIT Press
expand_more
expand_more
format_list_bulleted
Question
Chapter 16.2, Problem 2E
Program Plan Intro
To give a dynamic-
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies.
Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you ll in the values is the correct one.
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies.
Prove that the coin changing problem exhibits optimal substructure. Design a recursive backtracking (brute-force) algorithm that returns the minimum number of coins needed to make change for n cents for any set of k different coin denominations. Write down the pseudocode and prove that your algorithm is correct.
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies.
Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you fill in the values is the correct one. Notice how it is a lot easier to analyze the running time of…
Chapter 16 Solutions
Introduction to Algorithms
Ch. 16.1 - Prob. 1ECh. 16.1 - Prob. 2ECh. 16.1 - Prob. 3ECh. 16.1 - Prob. 4ECh. 16.1 - Prob. 5ECh. 16.2 - Prob. 1ECh. 16.2 - Prob. 2ECh. 16.2 - Prob. 3ECh. 16.2 - Prob. 4ECh. 16.2 - Prob. 5E
Ch. 16.2 - Prob. 6ECh. 16.2 - Prob. 7ECh. 16.3 - Prob. 1ECh. 16.3 - Prob. 2ECh. 16.3 - Prob. 3ECh. 16.3 - Prob. 4ECh. 16.3 - Prob. 5ECh. 16.3 - Prob. 6ECh. 16.3 - Prob. 7ECh. 16.3 - Prob. 8ECh. 16.3 - Prob. 9ECh. 16.4 - Prob. 1ECh. 16.4 - Prob. 2ECh. 16.4 - Prob. 3ECh. 16.4 - Prob. 4ECh. 16.4 - Prob. 5ECh. 16.5 - Prob. 1ECh. 16.5 - Prob. 2ECh. 16 - Prob. 1PCh. 16 - Prob. 2PCh. 16 - Prob. 3PCh. 16 - Prob. 4PCh. 16 - Prob. 5P
Knowledge Booster
Similar questions
- Consider a real estate company that owns homes on a very long street. Each home on that street is for sale and each home has a, potentially, different integer price in dollars from any other home on the street. What is the largest number of homes a potential buyer can buy, provided that the buyer cannot purchase (immediately) neighboring homes? Using standard pseudo-code notation (it can be similar to Python, for example), write a dynamic programming algorithm (bottom-up) that solves this problem for any n number of homes on such a street.arrow_forwardImagine there are N teams competing in a tournament, and that each team plays each of the other teams once. If a tournament were to take place, it should be demonstrated (using an example) that every team would lose to at least one other team in the tournament.arrow_forwardUse a software program or a graphing utility to solve the system of linear equations. (If there is no solution, enter NO SOLUTION. If the system has an infinite number of solutions, set x5 = t and solve for x1, x2, X3, and x4 in terms of t.) X1 X2 + 2x3 + 2x4 + 6х5 — 3x1 2x2 + 4x3 + 4×4 + 12x5 19 X2 X3 - X4 3x5 = -5 2x1 2x1 2x2 + 4x3 + 5x4 + 15x5 = 17 2x2 + 4x3 + 4x4 + 13x5 19 (X1, X2, X3, X4, X5)arrow_forward
- Dingyu is playing a game defined on an n X n board. Each cell (i, j) of the board (1 2, he may only go to (2, n).) The reward he earns for a move from cell C to cell D is |value of cell C – value of cell D|. The game ends when he reaches (n, n). The total reward - is the sum of the rewards for each move he makes. For example, if n = 1 2 and A = 3 the answer is 4 since he can visit (1, 1) → (1, 2) → (2, 2), and no other solution will get a higher reward. A. Write a recurrence relation to express the maximum possible reward Dingyu can achieve in traveling from cell (1, 1) to cell (n, n). Be sure to include any necessary base cases. B. State the asymptotic (big-O) running time, as a function of n, of a bottom-up dynamic programming algorithm based on your answer from the previous part. Briefly justify your answer. (You do not need to write down the algorithm itself.)arrow_forwardYou are given a collection of n bolts of different widths and n corresponding nuts. You are allowed to try a nut and bolt together, from which you can determine whether the nut is larger than the bolt, smaller than the bolt, or matches the bolt exactly. However, there is no way to compare two nuts together or two bolts together. The problem is to match each bolt to its nut. Design an algorithm for this problem with average-case efficiency in Θ(n log n).arrow_forwardWe want to purchase an item of price and for that, we have an unlimited (!) supply of three types of coins with values 5, 9, and 13, respectively. Our goal is to purchase this item using the smallest possible number of coins or outputting that this is simply not possible. Design a dynamic programming algorithm for this problem with the worst-case runtime ofO(n). Example. A couple of examples for this problem: •Givenn= 17, the answer is “not possible” (try it!). •Givenn= 18, the answer is 2 coins: we pick 2 coins of value 9 (or 1 coin of value 5 and 1 of value 13). •Givenn= 19, the answer is 3 coins: we pick 1 coin of value 9 and 2 coins of value 5. •Givenn= 20, the answer is 4 coins: we pick 4 coins of value 5. •Givenn= 21, the answer is “not possible” (try it!). •Givenn= 22, the answer is 2 coins: we pick 1 coin of value 13 and 1 coin of value 9. •Givenn= 23, the answer is 3 coins: we pick 1 coin of value 13 and 2 coins of value 5. Please explain it too! Thanks!arrow_forward
- in Java Apply the Newton-Raphson's method xn+1 = xn – f '(xn) / f ''(xn) to develop a function double findMinMax(…) that returns a solution that is either a minimum value or a maximum value for z. The program finds a local minimum or a local maximum when the difference between the new solution and the previous one is smaller than 0.00001 within 10000 iterations. Otherwise, it shows Infinity as output. Let function z = x4+2y6 – xy – x + 2. Show the post-conditions for z. The preconditions for x and y are shown as below. Feel free to choose an arbitrary initial guess values x0 and y0 that meet the following precondition. |x| ≤ 6 and |y| ≤ 5arrow_forwardGiven a positive integer number n (i.e., n>0), we can use the following algorithm to find the nth fibonacci number:fibonacci(n){If n=1, return 1;If n=2, return 1;return fibonacci(n-1) + fibonacci(n-2);}Given that there exists overlaps in the sub-problems of the problem, write a Dynamic programmingalgorithm to overcome the overlapping. Implement both algorithms in C++. You need to submit source code. Give the number of additions needed for each algorithm when n=10, 15, 20, 25, 30, 35, 40.arrow_forwardSuppose that there are m students who want to take part in n projects. A student is allowed to join in a particular project only if the student is qualified for the project. Each project can only have a limited number of students, and each student can take part in at most one project. The goal is to maximize the number of students that are admitted to the projects. Show how to solve this problem by transforming it into a maximum flow problem. What is the running time of your algorithm?arrow_forward
- In dynamic programming solution of the segmented least squares problem, we fit a single line to the points on a plane.T or F?arrow_forward3. A thief robbing a store finds n items. The i" item is worth v; dollars and weighs w; pounds, where v; and wi are integers. The thief wants to take as valuable a load as possible, but he can carry at most W pounds in his knapsack, for some integer W. Which items should he take? This problem is called 0-1 knapsack problem because for each item, the thief either take it or leave behind. No fractional amount from an item can be taken. Consider the most valuable load that weighs at most W pounds. If we remove item j from this load, the remaining load must be the most valuable load weighing at most W-w; that the thief can take from the n - I original items excluding j. Write a simple pseudo code for the given greedy algorithm description first and show how using this greedy algorithm to solve the problem of Knapsack problem below. Assume that maximum weight that can be carried is 7 lbs. Does it your code find the optimal solution? Show the optimal solution if it exists. Item Value ($)…arrow_forwardSuppose that the equation ax b .mod n/ is solvable (that is, d j b, whered D gcd.a; n/) and that x0 is any solution to this equation. Then, this equation has exactly d distinct solutions, modulo n, given by xi D x0 C i.n=d / fori D 0; 1; : : : ; d 1arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education