COT-5407 - Introduction to Algorithms Lectures
Videos become live prior to the "lecture date", specifically
Sundays and Wednesdays. Remember, videos are available for 72 hours
starting at noon. If there is an assignment due on a Thursday, the
Wednesday video release will be delayed 24 hours,
to start Thursday noon-Sunday noon,
so as to not distract you from completing the assignment.
- Aug 21 and 23: Introduction to Algorithms, Big-Oh, etc.
- Read Chapters 1-4 in CLRS
- Aug 28 and 30: Sorting and Order Statistics
- Read Chapter 7, Section 8.1, and Chapter 9 in CLRS
- Sept 4: Adversary Lower Bound Arguments
- Sept 6, 11, 13: Hashing
- Sept 18: Radix Sort
- Sept 20 and 25: Binary Search Trees
- Homework #2 solutions
- AvlTree.java: AVL Tree Code, with insert, remove, contains
- Sept 27: Binary Heaps and Leftist Heaps
- October 2: Disjoint Sets
- Oct 4: Midterm Review
- OCTOBER 10: MIDTERM EXAM 1:00-2:50PM, ECS-141
-
Covers material through binary heaps (homeworks 1, 2, 3).
- Oct 11, 16, 18, 23, 25: Graph Algorithms
- Oct 30: Network Flow
- Nov 1 and 6: Amortized Analysis, Skew Heaps, Fibonacci Heaps
- Nov 8, 13, 15 : NP Completeness
-
Bonus videos: open in separate window.
- Nov 20: Dynamic Progamming
- Nov 22: No class
- Nov 27: String Algorithms
- Knuth-Morris Pratt
- Rabin-Karp
- Moyer-Moore
- Suffix Arrays and Trees
- Nov 29: Review of HW 5
- WED Dec 5 12:00PM - 2:00PM, ECS-349: FINAL EXAM