Content covered: 

0/1 Knapsack Problem Dynamic Programming