CSCE 423/823 lecture slides
-
Lecture 00: Administrivia and Introduction, Aug 26
(1up,
6up)
-
Lecture 01: Quick Review of Background, Aug 28–30
(1up,
6up)
-
Labor Day, Sep 2
-
Lecture 02: Median Finding and Order Statistics, Aug 30–Sep 6
(1up,
6up,
6up with notes space)
-
Lecture 03: Dynamic Programming, Sep 9–25
(1up,
6up,
6up with notes space)
-
UNL Career Fair (No class) Sep 25
-
Lecture 04: Greedy Algorithms, Sep 27–Oct 4
(1up,
6up,
6up with notes space)
-
Lecture 05: Elementary Graph Algorithms, Oct 7–11
(1up,
6up,
6up with notes space)
-
Lecture 06: Minimum-Weight Spanning Trees, Oct 14–23
(1up,
6up,
6up with notes space)
-
Fall Break, Oct 21
-
Lecture 07: Single-Source Shortest Paths, Oct 18‐28
(1up,
6up,
6up with notes space)
-
Midterm Exam Review, Oct 30
-
Midterm Exam, Nov 1
-
Lecture 08: All-Pairs Shortest Paths, Nov 4–11
(1up,
6up,
6up with notes space)
-
Lecture 09: Lower Bounds, Nov 13–15
(1up,
6up,
6up with notes space)
-
Lecture 10: NP-Completeness, Nov 18–Dec 4
(1up,
6up,
6up with notes space)
-
Thanksgiving Break, Nov 27–29
-
Lecture 11: Maximum Flow, Dec 6–11
(1up,
6up,
6up with notes space)
-
Lecture 12: Approximation Algorithms, Dec 11–13
(1up,
6up,
6up with notes space)
-
Final Exam Review, Dec 13
-
Course Evaluations, Dec 13 BRING A MOBILE DEVICE
-
Final Exam, Monday, Dec 16, 1:00pm–3:00pm
Return to the Course Home Page