Lecture 1 | Sept 27 | Introduction and Stable Matching | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 2 (Beihang) | Sept 27 | Stable Matching | Anderson | PPT | CSD | Slides with Ink | |||
Lecture 2 | Sept 29 | Stable Matching | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 3 | Oct 2 | Algorithm Efficiency | Anderson | PPT | CSD | Slides with Ink | Activity Summary | Lecture Summary | |
Lecture 4 | Oct 4 | Intro to Graph Theory | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 5 | Oct 6 | Graph Theory | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 6 | Oct 9 | Greedy Algorithms | Anderson | PPT | CSD | Slides with Ink | Activity Summary | Lecture Summary | |
Lecture 7 | Oct 11 | Greedy Algorithms | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 8 | Oct 13 | Dijkstra's Algorithm | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 9 | Oct 16 | Minimum Spanning Tree | Anderson | PPT | CSD | Slides with Ink | Activity Summary | Lecture Summary | |
Lecture 10 | Oct 18 | Minimum Spanning Tree | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 11 | Oct 20 | Recurrences | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 12 | Oct 23 | Recurrences | Anderson | PPT | CSD | Slides with Ink | Activity Summary | Lecture Summary | |
Lecture 13 | Oct 25 | Divide and Conquer | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 14 | Oct 27 | Divide and Conquer | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 15 | Oct 30 | Fast Fourier Transform | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 16 | Nov 1 | Dynamic Programming | Anderson | PPT | CSD | Slides with Ink | Activity Summary | ||
Lecture 16a (Beihang) | Nov 16 | Dynamic Programming | Anderson | PPT | Ink (sec1) Ink (sec2) Ink (sec3) |
||||
Lecture 17 | Nov 6 | Subset Sum | Anderson | PPT | CSD | Slides with Ink | |||
Lecture 18 | Nov 8 | Dynamic Programming | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 19 | Nov 13 | Longest Common Subsequence | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 20 | Nov 15 | Memory Efficient Longest Common Subsequence | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 21 (Beihang) | Nov 20 | Shortest Paths | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 22 | Nov 20 | Network Flow | Anderson | PPT | CSD | Slides with Ink | Activity Summary | Lecture Summary | |
Lecture 23 | Nov 22 | Network Flow | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 24 | Nov 27 | Applications of Network Flow | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 25 | Nov 29 | Applications of Network Flow | Anderson | PPT | CSD | Slides with Ink | Activity Summary | Lecture Summary | |
Lecture 26 | Dec 1 | Applications of Network Flow | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 27 | Dec 4 | NP-Completeness | Anderson | PPT | CSD | Slides with Ink | Lecture Summary | ||
Lecture 28 | Dec 6 | NP-Completeness | Anderson | PPT | CSD | Slides with Ink | Activity Summary | Lecture Summary | |
Lecture 29 | Dec 8 | NP-Completeness | Anderson | PPT | CSD | Slides with Ink | Lecture Summary |