CMSC 441, Spring 1997
Homework Assignments
The following homework problems have been assigned for both sections of CMSC441.
Homework 1, Due Thursday February 6.
- Exercise 1.3-7, page 16.
- Problem 2-2, page 38.
Briefly justify your answers for each case.
For part d, provide a full proof.
- Problem 2-4, parts a, b and e, page 39.
Homework 2, Due Thursday February 13.
- 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).
- Problem 4-2, page 73.
- Problem 8-3, page 169.
Homework 3, Due Thursday February 20.
- Exercise 7.3-3, page 147.
If you cannot solve the general case, work on
the special case where the heap is a full binary tree
(i.e., n is of the form 2^k - 1 for some integer k).
- Problem 7-1, page 152.
- Problem 8-4, page 169.
Homework 4, Due Thursday March 6.
- Exercise 9.2-2, page 177.
- Exercise 9.3-4, page 180.
- Problem 9-2, page 184.
Homework 5, Due Thursday March 13.
- Exercise 10.3-1, page 191.
- Exercise 10.3-7, page 192.
- Exercise 12.3-2, page 232.
Homework 6, Due March February 20.
- Exercise 14.3-3, page 272.
- Problem 14-1, page 278.
- Problem 16-2, page 325.
Your project will be based upon this problem.
Homework 7, Due April 3.
- Exercise 16.3-3, page 319.
- Exercise 16.3-5, page 319.
- Problem 16-3, page 325.
Homework 8, Due Thursday April 17.
- Exercise 22.1-3, page 443.
- Exercise 23.2-6, page 476.
- Problem 23-1, page 495.
Homework 9, Due Thursday April 24.
- Exercise 23.4-2, page 487.
- Exercise 23.5-4, page 494.
- Problem 23-3, page 496.
Homework 10, Due Thursday May 1.
- Problem 24-1, page 511.
- Exercise 25.2-2, page 531.
- Exercise 25.3-6 page 536.
Last Modified:
Monday, April 7, 1997
Richard Chang, chang@gl.umbc.edu