COT-5407 - Introduction to Algorithms Lectures
- Aug 24 and 26: Introduction to Algorithms, Big-Oh, etc.
- Read Chapters 1-4 in CLRS
- Aug 31 and Sept 2: Sorting and Order Statistics
- Read Chapter 7, Section 8.1, and Chapter 9 in CLRS
- Sept 7: Adversary Lower Bound Arguments
- Sept 9, 14, 21: Hashing
- Read Chapter 11
- Discussion of HW 1 solutions
- Sept 16: No class
- Sept 23: Balanced Binary Search Trees
- Sept 28: Binary Heaps
- Sept 30: Union Find Algorithm
- Oct 5: Review for Midterm
- Oct 7, 14, 19, 21: Graph Algorithms
- OCTOBER 12: MIDTERM EXAM
-
Covers material through binary heaps (homeworks 1, 2, 3).
- Oct 26: Dynamic Programming
- Oct 28: Greedy Algorithms
- Nov 2, 4, 9, 16: NP Completeness
- Nov 11: No class
- Nov 18: Network Flow
- Nov 23: Randomized Algorithms
- Skip Lists
- Primality Testing
- Nov 25: No class
- Nov 30: String Algorithms
- Knuth-Morris Pratt
- Rabin-Karp
- Moyer-Moore
- Dec 2: Review of HW 5
- Dec 9: FINAL EXAM, 9:45 AM - 11:45 AM, GL-139.