Topics of discussion
- Introduction to Dynamic Programming (DP)
- Discussion on longest Common Subsequence and Edit Distance Problem
- Discussion on longest Increasing Subsequence (DP)
Expected Learning Outcome
- Solve the Longest Common Subsequence (LCS) Problem based on DP
- Solve the Longest Increasing Subsequence (LIS)
- Exercise the Bin-packing, LCS, LIS Algorithm with some additional problems in the Lab.