Homework assignment 5
CSCI 3650
Summer 2001

1. Page 336 problem 17.2-2. (Hint: build a two-dimensional array having a row for each item and a column for each possible weight of items. Entry V(k,w) can be the best value that can be achieved if you are restricted from choosing among the first k items, and you must achieve a total weight of exactly w. How can you fill in the array?)
2. Page 337 problem 17.2-4. Use a greedy algorithm.