CPSC 221H-200: Data Structures & Algorithms
Homework Assignment #4
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 February 19, 2009 at the beginning of class

1. Problem R-7.6 in the text (p. 357). (30 points)

2. Problem R-7.11 in the text (p. 358). You must justify your answers, either by providing an example heap or proving that none exists. (35 points)

3. Problem C-7.14 in the text (p. 360). In addition to what is specified in the question, carefully analyze the running time and space used by your algorithm. (35 points)

Bonus Problems

Due by Thursday March 5, 2009

These problems can be done for extra credit. Points for bonus problems will be tabulated separately, and will be considered separately at the end of the semester. They should be turned in separately from your regular assignment. They will be accepted upto two weeks past the due date of the assignment.

• Bonus Problem 1: Problem C-7.13 in the text (p. 360). (10 points)