CSE331 HW10 - CSE 331: Introduction to Algorithm Analysis...

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

View Full Document Right Arrow Icon
CSE 331: Introduction to Algorithm Analysis and Design Fall 2011 Homework 10 Due Friday, December 9, 2011 in class by 1:15pm Please submit each problem separately, i.e. each problem should begin on a new page and only the pages for one problem should be stapled together. Failure to do so might result in some problem(s) not being graded. For general homework policies and our suggestions, please see the policy document. This homework is longer than usual so start EARLY! 1. (10 + 10 + 20 = 40 points ) Exercise 1 (all three parts) in Chapter 6. Note: If you get confused by the language in part (c) that talks about running time be- ing independent of the weight values recall that the running time for the weighted interval scheduling algorithm we saw in class also has running time independent of the magnitude of the values. Hint: For part (c), don’t directly try to apply the weighted interval scheduling problem. Instead use the same design principle as we used to come up with the dynamic program for
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.

Ask a homework question - tutors are online