Class #
|
Day
|
Tu Th
Date
|
Finish Reading
Prior To
Lecture
[2nd edition]
|
CSE 5311 - "Design and Analysis of Algorithms"
Spring Semester 2006
Diane J. Cook
Lecture & Assignment Schedule
|
PROGRAM
Schedule
|
EXAM
Schedule
|
1 |
W |
01/18/2006 |
|
Introduction and Review |
|
|
2 |
M |
01/23/2006 |
1, 2, 3 [1, 2, 3] |
Analysis of Algorithms |
|
|
3 |
W |
01/25/2006 |
4 [4] |
Recurrences |
|
Quiz 1 |
4 |
M |
01/30/2006 |
|
Recurrences |
|
|
5 |
W |
02/01/2006 |
7, 8 [6, 7] |
Heapsort, Quicksort |
|
|
6 |
M |
02/06/2006 |
9, 10 [8, 9] |
Linear Sorts, Order Statistics |
|
|
7 |
W |
02/08/2006 |
12 [11] |
Hash Tables |
|
Quiz 2 |
8 |
M |
02/13/2006 |
13 [12] |
Binary Search Trees |
|
|
9 |
W |
02/15/2006 |
14 [13, 14] |
Red-Black Trees |
|
|
10 |
M |
02/20/2006 |
19 [18] |
B-Trees |
|
|
11 |
W |
02/22/2006 |
16 [15] |
Dynamic Programming |
|
Quiz 3 |
12 |
M |
02/27/2006 |
17 [16] |
Greedy Algorithms |
|
|
13 |
W |
03/01/2006 |
18 [17] |
Amortized Analysis |
Program 1 |
|
14 |
M |
03/06/2006 |
20, 21 [19, 20] |
Mergeable Heaps |
|
|
15 |
W |
03/8/2006 |
22 [21] |
Mergeable Heaps, Disjoint Sets |
|
Quiz 4 |
------ |
M |
03/13/2006 |
------ |
Spring Break |
|
|
------ |
W |
03/15/2006 |
------ |
Spring Break |
|
|
16 |
M |
03/20/2006 |
23 [22] |
Graph Algorithms |
|
|
17 |
W |
03/22/2006 |
24 [23] |
Minimum Spanning Trees |
|
|
18 |
M |
03/27/2006 |
25 [24] |
Shortest Paths |
|
|
19 |
W |
03/29/2006 |
26 [25] |
Shortest Paths |
|
Quiz 5 |
20 |
M |
04/03/2006 |
27 [26] |
Maximum Flow |
|
|
21 |
W |
04/05/2006 |
30 |
Parallel Algorithms |
|
|
22 |
M |
04/10/2006 |
33 [31] |
Encryption |
|
|
23 |
W |
04/12/2006 |
|
Encryption |
|
Quiz 6 |
24 |
M |
04/17/2006 |
34 [32] |
String Matching |
|
|
25 |
W |
04/19/2006 |
34 [33] |
String Matching, Computational Geometry |
Program 2 |
|
26 |
M |
04/24/2006 |
|
Computational Geometry |
|
|
27 |
W |
04/26/2006 |
35 [34] |
NP Completeness |
|
Quiz 7 |
28 |
M |
05/01/2006 |
36 |
NP Completeness |
|
|
29 |
W |
05/03/2006 |
37 [35] |
Approximation Algorithms; Course Review |
|
Quiz 8 |