This page is archived

Lecture notes for Fall 2008: Design and Analysis of Algorithms, 22C:231:001

Although I don't have lecture notes that I can post for much of this course, I do have them for some fragments.

• Weighted Interval Scheduling, our first dynamic programming example.
• Weighted Interval Scheduling, followed by Segmented least squares. There are 2 typos on the last page -- 0 must be replaced by i - 1 in the final assignment. Also i ranges from 1 to j (and not j-1) in the minimization.
• The Knapsack Problem.
• RNA Secondary structure.