{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw8 - CSCE 750 Fall 2011 Assignment 8 Page 370 Exercises...

This preview shows pages 1–2. Sign up to view the full content.

CSCE 750, Fall 2011, Assignment 8 October 19, 2011 Page 370 Exercises 15.1-2, 15.1-3 Page 378 Exercises 15.2-1, 15.2-2, 15.2-5 Pages 389–390 Exercises 15.3-3, 15.3-4 Pages 396–397 Exercises 15.4-1, 15.4-2, 15.4-4, 15.4-5, 15.4-6 (optional) Pages 404–405 Problems 15-1, 15-2 Not in the text Instance of rod-cutting 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 12-inch 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 any size, and that you can pack your cooler efficiently (no empty gaps).

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}