HW5 CMSC641 Fall '94,                         Nov. 21, 1994

Due date: Dec. 7, 1994 

(15) Exercise 32.2-3 (p. 791).
(15) Exercise 33.5-1 (p. 826).
(35) Problem 23.2 (biconnectivity) (p. 495).
(35) Problem 25.2 (nesting boxes) (p. 546).

Reading Material: Ch23 (Elementary Graph Algorithms), Ch25 (SSSPs),
Ch32 (Polys and FFTs), Ch33 (Number-Theoretic Alogorithms) from the 
text book.