Homework Assignment 3 Solution

Problem 1: (3 points) Rod Cutting: (from the text CLRS) 15.1-2




Problem 2: (3 points) Modified Rod Cutting: (from the text CLRS) 15.1-3







Problem 3: Making Change: Given coins of denominations (value) 1 = v1 < v2< … < vn, we wish




to make change for an amount A using as few coins as possible. Assume that vi’s and A are integers. Since v1= 1 there will always be a solution. Formally, an algorithm for this problem should take as input an array V where V[i] is the value of the coin of the ith denomination and a value A which is the amount of change we are asked to make. The algorithm should return an array C where C[i] is the number of coins of value V[i] to return as change and m the minimum number of coins it took. You must return exact change so

∑ [ ] ∙ [ ] =

=1




The objective is to minimize the number of coins returned or:

m = min ∑ [ ]

=1




Describe and give pseudocode for a dynamic programming algorithm to find the minimum number of coins needed to make change for A.



What is the theoretical running time of your algorithm?



Problem 4: Shopping Spree: (18 points) Acme Super Store is having a contest to give away shopping sprees to lucky families. If a family wins a shopping spree each person in the family can take any items in the store that he or she can carry out, however each person can only take one of each type of item. For example, one family member can take one television, one watch and one toaster, while another family member can take one television, one camera and one pair of shoes. Each item has a price (in dollars) and a weight (in pounds) and each person in the family has a limit in the total weight they can carry. Two people cannot work together to carry an item. Your job is to help the families select items for each person to carry to maximize the total price of all items the family takes. Write an algorithm to determine the maximum total price of items for each family and the items that each family member should select.




Submit to Canvas




A verbal description and give pseudo-code for your algorithm. Try to create an algorithm that is efficient in both time and storage requirements.



What is the theoretical running time of your algorithm for one test case given N items, a family of size F, and family members who can carry at most Mi pounds for 1 ≤ i ≤ F.















1

c) Implement your algorithm by writing a program named “shopping” (in C, C++ or Python) that compiles and runs on the OSU engineering servers. The program should satisfy the specifications below.




Input: The input file named “shopping.txt” consists of T test cases




T (1 ≤ T ≤ 100) is given on the first line of the input file.




Each test case begins with a line containing a single integer number N that indicates the number




of items (1 ≤ N ≤ 100) in that test case




Followed by N lines, each containing two integers: P and W. The first integer (1 ≤ P ≤ 5000) corresponds to the price of object and the second integer (1 ≤ W ≤ 100) corresponds to the




weight of object.

The next line contains one integer (1 ≤ F ≤ 30) which is the number of people in that family.




The next F lines contains the maximum weight (1 ≤ M ≤ 200) that can be carried by the ith person in the family (1 ≤ i ≤ F).




Output: Written to a file named “results.txt”. For each test case your program should output the maximum total price of all goods that the family can carry out during their shopping spree and for each the family member, numbered 1 ≤ i ≤ F, list the item numbers 1 ≤ N ≤ 100 that they should select.




Sample Input

2

3

17
23
24



 
 
 
26
22
4
18
13
9



 
 
 
 
 



Sample Output:

Test Case 1

Total Price 72

Member Items

1: 1




2




Test Case 2




Total Price 568

Member Items

3 4
3 6
3 6
3 4 6






Submit to TEACH a zipped file containing your code files and README file.




Note: You will not be collecting experimental running rimes.




















































































































































3