CS 336: Design and Analysis of Algorithms
Department of Electrical Engineering and Computer Science
Northwestern University

Spring 2006

Problem Set #2

Due Time:

At the start of class on Thursday, 4/20/2006.

Required Problems:

  1. (20 points) Problem 7-2. Work out the details of d and e.
  2. (20 points) Problem 8-5.
  3. (20 points) Exercise 9.3-4. (Hint: Construct a graph of which the nodes are the elements and the edges record the results of comparisons.)
  4. (20 points) Exercise 9.3-5.
  5. (20 points) Problem 9-1.

Extra-Credit Problems:

  1. (15 points) Problem 9-3.