CPSC 629: Analysis of Algorithms
Homework Assignment #3

Due: Tuesday March 9, 1999 at the beginning of class

General Guidelines for Homework

• Be careful of the distinction between exercises and problems in [CLR]. Each section ends with a set of exercises, each chapter ends with a set of problems.
• Be clear and precise. Write neatly and legibly (you will lose points for sloppy and illegible handwriting). 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, texts, solutions, etc.); in particular, list all collaborators on the first page of your assignment.

Do the following problems.

1. Exercise 12.2-4 in [CLR] (p. 226).

2. Exercise 12.4-1 in [CLR] (p. 240).

3. Exercise 12.4-4 in [CLR] (p. 240).

4. Exercise 19.1-4 in [CLR] (p. 387).

5. Exercise 19.2-1 in [CLR] (p. 394); let the minimum degree of the B-tree be 3.

6. Exercise 19.2-6 in [CLR] (p. 394).

7. Exercise 20.2-7 in [CLR] (p. 417).

8. Problem 20-2 in [CLR] (p. 418).