CSCE 423/823 lecture slides
-
Lecture 00: Administrivia and Introduction, Jan 12
(1up,
6up)
-
Lecture 01: Quick Review of Background, Jan 14–19
(1up,
6up)
-
Lecture 02: Dynamic Programming, Jan 19–28
(1up,
6up)
-
Snow Day, Feb 2
-
Lecture 03: Greedy Algorithms, Jan 28–Feb 16
(1up,
6up)
-
Lecture 04: Elementary Graph Algorithms, Feb 16–18
(1up,
6up)
-
Lecture 05: Minimum-Weight Spanning Trees, Feb 23–25
(1up,
6up)
-
Lecture 06: Single-Source Shortest Paths, Mar 1–8
(1up,
6up)
-
Lecture 07: All-Pairs Shortest Paths, Mar 10–Mar 15
(1up,
6up)
-
Midterm Exam Review, Mar 15
-
Midterm Exam, Mar 17
-
Spring Break, Mar 22–24
-
Lecture 08: Lower Bounds, Mar 29–31
(1up,
6up)
-
Lecture 09: NP-Completeness, Apr 5–12
(1up,
6up)
-
Lecture 10: Maximum Flow, Apr 14–26
(1up,
6up)
-
Lecture 11: Approximation Algorithms, Apr 26–28
(1up,
6up)
-
Final Exam Review, Apr 28
-
Course Evaluations, Apr 28 BRING A MOBILE DEVICE
-
Final Exam, Friday May 6, 10:00am–12:00pm
Return to the Course Home Page