Lecture 11

Learning objectives

After this class, you should be able to:

1. Given input to the rod cutting problem, show the steps taken by the inefficient and efficient algorithms for this problem.
2. Analyze the time complexity of the above algorithms.
3. Given a similar problem, give an algorithm, based on dynamic programming, to solve it, and analyze its time complexity.

Reading assignment

1. Lectures 11-13 slides.
2. CLR: Section 15.1.
3. CLR: page 387.
4. CLR: Chapter 15, page 391.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 15.1-1.
  2. Exercise 15.1-2. (Post your solution on the discussion board)
  3. Exercise 15.1-3.
  4. Exercise 15.1-5.

• Questions on next lecture's material
  1. (Post your solution on the discussion board) Give examples of two sequences of at least four elements each, and identify their longest common subsequence.
  2. Give an efficient algorithm for computing the n th term of a Fibonacci sequence using memoization.