|
Below are links to the lecture slides. Once the lecture moves above the "Lectures below have not yet been updated for Spring 2014" part of the table, no significant changes will be made.
| # | DATE | TOPIC | SLIDES | READINGS | STUDY | DEMOS |
|---|---|---|---|---|---|---|
| 1 | 2/3 | Intro · Union Find | 1up · 4up | 1.5 | guide | Quick-find · Quick-union · Weighted |
| 2 | 2/5 | Analysis of Algorithms | 1up · 4up | 1.4 | guide | Binary search |
| 3 | 2/10 | Stacks and Queues | 1up · 4up | 1.3 | guide | Dijkstra 2-stack |
| 4 | 2/12 | Elementary Sorts | 1up · 4up | 2.1 | guide | Selection · Insertion · h-sorting · Shuffle |
| 5 | 2/17 | Mergesort | 1up · 4up | 2.2 | guide | Merging |
| 6 | 2/19 | Quicksort | 1up · 4up | 2.3 | guide | Partitioning · Quick-select |
| 7 | 2/24 | Priority Queues | 1up · 4up | 2.4 | guide | Heap · Heapsort |
| 8 | 2/26 | Elementary Symbol Tables · BSTs | 1up · 4up | 3.1–3.2 | guide | BST |
| 9 | 3/3 | Balanced Search Trees | 1up · 4up | 3.3 | guide | 2-3 tree · Red-black BST |
| 10 | 3/5 | Hash Tables · Symbol Table Applications | 1up · 4up | 3.4–3.5 | guide | Linear probing |
| 11 | 3/10 | Geometric Applications of BSTs | 1up · 4up | – | guide | Kd tree · Interval search tree |
| 12 | 3/12 | Midterm Exam | ||||
| 13 | 3/24 | Undirected Graphs | 1up · 4up | 4.1 | guide | DFS · BFS · Connected components |
| 14 | 3/26 | Directed Graphs | 1up · 4up | 4.2 | guide | DFS · Topological sort · Kosaraju-Sharir |
| 15 | 3/31 | Minimum Spanning Trees | 1up · 4up | 4.3 | guide | Greedy · Kruskal · Prim |
| 16 | 4/2 | Shortest Paths | 1up · 4up | 4.4 | guide | Dijkstra · Acyclic · Bellman-Ford |
| 17 | 4/7 | Maximum Flow | 1up · 4up | 6.4 | guide | Ford-Fulkerson |
| 18 | 4/9 | String Sorts | 1up · 4up | 5.1 | guide | Key-indexed counting |
| 19 | 4/14 | Tries | 1up · 4up | 5.2 | guide | Trie · TST |
| 20 | 4/16 | Data Compression | 1up · 4up | 5.5 | guide | Huffman · LZW |
| 21 | 4/21 | Substring Search | 1up · 4up | 5.3 | guide | KMP |
| 22 | 4/23 | Regular Expressions | 1up · 4up | 5.4 | guide | NFA simulation · NFA construction |
| 23 | 4/28 | Reductions | 1up · 4up | 6.5 | ||
| 24 | 4/30 | Algorithmic Interview Questions | no slides | – |
Readings. All readings refer to Algorithms, 4th edition by R. Sedgewick and K. Wayne unless otherwise specified.
Study guide. Associated with each lecture is a study guide, which summarizes the most important topics and ideas from the lecture. It also includes optional (and ungraded) exercises.
Advice. In general, slides are intended for the lecture presentations and do not provide thorough descriptions of the material alone; for reference, read the indicated sections from Algorithms, 4th edition. An effective strategy is to skim the textbook before the lecture, read it thoroughly soon afterwards, complete the Blackboard exercises (and perhaps some additional B-level exercises from the study guide).
Online viewing and printing. These lecture slides are suitable for online viewing (one per page) or printing (four per page). The Quicktime movies are designed to be manually advanced. Unfortunately, Quicktime on Mavericks no longer supports interactive Quicktime movies; we recommend using Quicktime 7 instead.
Errata. Here is a list of known errors in the lecture slides and textbook.
