Set of lecture videos for the "Analysis & Design of Algorithms" course as taught in 2021 CHP - FCIS - Ain Shams Univ.
This video gives more examples on the dynamic programming (DP) paradigm to stress on the design idea and how to apply it (namely rod cutting (continue from prev lec), longest common subsequence (LCS) & 0/1 knapsack).
0:00 Recap, Goal, Pretest & Agenda
11:52 Possible subproblems for strings/sequences
15:58 Rod Cutting (recap)
24:42 Rod Cutting (extract solution)
32:02 Rod Cutting (trace example)
45:20 LCS (description, apps & brute force sol)
59:57 LCS (design steps & analysis)
1:31:25 LCS (trace example)
1:38:42 0/1 Knapsack (description, design steps)
1:58:58 0/1 Knapsack (memoization vs building table)
