Created: Tue 29 Sep 2009
Last modified: 
Assigned:
Wed 30 Sep 2009
Due:
Wed 07 Oct 2009
Instructions
- Please review the course syllabus and make sure that you understand the course policies for grading, late homework, and academic honesty.
 
- On the first page of your solution write-up, 
    you must make explicit which problems are to be graded for 
    "regular credit", which problems are to be graded for "extra credit",
    and which problems you did not attempt.
    Please use a table something like the following
    
     
    | Problem | 01 | 02 | 03 | 04 | 05 | 06 | 07 | 08 | 09 | ... | 
|---|
 | Credit | RC | RC | RC | EC | RC | RC | NA | RC | RC | ... | 
|---|
 
 
    where "RC" is "regular credit", "EC" is "extra credit", and "NA"
    is "not applicable" (not attempted).  Failure to do so will result
    in an arbitrary set of problems being graded for regular
    credit, no problems being graded for extra credit, and a five percent
    penalty assessment.
 
 
- You must also write down with whom you worked on the assignment.  If this
    changes from problem to problem, then you should write down this 
    information separately with each problem.
Problems
Required: Do any 5 of the following 6 problems.
Points: Problems are worh 20 point each.
 Unless otherwise indicated, problems are from Algorithms by Dasgupta, Papadimitriou, and Vazirani.
- Problem 2.14
- Problem 2.17
- Problem 2.18
- Problem 2.20
- Problem 2.22
- Problem 2.23
Switch to:
Harriet Fell 
College of Computer Science, Northeastern University 
360 Huntington Avenue #340 WVH,  
Boston, MA 02115     
 
Email:  fell@ccs.neu.edu  
                     
Phone: (617) 373-2198 / Fax:   (617) 373-5121 
The URL for this document is:
http://www.ccs.neu.edu/home/fell/CS4800/F09/Homework/hw.04.html
