hw2 - Introduction to Algorithms Problem Set 2 CS 482...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: Introduction to Algorithms Problem Set 2 CS 482 Spring 2006 Due: Friday, February 10 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 4.1, 4.2, 4.4 and 4.5. Question 1 Suppose you are in charge of Cornells super computer center. Various people and groups come to you with requests for computer time, to run their complex biological simulations, elaborate data-mining projects, or just to play a wicked-fast game of minesweeper. We will assume that only one request can be run at a time, and once started, a request is processed until finished. Unlike the interval scheduling problem we saw in class, requests only have lengths (rather than start and end times), so any request may be scheduled if the computer it free. Everyone would prefer to have their requests run as early as possible. Furthermore, you have deemed that some projects, like the biological simulations, are more valuable that others, like the minesweeper...
View Full Document

{[ snackBarMessage ]}

Page1 / 2

hw2 - Introduction to Algorithms Problem Set 2 CS 482...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online