CS 491 CAP (Spring 2025)

Lecture Schedule

1 min read

DateLecture
January 22, 2025Course Introduction
January 24, 2025IO
January 27, 2025Standard Template Library
January 29, 2025Complete Search
January 31, 2025Divide and Conquer
February 3, 2025Disjoint Sets
February 5, 2025Binary Search Trees
February 7, 2025Graph Representations
February 10, 2025Graph Traversals 1
February 12, 2025Single Source Shortest Path]
February 14, 2025Bellman Ford and SPFA
February 17, 2025Floyd-Warshall
February 19, 2025Strongly Connected Components
February 21, 2025No Class Today
February 24, 2025Minimum Spanning Trees
February 26, 2025Bit Manipulations
February 28, 2025Fast Exponentiation
March 3, 2025Binary Lifting and Least Common Ancestor
March 5, 2025Sqrt Decomposition
March 7, 2025Segment Trees
March 9, 2025Lazy Segment Trees
March 12, 2025Fenwick Trees
March 14, 2025No Class (Pre-Spring Break)
March 24, 2025Greedy Algorithms
March 26, 2025Dynamic Programming
March 28, 2025Longest Common Sequence
March 31, 2025DP Palindromes
April 2, 2025DP Edit Distance
April 4, 2025DP Trees and DAGs
April 7, 2025DP Knapsack
April 9, 2025DP TSP
April 11, 2025DP KMP
April 14, 2025Rabin Karp
April 16, 2025Primes and GCD
April 18, 2025Number Theory: Fermat’s Little and Euler Torion
April 21, 2025Combinatorics, inclusion exclusion
April 23, 2025Points, Lines, Vectors
April 25, 2025Shapes
April 28, 2025Convex Hull
April 30, 2025Line Sweep
May 2, 2025Game Theory
May 5, 2025Contest Strategy
May 7, 2025Interview Strategy

Graph View

Backlinks