CMSC 441, Fall 1996

Homework Assignments

The following homework problems have been assigned for both sections of CMSC441.

Homework 1, Due Thursday September 12.

Problem 2-2, page 38. Briefly justify your answers for each case. For part d, provide a full proof.
Exercise 3.2-2, page 52.
Exercise 1.3-7. page 16.

Homework 2, Due Thursday September 19.

Problem 4-1, page 72. In the cases where you use the Master Theorem, clearly state which case you are using and the asymptotic bounds on T(n).
Exercise 4.4-2, page 72. Consider only the special case where T(n) = 4 T(n/2) + n^2 log n. Here, f(n) is Theta(n^(log_b a) log n). Show that the solution to the recurrence relation is T(n) = Theta(n^2 log^2 n).
Optional Assignment: do the general case.
Problem 8-3, page 169.

Homework 3, Due Thursday September 26.

Exercise 7.3-3, page 147. Consider only the special case where the heap is a complete binary tree (i.e., n is of the form 2^k - 1 for some integer k).
Optional Assignment: do the general case.
Problem 8-4, page 169.
Exercise 9.3-4, page 180.

Homework 4, Due Thursday October 10.

Exercise 7.5-5, page 151.
Exercise 10.3-5, page 192.
Exercise 10.3-8, page 192.

Homework 5, Due Thursday October 17.

Exercise 10.3-7, page 192.
Problem 11-2, page 217.
Exercise 12.3-3, page 232.

Homework 6, Due Thursday October 24.

Problem 12-1, page 241.
Exercise 14.1-3, page 265.
Exercise 14.2-5, page 267.

Homework 7, Due Thursday October 31.

Exercise 16.4-2, page 324.
Problem 16-2, page 325.
Problem 16-5, page 327.

Homework 8, Due Thursday November 7.

Problem 16-4, page 326.
Exercise 22.3-3, page 450.
Exercise 23.1-6, page 468.

Homework 9, Due Thursday November 21.

Exercise 23.2-6, page 476.
Exercise 23.3-4, page 484.
Exercise 23.4-5, page 488.

Homework 10, Due Thursday December 5.

Exercise 23.5-3, page 494.
Exercise 24.2-1, page 510.
Exercise 25.2-5, page 532.

Last Modified: Mon Nov 4 14:30:38 EST 1996

Richard Chang, chang@gl.umbc.edu