CSCE 423/823 lecture slides
-
Lecture 00: Administrivia and Introduction, Aug 22
(1up,
6up)
-
Lecture 01: Quick Review of Background, Aug 22–24
(1up,
6up)
-
Lecture 02: Median Finding and Order Statistics, Aug 24–29
(1up,
6up)
-
Lecture 03: Dynamic Programming, Aug 31–Sep 12
(1up,
6up)
-
Lecture 04: Greedy Algorithms, Sep 12–19
(1up,
6up)
-
Lecture 05: Elementary Graph Algorithms, Sep 19–28
(1up,
6up)
-
Lecture 06: Minimum-Weight Spanning Trees, Sep 28–Oct 5
(1up,
6up)
-
Lecture 07: Single-Source Shortest Paths, Oct 5‐12
(1up,
6up)
-
Fall Break, Oct 17
-
Lecture 08: All-Pairs Shortest Paths, Oct 19–24
(1up,
6up)
-
Lecture 09: Lower Bounds, Oct 24–Nov 2
(1up,
6up)
-
Midterm Exam Review, Oct 26
-
Midterm Exam, Oct 31
-
Lecture 10: NP-Completeness, Nov 7–14
(1up,
6up)
-
Lecture 11: Maximum Flow, Nov 16–21
(1up,
6up)
-
Thanksgiving Break, Nov 23
-
Lecture 12: Approximation Algorithms, Nov 28–30
(1up,
6up)
-
Final Exam Review, Dec 7
-
Course Evaluations, Dec 7 BRING A MOBILE DEVICE
-
Final Exam, Friday Dec 15, 7:30am–9:30am
Return to the Course Home Page