Section outline
-
-
-
Students mustMark as done
Lab Task
-
- Introduction to Dynamic Programming (DP)
- Discussion on Fibonacci Numbers Problem
- Discussion on Coin Change Problem (DP)
- Discussion on Knapsack Problem (0/1)
- Solve the Coin Change Problem based on DP
- Solve the Knapsack Problem based on DP
- Solve the Fibonacci Numbers Problem based on DP
- Exercise the Bin-packing Algorithm with some additional problems in the Lab.
Week plan |
Topics |
Materials
|
|---|---|---|
Week-06: Lecture-11 |
Dynamic Programming:
|
DP Introduction and Fibonacci SeriesDP: Coin Change
|
Week-06: Lecture-12 |
DP: 0/1 Knapsack
|
|
Week-06: Lab - 0 6 |
Implementation of Greedy Approaches
Coin Change
Bin Packing
Fractional Knapsack |
|