CS 491 CAP (Fa25)

Lecture Schedule

1 min read

WeekDateLecture
1August 25, 2025Course Introduction
August 27, 2025IO
August 29, 2025Complete Search
2September 1, 2025Coding Session
September 3, 2025Divide and Conquer
September 5, 2025Disjoint Sets
3September 8, 2025Special Topic
September 10, 2025Single Source Shortest Path
September 12, 2025Floyd-Warshall
4September 15, 2025Special Topics (Advanced Graphs)
September 17, 2025Trees
September 19, 2025Strongly Connected Components
5September 22, 2025Coding Session
September 24, 2025Kruskal’s Algorithm
September 26, 2025Bit Manipulation
6September 29, 2025Coding Session
October 1, 2025Sqrt Decomposition
October 3, 2025Segment Trees
7October 6, 2025Coding Session
October 8, 2025Lazy Segment Trees
October 10, 2025Fenwick Trees
8October 13, 2025Advanced Data Structures (Special Topic)
October 15, 2025Greedy Algorithms
October 17, 2025Dynamic Programming
9October 20, 2025Coding Session
October 22, 2025DP: Longest Common Sequence
Ocotber 24, 2025DP Palindromes
10October 27, 2025DP: TSP (Special Topic)
October 29, 2025DP Edit Distance
October 31, 2025DP Knapsack
11November 3, 2025Coding Session
November 5, 2025Tree DP
November 7, 2025DP KMP
12November 10, 2025Coding Session
November 12, 2025Rabin Karp
November 14, 2025Primes and GCD
13November 17, 2025Fermat’s Little Theorem and Euler’s Totient Function
November 19, 2025Combinatorics
November 21, 2025No Class
14December 1, 2025Coding Session
December 3, 2025Points, Lines, Vectors, Shapes
December 5, 2025Geometry: Convex Hull
15December 8, 2025Geometry: Line Sweep (Special Topic)
December 10, 2025Coding Session / Special Topic

Graph View

Backlinks