This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 573 Homework 2 (due September 27, 2010) Fall 2010 CS 573: Graduate Algorithms, Fall 2010 Homework 2 Due Monday, September 27, 2010 at 5pm (in the homework drop boxes in the basement of Siebel) • For this and all future homeworks, groups of up to three students may submit a single, common solution. Please neatly print (or typeset) the full name and NetID of every group member on the first page of your submission. • We will use the following rubric to grade all dynamic programming algorithms: – 60% for a correct recurrence (including base cases and a plain-English specification); no credit for anything else if this is wrong. – 10% for describing a suitable memoization data structure. – 20% for describing a correct evaluation order. (A clear picture is sufficient.) – 10% point for analyzing the running time of the resulting algorithm. Official solutions will always include pseudocode for the final dynamic programming algorithm, but this is not required for full credit. However, if you do provide correct pseudocode for the dynamic programming algorithm, it is not necessary to separately describe the recurrence, the memoization data structure, or the evaluation order....
View Full Document
This note was uploaded on 01/22/2012 for the course CS 573 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.
- Fall '08