algo home
CS 5800: Algorithms
Schedule for Fall 2025
The schedule is subject to change.
- Week 1
September 3-5
- Week 2
September 8-12
- Week 3
September 15-19. (add/drop on 16)
- Week 4
September 22-26
- Week 5
September 29 - October 3
- Week 6
October 6-10
- Red-black trees (Resources: section 9.3) -- The objective here is not so much to memorize the various cases, it's to understand why these trees are balanced, and that it's possible to keep them balanced.
- Augmenting BSTs (Resources: section 10)
- Week 7
October 14-17 (holiday on 13)
- Week 8
October 20-24
- Week 9
October 27-31
- Week 10
November 3-7
- Week 11
November 10-14
- Week 12
November 17-21
- Week 13
November 24-25 (holiday during 26-28)
- Week 14
December 1-5
- Review
- Exam 4, Friday the 5th,
covering weeks 10,11,12,13.
- Topics from the Resources page that we won't cover
- Indicator random variables (Resources: section 7)
- Strongly connected components. (SCC; Resources: 13)
- P vs NP (Resources: section 16)
- I recommend taking a look at P vs NP at some point. Nobody should get a CS degree without knowing some of the basic concepts. Ideally it will be covered in greater detail in another course (on theory of computation).
- Topics that you might find in other intro to Algorithms courses, that we probably won't cover.
Not to imply that this course is easier; we emphasize some things that others don't.
-
Network flow
-
Linear programming
-
Approximation algorithms
-
All-pairs shortest paths
-
String matching
- ...