|
Class #
|
|
Date
|
Lecture
|
Topic
|
Assignment
|
|
1
|
|
Th 9/8
|
Lecture 1
|
Introduction.
|
Hw 0 (informal)
|
|
2
|
|
Tu 9/12
|
Lecture 2
|
Program Correctness
Analysis of Algorithms Part I
|
Hw 1
|
|
3
|
|
Th 9/14
|
Lecture 3
|
Big Oh and orders of growth
|
|
|
4
|
|
Tu 9/19
|
Lecture 4
|
Recurrence Relations
|
Hw 2
|
|
5
|
|
Th 9/21
|
Lecture 5
|
Analysis of iterative algorithms
Iterative Sorting Algorithms.
Start Divide-and-Conquer Sorting algorithms.
|
|
|
6
|
|
Tu 9/26
|
Lecture 6
|
Sorting algorithms, cont'd: Quicksort, HeapSort.
|
Hw 3
|
|
7
|
|
Th 9/28
|
Lecture 7
|
Divide-and-conquer
|
|
|
8
|
|
Tu 10/3
|
Lecture 8
|
Heaps
|
Hw4
|
|
9
|
|
Th 10/5
|
Lecture 9
|
Lower Bounds
|
|
|
-
|
|
Tu 10/10
|
October recess
|
|
|
|
10
|
|
Th 10/12
|
Lecture 10
|
Introduction to Graph Algorithms: basic concepts
|
|
|
11
|
|
Tu 10/17
|
Lecture 11
|
Midterm review
|
|
|
M
|
|
Th 10/19
|
Midterm
.
|
Midterm exam
|
|
|
12
|
|
Tu 10/24
|
Lecture 12
|
Introduction to Leda
|
Hw5
|
|
13
|
|
Th 10/26
|
Lecture 13
|
Depth-First Search
|
|
|
14
|
|
Tu 10/31
|
Lecture 14
|
Depth-First Search
|
|
|
-
|
|
Th 11/2
|
|
Otilia Cromwell day, no classes in the afternoon
|
|
|
15
|
|
Tu 11/7
|
Lecture 15
|
Strongly connected components
|
|
|
16
|
|
Th 11/9
|
Lecture 16
|
Topological Sorting. Breadth-First Search.
|
Hw6
|
|
17
|
|
Tu 11/14
|
Lecture 17
|
Leda presentations.
|
|
|
18
|
|
Th 11/16
|
Lecture 18
|
Biconnected Components
Discussion of project options.
|
|
|
19
|
|
Tu 11/21
|
Lecture 19
|
Minimum Spanning Trees
|
|
|
20
|
|
Tu 11/28
|
Lecture 20
|
Shortest Paths
|
|
|
21
|
|
Th 11/30
|
Lecture 21
|
Dynamic Programming
All Pairs Shortest Paths and Transitive Closeure
|
Hw7
|
|
22
|
|
Tu 12/5
|
Lecture 22
|
NP and NP-completeness
|
|
|
23
|
|
Th 12/7
|
Lecture 23
|
|
|
|
24
|
|
Tu 12/12
|
Lecture 24
|
Final Project Presentation |
|
|
P
|
|
Th 12/14
|
Lecture 25
|
Final Project Presentation |
Old exams
|
|