CS6363: Computer Algorithms
Spring 2008
Assignment 6

Due: Monday, March 17 (in class)


1. Ex. 22.3-2 (page 547).  DFS on an example.

2. Ex. 22.3-11 (page 549).  DFS and connected components.

3. Problem 22-2 (pages 558-559). 
   Finding bridges, articulation points and biconnected components.

4. Problem 16-2, part a only (page 402).  Minimize average completion time.

5. Consider the activity selection problem (from Ch. 16), where we
   modify the objective from maximizing the size of the compatible
   subset chosen to maximizing the utilization of the resource
   (i.e., if a_i is selected to use the resource, it uses the
   resource for f_i-s_i units of time;  our goal is to find a 
   subset of compatible activities, not necessarily of maximum
   cardinality, that maximizes the total time the resource is
   being used).  Show that the greedy algorithm in Sec. 16.1
   fails to find an optimal solution.  Design an efficient
   algorithm to solve this new version of the problem.
   Explain its correctness and analyze its running time.