CSCE 750 - Analysis of Algorithms - Fall 2026

Disclaimer

This is the best information available as of today, Wednesday August 12, 2026 at 11:45:26 EDT. Changes will appear in this web page as the course progresses.

The Course Syllabus

Contains general course information and class policies.

Announcements

Announcements (with dates) will be posted here in reverse chronological order.

(August 11, 2026) There will be no class on Wednesday, September 9, so you'll get that whole week off from coming to class. I will post video of an equivalent lecture from a previous semester and expect you to have seen it before the subsequent class.

Schedule of Lectures, Homework, and Quizzes

These are subject to change as the course progresses. The typeset notes are from Prof. O'Kane's CSCE 750 class in Fall 2020. All hand-written notes are from Fall 2023 -- Fall 2026. This semester's notes will be posted with a delay of a day or two.

Links to the homework handouts are given on their due dates. (NOTE: Since homework submissions are completely optional, the "due" date just refers to the estimated latest time to have worked on the homework to prepare for the quiz.)

Date What it is Description Fall 2023 Fall 2024 Fall 2025 Fall 2026
Homework 0 (not graded) [hw0.pdf]
2026-08-19 Lecture 01 Introduction to the course [notes-intro.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-08-24 Lecture 02 Models of computation; asymptotic notations [notes-asymptotics.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-08-26 Lecture 03 Summations [notes-summations.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-08-31 Homework 1 due  [hw1.pdf]
2026-08-31 Lecture 04 Solving recurrences; substitution method; proving a stronger bound [notes-recurrences.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-09-02 Quiz 1 TBD
2026-09-02 Lecture 05 More on recurrences; recursion tree method [Hand-written notes] [Hand-written notes] (not available) [Hand-written notes]
2026-09-09 Lecture 06 More on recurrences; recursion trees; Master theorem [Hand-written notes (Fall 2022)] [Hand-written notes] [Hand-written notes] [Hand-written notes] (not available)
2026-09-14 Lecture 07 Priority queues and heaps [notes-heaps.pdf] [Hand-written notes (Fall 2022)] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-09-16 Homework 2 due [hw2.pdf]
2026-09-16 Lecture 08 Randomized algorithms; Quicksort [notes-randomized.pdf] [Hand-written notes (lect. 1, Fall 2022)] [Hand-written notes (lect. 2, Fall 2022)] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-09-21 Quiz 2 TBD
2026-09-21 Lecture 09 More on randomized algorithms [Hand-written notes (Fall 2022)] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-09-23 Lecture 10 Order statistics; randomized QuickSelect; deterministic selection in linear time [notes-selection.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-09-28 Lecture 11 Lower bounds; hash tables [notes-lowerbounds.pdf] [notes-hash.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-09-30 Homework 3 due [hw3.pdf]
2026-09-30 Lecture 12 More on hash tables; binary search trees [notes-bst.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-10-05 Quiz 3 TBD
2026-10-05 Lecture 13 More on binary search trees, including treaps [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-10-07 Lecture 14 Treap analysis; augmenting data structures [notes-augmenting.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-10-12 Lecture 15 Dynamic programming [notes-dp.pdf] [Hand-written notes] (not available) [Hand-written notes] [Hand-written notes]
2026-10-14 Homework 4 due [hw4.pdf]
2026-10-14 Lecture 16 Amortized analysis [notes-amortized.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-10-19 Quiz 4 TBD
2026-10-19 Lecture 17 Mergeable heaps, binomial heaps: introduction and basic structure [notes-mergeable-heaps.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-10-21 Lecture 18 Binomial heaps operations [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-10-26 Lecture 19 Binomial heaps: merge operation; Fibonacci heaps: basic structure and operations [notes-fibheap.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-10-28 Homework 5 due [hw5.pdf]
2026-10-28 Lecture 20 Fibonacci heaps: analysis [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-11-02 Quiz 5 TBD
2026-11-02 Lecture 21 Disjoint sets [notes-disjoint-sets.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-11-04 Lecture 22 More on disjoint sets; elementary graph algorithms [notes-graphs.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-11-09 Homework 6 due [hw6.pdf]
2026-11-09 Lecture 23 Minimum spanning trees [notes-mst.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-11-11 Quiz 6 TBD
2026-11-11 Lecture 24 Shortest paths on graphs [notes-diskstra.pdf] [Hand-written notes ] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-11-16 Lecture 25 NP-completeness [notes-npcomplete.pdf] [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-11-18 Homework 7 due [hw7.pdf]
2026-11-18 Lecture 26 More on NP-completeness [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-11-30 Quiz 7 TBD
2026-11-30 Lecture 27 More on NP-completeness, polynomial reductions [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
2026-12-02 Lecture 28 More on NP-completeness, polynomial reductions; review [Hand-written notes] [Hand-written notes] [Hand-written notes] [Hand-written notes]
Homework 8 (not graded) [hw8.pdf] [review.pdf] [Hand-written notes]
2026-12-11 Final Exam 12:30pm - 3:00pm

Some Miscellaneous Resources

Proper Use of Computing Resources

Students are expected to be aware of the university policy on use of computing resources, including the Student Guidelines for Responsible Computing, as well as the college and departmental policies on proper use of computing resources. Every instance of a suspected violation will be reported.

This page was last modified Wednesday August 12, 2026 at 11:45:26 EDT.