Schedule
Date | Lecture | Readings | Assignments | |
---|---|---|---|---|
Introduction, Analysis of Algorithms, Asymptotic Order of Growth Big-O Notation | ||||
05/16 |
Lecture #1
:
Introduction to Algorithms, Complexity [ slides | |
|
||
Recursion, Divide-and-Conquer | ||||
05/18 |
Lecture #2
:
Review of Recursive Algorithms, Divide-and-Conquer I [ slides | |
|
||
05/23 |
Lecture #3
:
Divide-and-Conquer II [ slides | |
|
||
Dynamic Programming | ||||
05/25 |
Lecture #4
:
Dynamic Programming I [ slides | |
|
||
05/30 |
Lecture #5
:
Dynamic Programming II [ slides | |
|
||
06/01 |
Lecture #6
:
Dynamic Programming III [ slides | |
|
||
Greedy Algorithms | ||||
06/06 |
Lecture #7
:
Greedy Approaches, Review Session [ slides | |
|
||
06/08 | Exam 1 | |||
Graph Algorithms — Definition and Traversal | ||||
06/13 |
Lecture #8
:
Graph Definition, Graph Traversal [ slides | |
|
||
06/15 |
Lecture #9
:
Graph Traversal, Grid Problems [ slides | |
|
||
06/20 |
Lecture #10
:
Traversal Applications [ slides | |
|
||
Graph Algorithms — Minimum Spanning Tree | ||||
06/22 |
Lecture #11
:
Traversal Applications, Minimum Spanning Tree I [ slides | |
|
||
06/27 |
Lecture #12
:
Minimum Spanning Tree II [ slides | |
|
||
Graph Algorithms — Shortest Path Problems | ||||
06/29 |
Lecture #13
:
Review Session, Shortest Path Problems I [ slides | |
|
||
07/04 | No class (Independence Day) | |||
07/06 | Exam 2 | |||
07/11 |
Lecture #14
:
Shortest Path Problems II [ slides | |
|
||
Graph Algorithms — Flow Network | ||||
07/13 |
Lecture #15
:
Max Flow, Min Cut [ slides | |
|
||
NP-Completness | ||||
07/18 |
Lecture #16
:
NP-Completness I [ slides | |
|
||
07/20 |
Lecture #17
:
NP-Completness II [ slides | |
|
||
07/25 |
Lecture #18
:
Final Review Session [ slides | |
|||
07/27 | Final Exam |