CSSE 473: Session Notes - Day 21
Topics
DP for the Knapsack Problem
Outline
[10 min] Review of B+-tree insertion and removal
[40 min] Using Dynamic Programming to solve the knapsack problem
Resources
Slides
Worksheet