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: 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 write-up, 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 4-step procedure described in class (and dont 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 youll use and how youre going to fill it up (e.g., row major order, diagonal order, etc.);to fill it up (e....
View Full Document
This note was uploaded on 04/08/2008 for the course CSC 445 taught by Professor Kobourov during the Spring '08 term at University of Arizona- Tucson.
- Spring '08