HW1 CMSC641 Fall '94,                 Sept. 12, 1994

Due date:Sept. 21, 1994 

(20) Exercise 3.2-1 from the text book (p. 52).
(40) Exercise 4.4-2 from the text book (p. 72).
(20) Problem 4.1 f), g) (p. 72).
(20) Solve the following recurrence exactly using the method of
      Characteristic Equations:
      \[ T(n) =  3T(n-1) + 2^{n + \lg n} + 2^{2n}n   \]
       subject to $T(0)=0$. 


Reading Material: Ch3, Ch4 from the text book and Section 2.3 (on
 solving recurrences using the characteristic equation) from
 the book ``Algorithmics: Theory and Practice'' by Brassard, Gilles and
 Paul, Bratley.