Lecture In-Class Questions and Notes
Lecture 1 (8/27/02) Questions - Recursive Divide-and-Conquer Fibonacci and Dynamic Programming Fibonacci; Recursion tree, writing recurrence relations
Lecture 2 (8/29/02) Questions - Memoization of fibonacci, Dynamic programming of binomial coefficient
Lecture 3 (9/3/02) - Coin-change problem as greedy, divide-and-conquer, dynamic programming, backtracking, and branch-and-bound.
Lecture 3 (9/3/02) Questions - Coin-change problem as dynamic programming
Lecture 6 (9-12-02)_Questions - Algorithm analysis
Lecture 8 (9-19-02)_Questions - Solving recurrence relations
Lecture 12 (10-3-02) Questions - Dijkstra's Algorithm for all-pairs shortest path
Lecture 16 (10-17-02) Questions - Backtracking