week 1-2
Dynamic Programming: Rod Cutting, Matrix-Chain Multiplication, Elements of Dynamic Programming, Longest Common Subsequence, Optimal Binary Search Trees. [TB1: Ch. 15]
Dynamic Programming: Rod Cutting, Matrix-Chain Multiplication, Elements of Dynamic Programming, Longest Common Subsequence, Optimal Binary Search Trees. [TB1: Ch. 15]