CS6363: Computer Algorithms
Spring 2008
Assignment 5

Due: Wednesday, March 5 (in class)

1. Problem 2-2 (page 38).  Correctness of bubblesort.

2. Problem 2-3 (page 39), parts c and d only. 
   (Polynomial evaluation using Horner's rule)

3. For the activity selection problem in Section 16.1 of the book,
   the following recursive formulation is proposed in page 373:

   c(i,j) = max_{i<k<j} {c(i,k) + c(k,j) + 1}

   with the base case c(i,j)=0 when S_{ij} is empty.

   Prove that this recursive formulation correctly defines
   the maximum cardinality of a mutually compatible set of
   activities in S_{ij}.