HomeworkLib
Question

2. Write a function CHANGES(m) (in psudocode), which returns a minimal number of coins to get a total of m cents. Constraints: There are four types of coins with values 1, 5, 10, and 25, respectively. The total amount of money m is within 1-99 cents. Examples: o CHANGES(3) 3: it takes at least 3 coins (1 cent each) to get a total of 3 cents. o CHANGES(6) 2: it takes at least 2 coins (a 5-cent coin and 1-cent coin) to get a total of 6 o CHANGES(99) 9: it takes at least 9 coins (25 25 +25+ 10 10+1 1 + 1 1) to get a total of 99 cents.

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Request Professional Answer

Request Answer!

We need at least 10 more requests to produce the answer.

0 / 10 have requested this problem solution

The more requests, the faster the answer.

Request! (Login Required)

All students who have requested the answer will be notified once they are available.
Know the answer?
Add Answer to:
2. Write a function CHANGES(m) (in psudocode), which returns a minimal number of coins to get...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Similar Homework Help Questions

  • Write a program that tells what coins to give out for as change from 1 cent...

    Write a program that tells what coins to give out for as change from 1 cent to 99 cents. Use coin denominations of 25 cents (quarters), 10 cents (dimes), and 1 cent (pennies) only. Include a loop that lets the user repeat this computation for new input values until the user says he or she wants to end the program. Solution Demo Hello I am the coin machine! I will give you the least number of coins for your change....

  • Suppose we want to make change for N cents, using the least number of coins of...

    Suppose we want to make change for N cents, using the least number of coins of denominations {1, 5, 10} cents (Different from the US currency system!). Consider the following greedy strategy: suppose the amount left to change is M, take the largest coin that is no more than M; subtract this coin's value from M, and repeat. Implement the Greedy Coin Changing Algorithm in Java. public class Coinchange {    public static int greedycoinchange(int givenvalue, int[] givencoins)    {...

  • Each game costs $5 and four COINS are flipped simultaneously. If you get one head you get $2, if you get two heads you g...

    Each game costs $5 and four COINS are flipped simultaneously. If you get one head you get $2, if you get two heads you get $4, if you get three heads you get $10. Question： create the experimental probability distribution, expected value and bar graph. Compare the distribution, bar graph and expected value to the theoretical. Four Coin Filp ：1-100 Three COINS out of a hundred trials are heads with a probability of 25 Two COINS out of a hundred...

  • Write a script called makeChange that prompts the user for a monetary amount in cents less...

    Write a script called makeChange that prompts the user for a monetary amount in cents less than or equal to 99 cents (i.e. less than a loonie) and then prints how change would be made for that amount out of quarters (25-cent coins), dimes (10-cent coins), nickels (5-cent coins) and pennies (1-cent coins). The change your script specifies should be the minimum number of coins. For example, when making change for 88 cents, the result should indicate 3 quarters, 1...

  • in c code x Global Soccer 1.docx x Acceleration Due to 6 x M Inbox (5,949)...

    in c code x Global Soccer 1.docx x Acceleration Due to 6 x M Inbox (5,949) - joshfor x M Inbox (4,224) - joshuar X ® AC ads/ACFrOgA6UB 1k4Z1i1xGLNQ1Lntj510 lutEUaA..pdf ECE 175: Computer Programming for Engineering Applications Lab Assignment #2 (Thursday sessions) Relevant Programming Concepts: • Branch Structure • Loop Problem 1 (15 points): Develop a C program that asks a user to enter a total change amount in cents) and outputs the change using the fewest coins. The coin...

  • Python 1 Write a function called sum_odd that takes two parameters, then calculates and returns the...

    Python 1 Write a function called sum_odd that takes two parameters, then calculates and returns the sum of the odd numbers between the two given integers. The sum should include the two given integers, if they are odd. You can assume the arguments will always be positive integers, and the first smaller than or equal to the second. 3 To get full credit on this problem, you must define at least 1 function, use at least 1 loop, and use...

  • Write a program called CountCoins.java that prompts the user for the input file name (you can...

    Write a program called CountCoins.java that prompts the user for the input file name (you can copy the getInputScanner() method given in the ProcessFile assignment) then reads the file. The file contains a series of pairs of tokens, where each pair begins with an integer and is followed by the type of coin, which will be “pennies” (1 cent each), “nickels” (5 cents each), “dimes” (10 cents each), or “quarters” (25 cents each), case-insensitively. Add up the cash values of...

  • Question2 uses structured design implemented in C. Array of records (structs) with file I/O is needed....

    Question2 uses structured design implemented in C. Array of records (structs) with file I/O is needed. The program takes two inputs at a time. The name of a person, and, the coin value as an integer in the range 5 to 95. Input coin values should always be divisible by 5 (integer division). Names are one word strings. An example input is: Jane 30 This input line indicates that 30 cents change is to be given to Jane. Output change...

  • Flipping Coins For a fair coin, the chance of getting tails is 1/2. Counting the number...

    Flipping Coins For a fair coin, the chance of getting tails is 1/2. Counting the number of tails Let's experiment with the total number of tails in n trials. Total number of tails in a small number of coin flips ם Suppose we flip 10 coins (with 1 = Tails and 0 = Heads). Here are six samples of size 10. = 10 trials = 6 for (i in 1: trials) { print (sample(c(0, 1), 1, replace=TRUE)) مه ## [1]...

  • Design an O(n)-time non-losing strategy for the first player, Alice, in the coins in-a-line game. Your...

    Design an O(n)-time non-losing strategy for the first player, Alice, in the coins in-a-line game. Your strategy does not have to be optimal, but it should be guaranteed to end in a tie or better for Alice. Coins in a Line 12.4.1 The first game we consider is reported to arise in a problem that is sometimes asked during job interviews at major software and Internet companics (probably because it is so tempting to apply a greedy strategy to this...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT