LECTURES

Below are links to the lecture slides. Once the lecture moves above the "Lectures below have not yet been updated for Fall 2014" part of the table, no significant changes will be made.

#	DATE	TOPIC	SLIDES	READINGS	STUDY	DEMOS
1	9/11	Intro · Union Find	1up · 4up	1.5	guide	Quick-find · Quick-union · Weighted
2	9/16	Analysis of Algorithms	1up · 4up	1.4	guide	Binary search
3	9/18	Stacks and Queues	1up · 4up	1.3	guide	Dijkstra 2-stack
4	9/23	Elementary Sorts	1up · 4up	2.1	guide	Selection · Insertion · h-sorting · Shuffle
5	9/25	Mergesort	1up · 4up	2.2	guide	Merging
6	9/30	Quicksort	1up · 4up	2.3	guide	Partitioning · Quick-select
7	10/2	Priority Queues	1up · 4up	2.4	guide	Heap · Heapsort
8	10/7	Elementary Symbol Tables · BSTs	1up · 4up	3.1–3.2	guide	BST
9	10/9	Geometric Applications of BSTs	1up · 4up	–	guide	Kd tree · Interval search tree
10	10/14	Balanced Search Trees	1up · 4up	3.3	guide	2-3 tree · Red-black BST
11	10/16	Hash Tables · Symbol Table Applications	1up · 4up	3.4–3.5	guide	Linear probing
12	10/21	Midterm Exam
13	10/23	Undirected Graphs	1up · 4up	4.1	guide	DFS · BFS · Connected components
14	11/4	Directed Graphs	1up · 4up	4.2	guide	DFS · Topological sort · Kosaraju-Sharir
15	11/6	Minimum Spanning Trees	1up · 4up	4.3	guide	Greedy · Kruskal · Prim
16	11/11	Shortest Paths	1up · 4up	4.4	guide	Dijkstra · Acyclic · Bellman-Ford
17	11/13	Maximum Flow	1up · 4up	6.4	guide	Ford-Fulkerson
18	11/18	String Sorts	1up · 4up	5.1	guide	Key-indexed counting
19	11/20	Tries	1up · 4up	5.2	guide	Trie · TST
20	11/25	Substring Search	1up · 4up	5.3	guide	KMP
21	12/2	Regular Expressions	1up · 4up	5.4	guide	NFA simulation · NFA construction
22	12/4	Data Compression	1up · 4up	5.5	guide	Huffman · LZW
23	12/9	Reductions	1up · 4up	6.5
24	12/11	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.

• C level: requires that you be able to carry out the algorithm mechanically. Similar to many of the Blackboard exercises.

• B level: requires that you really understand what is going on. The exams will have plenty of these.

• A level: requires deep comprehension, involves clever tricks, covers tangential material (or perhaps even all three).

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.