CSCE 423/823 lecture slides
-
Lecture 00: Administrivia and Introduction, Jan 7
(1up,
6up)
-
Lecture 01: Quick Review of Background, Jan 9–11
(1up,
6up)
-
Lecture 02: Median Finding and Order Statistics, Jan 11–16
(1up,
6up,
6up with notes space)
-
Lecture 03: Dynamic Programming, Jan 18–Feb 4
(1up,
6up,
6up with notes space)
- MLK Day, Jan 21
-
Lecture 04: Greedy Algorithms, Feb 4–11
(1up,
6up,
6up with notes space)
- Snow Day, Feb 20
-
Lecture 05: Elementary Graph Algorithms, Feb 13–22
(1up,
6up,
6up with notes space)
-
Lecture 06: Minimum-Weight Spanning Trees, Feb 27–Mar 6
(1up,
6up,
6up with notes space)
-
Lecture 07: Single-Source Shortest Paths, Mar 6‐8
(1up,
6up,
6up with notes space)
-
Midterm Exam Review, Mar 11–13
-
Midterm Exam, Mar 15
-
Spring Break, Mar 18–22
-
Lecture 08: All-Pairs Shortest Paths, Mar 25–29
(1up,
6up,
6up with notes space)
-
Lecture 09: Lower Bounds, Apr 1–3
(1up,
6up,
6up with notes space)
-
Lecture 10: NP-Completeness, Apr 5–17
(1up,
6up,
6up with notes space)
-
Lecture 11: Maximum Flow, Apr 19–24
(1up,
6up,
6up with notes space)
-
Final Exam Review, Apr 26
-
Course Evaluations, Apr 26 BRING A MOBILE DEVICE
-
Final Exam, Thursday, May 2, 1:00pm–3:00pm
Return to the Course Home Page