|
| # | DATE | TOPIC | SLIDES | READINGS | DEMOS |
|---|---|---|---|---|---|
| 1 | 9/16 | Intro · Union Find | 1up · 4up | 1.5 | – |
| 2 | 9/21 | Analysis of Algorithms | 1up · 4up | 1.4 | – |
| 3 | 9/23 | Stacks and Queues | 1up · 4up | 1.3 | – |
| 4 | 9/28 | Elementary Sorts | 1up · 4up | 2.1 | sorting animations |
| 5 | 9/30 | Mergesort | 1up · 4up | 2.2 | sorting animations |
| 6 | 10/5 | Quicksort | 1up · 4up | 2.3 | partitioning |
| 7 | 10/7 | Priority Queues | 1up · 4up | 2.4 | – |
| 8 | 10/12 | Elementary Symbol Tables · BSTs | 1up · 4up | 3.1–3.2 | GrowingTree |
| 9 | 10/14 | Balanced Search Trees | 1up · 4up | 3.3 | GrowingTree |
| 10 | 10/19 | Hash Tables | 1up · 4up | 3.4 | – |
| 11 | 10/21 | Undirected Graphs | 1up · 4up | 4.1 | DFS · BFS |
| 12 | 10/26 | Exam 1 | – | – | |
| 13 | 10/28 | Minimum Spanning Trees | 1up · 4up | 4.3 | – |
| 14 | 11/9 | Directed Graphs | 1up · 4up | 4.2 | DFS · topological sort |
| 15 | 11/11 | Shortest Paths | 1up · 4up | 4.4 | Dijkstra |
| 16 | 11/16 | Geometric Algorithms | 1up · 4up | Algs 2, Chapters 24–25 | Graham · hull · Voronoi |
| 17 | 11/18 | Geometric Search | 1up · 4up | Algs 2, Chapters 26–27 | sweep-line intersection |
| 18 | 11/23 | String Sorts | 1up · 4up | 5.1 | string sorts |
| 19 | 11/30 | Tries | 1up · 4up | 5.2 | – |
| 20 | 12/2 | Substring Search | 1up · 4up | 5.3 | substring search · DFA · KMP |
| 21 | 12/7 | Regular Expressions | 1up · 4up | 5.4 | – |
| 22 | 12/9 | Data Compression | 1up · 4up | 5.5 | – |
| 23 | 12/14 | Reductions | 1up · 4up | – | – |
| 24 | 12/16 | Combinatorial Search | 1up · 4up | – | The Longest Path [mp3] |
| Lectures below have not yet been updated for Fall 2010 | |||||
Advice.
The slides are intended for the lecture presentations;
for reference, read the indicated sections from
Algorithms, 4th edition.
An effective strategy
is to skim the textbook before the lecture, then read it thoroughly
soon afterwards.
We recommend printing the slides before lecture and
annotating them during lecture.
Online viewing and printing. These lecture slides are suitable for online viewing (one per page) or printing (four per page).
Errata. Here is a list of known errors in the lecture slides.
