Design and Analysis of Algorithms - Fall 05 - Homework 5

General Information

• All homework assignments are due at the beginning of class on the assigned due date.

• Assignments may be left in my mail box in the computer science department main office or may be submitted via emailed.

• Late assignments will be penalized by a 20% reduction in grade per day.

• Emailed assignments must be PDF documents.

Homework Assignment #5 - Due November 10th, 2005

1. R-5.1 - Fractional knapsack (p. 282)
2. R-5.3 - Task scheduling (p. 282)
3. R-5.4 - Master method (p. 282)
4. R-5.5 - Divide-and -conquer (p. 282)
5. R-5.12 - Internet auction (p. 282)
6. C-5.1 - Cross the desert with bottle for water (p. 283)
7. C-5.6 - Divide-and-conquer (p. 283)
8. C-5.9 - 0-1 knapsack that returns assignment (p. 283)
9. C-5.11 - Minimum-weight triangulation (p. 284)