CPSC 221H: Data Structures & Algorithms
Homework Assignment #11
Spring 2009

General Guidelines for Homework

• Be clear and precise. Write neatly and legibly. Justify all answers, even if not specified in the question. Use good judgement concerning how detailed to make your answer.
• If the question is not fully specified, you may need to make some assumptions. In this case, you must state any assumptions you make, and justify why they are reasonable.
• Everyone must turn in their own copy of the assignment. You may consult outside material or work with others (this is encouraged), but you must reference your sources (people, books, webpages, etc.). These must be listed on the cover sheet mentioned below.
• All assignments in this course must include a completed and signed coverpage available on the course homepage. Any assignment turned in without a fully completed and signed coverpage will receive ZERO POINTS.

Assigned Problems

Due: Thursday April 30, 2009

1. Problem R-12.5 in the text (p. 647). Draw the graph representing this problem and show your answer on this graph. Describe which graph algorithm you would use to solve this problem, and its computational complexity. (25 points)

2. Problem R-12.13 in the text (p. 649). (25 points)

3. Problem R-12.15 in the text (p. 649). (25 points)

4. Problem R-12.16 in the text (p. 649). (25 points)

Bonus Problems

No bonus problems this week.