This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSCE 750, Fall 2011, Assignment 8 October 19, 2011 Page 370 Exercises 15.12, 15.13 Page 378 Exercises 15.21, 15.22, 15.25 Pages 389390 Exercises 15.33, 15.34 Pages 396397 Exercises 15.41, 15.42, 15.44, 15.45, 15.46 (optional) Pages 404405 Problems 151, 152 Not in the text Instance of rodcutting You are given the following table of prices you can get for rod lengths i = 1 ,..., 12 (in inches): i 1 2 3 4 5 6 7 8 9 10 11 12 p i 1 3 5 5 9 4 6 10 12 8 7 11 Using the dynamic programming algorithm given in the book or in class, find the maximum possible revenue for a 12inch rod, and a series of cuts that achieves this revenue. Knapsack Problem You are going on a camping trip, and you have a cooler with a capacity of n ounces. The local Walmart sells soda bottles of k different sizes, say a 1 ,...,a k , each a whole number of ounces. Can you stock your cooler completely (to capacity) by buying sodas in some combination of the available sizes? Assume you can buy any number of bottles of anysome combination of the available sizes?...
View
Full
Document
This note was uploaded on 12/13/2011 for the course CSCE 750 taught by Professor Fenner during the Fall '11 term at South Carolina.
 Fall '11
 Fenner
 Algorithms

Click to edit the document details