This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Introduction to Algorithms Problem Set 3 CS 482 Spring 2006 Due: Friday, February 17 Please hand in each problem on separate sheets with your name and netID on each. If a problem requires multiple sheets, please staple the sheets for that problem together Reading: Chapters 6.1 - 6.5. Question 1 Suppose you work in a novelty beer factory, monitoring the quality of funny shaped beer containers as they roll by on a conveyor belt. You haven’t been so great about getting to work on time (9 am is early!), so you’re pretty sure that you’ll be fired by the end of the day. It’s OK, you didn’t like the job anyway. But you’re still a little indignant and decide to stick it to the man. You figure you’ll steal as much beer as possible before you get kicked out on the steet. The only problem is Myrtle. She also monitors the conveyor belt a little ways down. She can’t see so well, but you’re pretty sure she’d notice and sound the alarm if you took all the beer for the day. But maybe if you didn’t take too much at any time, things would be OK. You decide that to play it safe, you will never take three consecutive beers off the conveyor belt. Now you just need to figure out which ones to take to get the most booze; the thing is, the containers come in all different sizes. Luckily for you, you’ve worked here long enough to know which sizes comecome in all different sizes....
View Full Document
This homework help was uploaded on 10/17/2007 for the course COM S 482 taught by Professor Wexler during the Spring '06 term at Cornell.
- Spring '06