Computer Science 314
Topic: Dynamic Programming
Related Reading: Ch. 15
Due: Monday, 24 September 2012, by appointment
This homework will be judged based on an oral presentation of solutions. Please read our guidelines for oral presentation homeworks for an overview of the process.
For this assignment, you may work in pairs.
Please make sure you adhere to the policies on academic integrity in this regard.
Presentations will be made on Monday, 24 September 2012, by appointment . Each group will be given a 30 minute time slot. A signup sheet will be distributed on Wednesday, 19 September 2012, in class .
The topic for this homework is dynamic programming. As an interesting source of problems in need of algorithmic solutions, we rely on some problems used in past programming competitions such as the ICPC Programming Contest. Although the problem descriptions are written for the contests, you are not to present actual implementations for those problems. Instead, you are to develop and present a high-level formulation of the stated problem and to describe an algorithmic solution (and analysis) using dynamic programming. In presenting your solutions, you should closely follow the following outline:
Lawrence of Arabia, from the 2008 Rocky Mountain regionals (local copy)
Adventures in Moving from a local Canadian qualifier (local copy)
RIPOFF, from the 2009 Mid-Central regionals