CSSE 473: Session Notes - Day 21

Topics

  1. DP for the Knapsack Problem

Outline

  1. [10 min] Review of B+-tree insertion and removal
  2. [40 min] Using Dynamic Programming to solve the knapsack problem

Resources