CSE 331 Fall 2025 Schedule
Previous schedules: 2024 (Spring) and 2024 (Fall) .
Future Lectures
The topics for lectures in the future are tentative and subject to change. Also the links for future lectures are from Fall 2024. Recordings of Fall 2025 lectures are also available from UBLearns.
| Date | Topic (Slides & Videos) | Notes |
| Mon, Aug 25 | Introduction F25 F24 | Syllabus Walkthrough: |
| Tue, Aug 28 | (HW 0 out) | |
| Wed, Aug 29 | Halting Problem F25 F24 | Week 1 Recitation Notes |
| Fri, Aug 31 | Algorithmic Ideas F25 F24 | |
| Mon, Sep 1 | No Class | Labor Day |
| Tue, Sep 2 | (HW 0 in) | |
| Wed, Sep 3 | Matchings F25 F24 | [KT, Sec 1.1]
Week 2 recitation notes |
| Friday, Sep 5 | Gale Shapley Algorithm F25 F24 |
[KT, Sec 1.1] Reading Assignment: Pigeonhole principle Reading Assignment: Asymptotic notation care package |
| Mon, Sep 8 | Gale Shapley Proof of Correctness F25 F24 | [KT, Sec 1.1] Reading Assignment: Pigeonhole principle Reading Assignment: Asymptotic notation care package |
| Tue, Sep 9 | (HW 1 Out) | |
| Wed, Sep 10 | Gale Shapley Other Details F25 F24 | [KT, Sec 1.1]
Week 3 recitation notes |
| Fri, Sep 12 | Gale Shapley Optimal/Pessimal Matching F25 F24 | [KT, Sec 1.1, 2.1, 2.2, 2.4] Reading Assignment: Worst-case runtime analysis notes |
| Mon, Sep 15 | Runtime Analysis F25 F24 | [KT, Sec 2.3] |
| Tue, Sep 16 | (HW 2 out, HW 1 in) | |
| Wed, Sep 17 | Runtime Analysis of Gale-Shapley F25 | [KT, Sec 2.3]
Week 4 recitation notes |
| Fri, Sep 19 | Graph Basics F25 F24 | [KT, Sec 3.1] (Project Team Composition Due) Reading Assignment: Care package on trees Reading Assignment: BFS by examples |
| Mon, Sep 22 | Breadth First Search F25 F24 | [KT, Sec 3.2] |
| Tue, Sep 23 | (HW 3 out, HW 2 in) | |
| Wed, Sep 24 | Explore algorithm F25 F24 | [KT, Sec 3.3] Week 5 recitation notes |
| Fri, Sep 26 | Runtime Analysis of BFS algorithm F25 F24 | [KT, Sec 3.3] Reading Assignment: [KT, Sec 3.3, 3.4, 3.5, 3.6] Reading Assignment: Care package on topological ordering |
| Mon, Sep 29 | More graph stuff F25 F24 | [KT, Sec 3.3, 3.6] (Quiz 1) (Group Registration on Autolab due) |
| Tue, Oct 1 | (HW 3 in) | |
| Wed, Oct 1 | Interval Scheduling Problem F25 F24 | [KT, Sec 4.1] (Project out) Reading Assignment: [KT, Sec 4.1, 4.2] |
| Fri, Oct 3 | Greedy Algorithm for Interval Scheduling F25 F24 | [KT, Sec 4.1] Reading Assignment: Care package on minimizing maximum lateness |
| Mon, Oct 6 | Mid-term exam: I | |
| Wed, Oct 8 | Mid-term exam: II | Week 7 recitation notes |
| Fri, Oct 10 | Shortest Path Problem F25 F24 | [KT, Sec 4.4] |
| Mon, Oct 14 | No class | Fall break! |
| Tue, Oct 15 | (HW 4 out) | |
| Wed, Oct 15 | Dijkstra's algorithm F25 F24 | [KT, Sec 4.4] Week 8 recitation notes |
| Fri, Oct 17 | Correctness of Dijkstra's Algorithm F25 F24 | [KT, Sec 4.4] Reading Assignment: [KT, Sec 4.4] |
| Mon, Oct 20 | Minimum Spanning Tree F25 F24 | [KT, Sec 4.5] |
| Tue, Oct 21 | (HW 4 in, HW 5 out) | |
| Wed, Oct 22 | Cut Property Lemma F25 F24 | [KT, Sec 4.5]
Week 9 recitation notes Reading Assignment: [KT, Sec 4.5, 4.6] |
| Fri, Oct 24 | Mergesort F25 F24 | [KT, Sec 5.1] |
| Mon, Oct 27 | Solving recurrence relations F25 F24 | [KT, Sec 5.2] |
| Tue, Oct 28 | (HW 5 in) | |
| Wed, Oct 29 | Counting Inversions F25 F24 | [KT, Sec 5.3] Reading Assignment: [KT, Sec 5.2] Week 10 recitation notes |
| Fri, Oct 31 | Multiplying large integers F25 F24 | [KT, Sec 5.5] (Project (Problems 1 & 2 Coding) in)
Reading Assignment: Unraveling the mystery behind the identity |
| Mon, Nov 3 | Closest Pair of Points F25 F24 | [KT, Sec 5.4] (Project (Problems 1 & 2 Reflection) in) |
| Tue, Nov 4 | (HW 6 out) | |
| Wed, Nov 5 | Kickass Property Lemma F25 F24 | [KT, Sec 5.4]
Week 11 recitation notes |
| Fri, Nov 7 | Weighted Interval Scheduling F25 F24 | [KT, Sec 6.1] |
| Mon, Nov 10 | Recursive algorithm for weighted interval scheduling problem F25 F24 | [KT, Sec 6.1, 6.2] |
| Tue, Nov 11 | (HW 7 out, HW 6 in) | |
| Wed, Nov 13 | Iterative algorithm for weighted interval scheduling problem F25 F24 | [KT, Sec 6.1, 6.2]
Week 12 recitation notes |
| Fri, Nov 14 | Subset sum problem F25 F24 | [KT, Sec 6.4] |
| Mon, Nov 17 | Shortest path problem F25 F24 | [KT, Sec 6.8] Reading Assignment: [KT, Sec 6.4] |
| Tue, Nov 18 | (HW 8 out, HW 7 in) | |
| Wed, Nov 19 | Bellman-Ford Algorithm F25 F24 | [KT, Sec 6.8] Week 13 recitation notes |
| Fri, Nov 21 | Reductions F25 F24 | [KT, Sec 8.1] |
| Mon, Nov 24 | P and NP F25 F24 | [KT, Sec 8.3, 8.4] (Project (Problem 3 Coding) in) |
| Wed, Nov 26 | No class | Fall Break |
| Fri, Nov 28 | No class | Fall Break |
| Mon, Dec 1 | NP Completeness F25 F24 | [KT, Sec. 8.4] (Quiz 2) (Project (Problem 3 Reflection) in) |
| Tue, Dec 2 | (HW 8 in) | |
| Wed, Dec 3 | Satisfiability F25 F24 | [KT, Sec 8.2] |
| Fri, Dec 5 | k-coloring F25 F24 | [KT, Sec 8.2, 8.7]
(Project (Problems 4 & 5Coding) in) |
| Mon, Dec 8 | Wrapup F25 F24 | [KT, Sec 8.7] |
| Tue, Dec 9 | (Project (Problems 4 & 5 Reflection) in) (Project Survey in) |
Wed, Dec 10 | Final Exam | (7:15PM in TBD) |