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
Instructors
Departments
As Taught In
Fall
2011
Level
Learning Resource Types
theaters
Lecture Videos
theaters
Recitation Videos
assignment_turned_in
Problem Sets with Solutions
grading
Exams with Solutions
assignment_turned_in
Programming Assignments with Examples
notes
Lecture Notes