CS 510 Programming Project 3

PROGRAMMING

PROJECT 3

CS510

due Friday, May 1, 1998
Your program must be in my office by 5 pm on this day to receive full credit.

Write an application that implements the algorithms described in the text on pp78 Exercises #3-6 and #3-7. Use the criteria we decided on in class. The assumptions we decided on were

The number of denomiantions is at least 2 (ie: k >= 2).
The smallest denomination is 1 (ie: d₁ = 1).

Your program must have as input the values for k, d₁, d₂, up to d_k. The first problem solution should also take an integer for which you wish to make change. The second problem should take an integer for which your wish to know the number of ways to make change. These two options should be part of a menu.

Run your program on the 1, 6, 10 data set from class to check to see if it works. Then run your program on the following data:

denominations value of n for both menu options

1, 5, 10 60

1, 2, 5, 8 20

45

67

denominations	value of n for both menu options
1, 5, 10	60
1, 2, 5, 8	20
45
67

Print out (or email) a copy of your code and the output. If you are using Code Warrior you may need to write your output to a file so you can send the entire run to me. I don't know any other way to print the output from Code Warrior.

Remember the Programming and Documentation Style requirements!