Lectures

Lectures will in person, and they will be recorded. Notes were generated using Notability. Recordings will be made available (through ELMS-Panopto) later in the day. You will need to be logged into the campus VPN to access them. If anything seems to be missing from this page or any links are broken, please send me a reminder. (I often forget to post materials.)

Date	Lecture	Title	Notes
Tue 01/28	01	Introduction to Algorithm Design (Lecture Recording)	PDF Notability
Thu 01/30	02	Graph Basics and Depth-First Search (Lecture Recording)	PDF Notability
Tue 02/04	03	Cycles and Strong Components (Lecture Recording)	PDF Notability
Thu 02/06 Tue 02/11	04	Shortest Paths: Dijkstra and Bellman-Ford (2/6: Lecture Recording - Screen not captured, sorry!) (2/11: Lecture Recording)	PDF Notability
Thu 02/13	05	Greedy Algorithms for Scheduling (Lecture Recording)	PDF Notability
Tue 02/18 Thu 02/20	06	k-Center Clustering and Gonzalez's Algorithm (2/18: Lecture Recording) (2/20: Lecture Recording)	PDF Notability
Tue 02/25	07	Greedy Approximation: Set Cover (Lecture Recording)	PDF Notability
Thu 02/27	08	DP: Weighted Interval Scheduling (Lecture Recording)	PDF Notability
Tue 03/04	09	DP: Longest Common Subsequence and Edit Distance (Lecture Recording)	PDF Notability
Thu 03/06 Tue 03/11	10	DP: Chain Matrix Multiplication (3/6: Lecture Recording) (3/11: Lecture Recording)	PDF Notability
Thu 03/13	11	DP: All-Pairs Shortest Paths and Floyd-Warshall (Lecture Recording)	PDF Notability
Tue 03/25	12	Network Flow: Basic Concepts (Lecture Recording)	PDF Notability
Thu 03/27	13	Network Flow: Algorithms (Lecture Recording)	PDF (Preliminary) Notability (Prelim)
Tue 04/01		Midterm Review (Lecture Recording)

Web Accessibility

Navigation

Lectures