CS6363: Computer Algorithms
Spring 2008
Assignment 1

Due: Wednesday, January 16 (in class)
Exercises and page numbers are from the second edition of the text.

1. Ex. 4.2-2 (page 72)  [1st ed: Ex. 4.2-2, p. 60].
   Recursion tree method to get lower bound: T(n)=T(n/3)+T(2n/3)+n.

2. Ex. 4.3-3 (page 75)  [1st ed: Ex. 4.3-3, p.64].
   Recurrence for binary search.

3. Ex. A.2-4 (page 1069)  [1st ed: Ex. 3.2-4, p.52].
   Approximate \Sigma_{k=1}^n k^3  with an integral.

4. Solve the recurrences in Problem 4-1 (page 85) using the master method,
   if it applies.  If the master method does not apply, solve it using
   one of the other methods discussed in class.  [1st ed: Prob 4-1, p. 72].