6.006 | Fall 2011 | Undergraduate

Introduction to Algorithms

Recitation Videos

Recitation 21: Dynamic Programming: Knapsack Problem

Description: This recitation discusses the knapsack problem and polynomial time vs. pseudo-polynomial time.

Instructor: Victor Costan

Course Info

Learning Resource Types
Lecture Videos
Recitation Videos
Problem Sets with Solutions
Exams with Solutions
Programming Assignments with Examples
Lecture Notes