« Lecture #Syllabus for all sect | Main | Project #Syllabus for all sect »
March 06, 2006
Homework Syllabus for all sect
9.9 – allow for opponent in Nim to make a mistake (easy)
9.14 – DFS (easy)
9.31 – BFS (easy)
Knapsack (easy) : solve an instance of the type of knapsack problem described in section 9.6.1 involving three types of objects, whose weights are respectively 2, 3, and 4 units, and whose values are 3, 5, and 6. The knapsack can carry a maximum of 8 units of weight. Draw the implicit tree explored by backtracking to find the optimal load (the one that maximized the value of the included objects, while respecting the capacity (weight) constraint (similar to Figure 9.12).
9.42 – Knapsack with load extraction (easy)
Posted by ringger at March 6, 2006 09:17 AM
Comments
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.)