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

Spring 2006

Problem Set #7

Due Time:

At the start of class on Thursday, 5/25/2006.

Required Problems:

  1. (20 points) Exercise 19.1-3.
  2. (20 points) Exercise 19.2-6.
  3. (20 points) Exercise 21.3-3.
  4. (20 points) Exercise 21.4-1.
  5. (20 points) Exercise 21.4-4.

Extra-Credit Problems:

  1. (15 points) Modify the binomial heap data structure so that it can also support find-maximum and delete-maximum in O(log n) time.

Hint: Use two binomial heaps to with opposite orderings for keys.