« Homework Syllabus for all sect | Main | TechnicalSyllabus for all sect »
February 21, 2006
Homework Syllabus for all sect
#1: Consider figure 8.4 for filling a knapsack using dynamic programming. Let's use a new set of objects whose weights are 1, 2, and 4 units, and whose values are 1, 7, and 15, respectively. If we can carry a maximum of 12 units of weight, construct a new table like 8.4 to determine the optimal load in a knapsack (using DP) with these objects. Analyze the new table to determine which objects will be included in the optimal load. The process of analyzing the table to determine the contents, rather than just the value, of the optimal load is closely related to an algorithm you will need in the project.
#2: 8.11 (writing the pseudocode for 0/1 knapsack)
#3: 8.13 (on extracting equivalent optimal solutions to 0/1 knapsack from the DP table)
Posted by ringger at February 21, 2006 03:07 PM
Comments
Feb 29, eh? I guess we don't have to turn it in until 2008, sweet! :-)
Posted by: Amitola ![[TypeKey Profile Page]](http://vv.cs.byu.edu/cs312/nav-commenters.gif)
at February 28, 2006 09:02 PM
actually, not even until 2012, since it does say Wed, Feb 29.... yah, yah, I'll have it done for tomorrow.... (is there not a way to edit a comment?)
Posted by: Amitola at February 28, 2006 09:04 PM
Post a comment
Thanks for signing in, . Now you can comment. (sign out)
(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)