COP 4531: Lecture 16

Learning objectives

After this class, you should be able to:

1. Given a sequence of matrices, find an optimal parenthesization, using dynamic programming.
2. Analyze the time complexity of the above algorithm.
3. Given a similar problem, give an algorithm, based on dynamic programming, to solve it, and analyze its time complexity.

Reading assignment

1. CLR: Section 15.2.
2. CLR: page 347.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 15.2-1.
  2. Exercise 15.2-3.

• Questions on next lecture's material
  1. Give an efficient algorithm for computing the n th term of a Fibonacci sequence using memoization.