Week |
Dates |
Topic |
Slides |
HW |
01 |
Jan. 11 |
Introduction and Course Administrivia, Algorithmic Analysis |
|
|
Jan. 13 |
Proving Algorithm Correctness using Invariants |
|
02 |
Jan. 18 |
|
|
|
Jan. 20 |
Calculating Instructional Cost, Asymptotic Analysis, Big-O, Big-Omega |
|
|
03 |
Jan. 25 |
Performance Comparison with L'Hospita's Rule, Limit rules review |
|
Jan. 27 |
Greedy Strategy: Minimum Spanning Tree, Single-Source Shortest Path |
|
04 |
Feb. 01 |
Huffman Codes |
|
Feb. 03 |
Greedy Strategy Correctness and Runtime Analysis: Huffman Codes |
|
05 |
Feb. 08 |
MST problem greedy correctness, Fractional Knapsack Problem |
|
Feb. 10 |
Dijkstra Greedy Correctness |
|
|
06 |
Feb. 15 |
Divide-and-Conquer Strategy: In-Class Problem Solving #2 |
|
Feb. 17 |
Solving Recurrances: Induction Method, Recurrance Trees |
|
07 |
Feb. 22 |
Substitution Method, and Master's Method |
|
|
Feb. 24 |
Strassen's Algorithm, Convex Hull Problem, Quickhull, Jarvis' March, Graham Scan |
|
08 |
Feb. 29 |
midterm exam |
Mar. 02 |
midterm review |
09 |
Mar. 07 |
Spring break |
Mar. 09 |
10 |
Mar. 14 |
Dynamic Programming: In-class Problem Solving Session #3 |
|
|
Mar. 16 |
Bellman-Ford Algorithm, All-Pairs Shortest Path Problem |
|
11 |
Mar. 21 |
Matrix-Chain Multiplication, Longest Common Subsequence |
|
|
Mar. 23 |
0-1 Knapsack Problem |
|
12 |
Mar. 28 |
Network Flow: Max-Flow Min-Cut Theorem, Augmenting Path Approach |
|
|
Mar. 30 |
|
|
13 |
Apr. 04 |
Randomized & Approximation Algorithms |
|
|
Apr. 06 |
|
|
14 |
Apr. 11 |
Algorithmic Intractability: |
|
|
Apr. 13 |
|
|
|
15 |
Apr. 18 |
|
|
Apr. 20 |
|
|
16 |
Apr. 25 |
|
|
Apr. 27 |
|
|
17 |
May. 02 |
finals week |
May. 04 |