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

Spring 2006

Problem Set #3

Due Time:

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

Required Problems:

  1. (20 points) Exercise 15.1-2.
  2. (20 points) Exercise 15.1-3.
  3. (20 points) Give a minimum-cost parenthesization of a matrix-chain product whose sequence of dimensions is <5, 11, 3, 12, 10, 50, 6>. Also give a maximum-cost parenthesization for the same dimension sequence. What is the ratio of the maximum cost over the minimum cost for this dimension sequence?
  4. (20 points) Exercise 15.4-5.
  5. (20 points) Problem 15-7.

Extra-Credit Problems:

  1. (15 points) Exercise 15.4-6.