UMBC CMSC441, Design and Analysis of Algorithms, Spring 1996 Section 0201

Old News

• Homework 5: Exercise 10.3-8, Exercise 12.3-4 and Exercise 14.3-3. (Due: March 14, 1996.)

• Homework 4: Exercise 9.2-5, Exercise 10.3-6 and Problem 10-1. (Due 3/7/96.)

• Homeowrk 3 note: To make Exercies 7.3-3 easier, you may assume that the heap is a full binary tree.

• Homework 3: Exercise 7.3-3, Exercise 7.5-5, Problem 8-3. (Due 2/22/96.)

• Homework 2: Exercise 4.1-1 Problem 4-1 parts a, c, d, e & h. (Due 2/15/96.)

• Hints for Homework 1.

• Homework 1: Problem 1-1, Problem 2-2, and Problem 2-4 parts a, e & h. (Due 2/8/96.) (Note: the textbook has both exercises and problems. Problems are at the end of the chapters.)