Computer Science 373 – Analysis of Algorithms Prof. Steven Skiena Spring 2011 Homework 5 – Dynamic Programming and Intractability Due Thursday May 12, 2011 Each of the problems should be solved on a separate sheet of paper to facilitate grading. Limit the solution of each problem to one sheet of paper. Please don’t wait until the last minute to look at the problems. All numbered problems come from the second edition of The Algorithm Design Manual , by Skiena. Interested students may attempt the extra credit programming challenges problems de-scribed at the end of the relevant chapters for a small amount of additional points – small enough that you should be motivated primarily by interest and not greed.
This is the end of the preview. Sign up
access the rest of the document.
This note was uploaded on 06/05/2011 for the course CSE 373 taught by Professor Hart,g during the Spring '08 term at SUNY Stony Brook.