# hw11 - max(x)-min(x), max(y)-min(y)) and should be either...

This preview shows page 1. Sign up to view the full content.

CSE331 Section 2 Homework 11 Due: Friday April 18, 2008 at 11:59am 1. Problem 10.10 on page 477 for online algorithms (i.e., next fit, first fit, and best fit). 2. Problem 10.10 on page 477 for offline algorithms (i.e. first fit decreasing, best fit decreasing). 3. Convex Hull: Given: xi, yi, where i=1,…, N Find the line that provides a partition such that the number of points on each side of the line differs by at most 1. The line should be along the longer dimension (this can be found by calculating
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: max(x)-min(x), max(y)-min(y)) and should be either horizontal (i.e. y=3) or vertical (i.e. x=2). The algorithm should run in O(NlogN) time. Describe your algorithm either in pseudo code or with a general description. 4. Problem 10.28 on page 478. Show your work. 5. Problem 10.29 on page 478. For each part, provide a counter example. Show the computed cost and optimal cost for each counter example. Use at most 3 matrices and the smallest dimensions you can....
View Full Document

## This note was uploaded on 07/25/2008 for the course CSE 331 taught by Professor M.mccullen during the Spring '08 term at Michigan State University.

Ask a homework question - tutors are online