LECTURES

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

Explanations on how to effectively use this table, the lecture, and the textbook can be found below the table.

#	DATE	TOPIC	SLIDES	READINGS	STUDY	DEMOS
1	2/1	Intro · Union Find	1up · 4up	1.5		Quick-union · Union-by-size
2	2/3	Analysis of Algorithms	1up · 4up	1.4	guide	Binary search
3	2/8	Stacks and Queues	1up · 4up	1.3	guide	Dijkstra 2-stack
4	2/10	Elementary Sorts	1up · 4up	2.1	guide	Selection · Insertion · Shuffle
5	2/15	Mergesort	1up · 4up	2.2	guide	Merging
6	2/17	Quicksort	1up · 4up	2.3	guide	Partitioning · Quick-select
7	2/22	Priority Queues	1up · 4up	2.4	guide	Heap · Heapsort
8	2/24	Elementary Symbol Tables · BSTs	1up · 4up	3.1–3.2	guide	BST ops · Inorder traversal
9	2/29	Balanced Search Trees	1up · 4up	3.3	guide	2–3 tree · Red–black BST
10	3/2	Hash Tables	1up · 4up	3.4	guide	Linear probing
11	3/7	Geometric Applications of BSTs	1up · 4up	–	guide	Kd tree
12	3/9	Midterm Exam
13	3/21	Undirected Graphs	1up · 4up	4.1	guide	DFS · BFS
Below this line, lecture slides may have significant differences from the online/flipped lectures, but cover the same material. For slides that follow the videos, see the flipped page.
14	3/23	Directed Graphs	1up · 4up	4.2	guide	DFS · Topological sort · Kosaraju–Sharir
15	3/28	Minimum Spanning Trees	1up · 4up	4.3	guide	Greedy · Kruskal · Prim
16	3/30	Shortest Paths	1up · 4up	4.4	guide	Dijkstra · Acyclic · Bellman–Ford
17	4/4	Maximum Flow	1up · 4up	6.4	guide	Ford–Fulkerson
18	4/6	String Sorts	1up · 4up	5.1	guide	Key-indexed counting
19	4/11	Tries	1up · 4up	5.2	guide	Trie · TST
20	4/13	Data Compression	1up · 4up	5.5	guide	Huffman · LZW
21	4/18	Substring Search	1up · 4up	5.3	guide	KMP
22	4/20	Regular Expressions	1up · 4up	5.4	guide	NFA simulation · NFA construction
23	4/25	Reductions	1up · 4up	6.5
Lectures below have not yet been updated for Spring 2016
24	4/27	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 OS X no longer supports interactive Quicktime movies; we recommend using Quicktime 7 instead.

iClicker policy. Using an iClicker during lecture counts towards the participation component of your course grade. Using a classmate's iClicker during lecture or allowing someone else to use your iClicker during lecture is prohibited.

Errata. Here is a list of known errors in the lecture slides and textbook.