CSc 445: Homework Assignment 5
Assigned: Wednesday March 31 2008,
Due: 10:30 AM, Monday April 14 2008
Clear, neat and concise solutions are required in order to receive full credit. Revise your work carefully before
submission, and consider how your work is presented. If you cannot solve a particular problem, state this
clearly in your writeup, and write down only what you know to be correct. For involved proofs, first outline
the argument and then delve into the details.
——————————————————————————————————–
For all dynamic programming problems follow the 4step procedure described in class (and
don’t forget to write the pseudocode for your algorithm and analyze its running time):
1. Optimal substructure;
2. Recursive formula that characterizes the optimal solution in terms of optimal solutions
to smaller problems;
3. Computing the optimal costs (describing the table that you’ll use and how you’re going
to fill it up (e.g., row major order, diagonal order, etc.);
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '08
 Kobourov
 Algorithms, Dynamic Programming, dynamic programming algorithm, Appalachian Trail Committee, efficient dynamic programming

Click to edit the document details