CSE 5311 Fall 2004 - Design and Analysis of Algorithms

Schedule

Class Day Date Topic Readings Due
1 M 08/23/2004 Introduction    
2 W 08/25/2004 Design and Analysis 1, 2, 3, Appendix A  
3 M 08/30/2004 Recurrences 4  
4 W 09/01/2004 Heapsort and Quicksort 6, 7  
---- M 09/06/2004 Labor Day Holiday    
5 W 09/08/2004 Linear Sorts, Order Statistics 8, 9 Quiz 1
6 M 09/13/2004 Hash Tables 11  
7 W 09/15/2004 Binary and Red-Black Trees 12, 13  
8 M 09/20/2004 Augmenting Data Structures 14  
9 W 09/22/2004 B-Trees 18 Quiz 2
10 M 09/27/2004 Dynamic Programming 15  
11 W 09/29/2004 Greedy Algorithms 16 Program 1
12 M 10/04/2004 Greedy Algorithms    
13 W 10/06/2004 Amortized Analysis 17 Quiz 3
14 M 10/11/2004 Mergeable Heaps 19, 20  
15 W 10/13/2004 Disjoint Sets 21  
16 M 10/18/2004 Graph Algorithms 22  
17 W 10/20/2004 Minimum Spanning Trees 23 Quiz 4
18 M 10/25/2004 Shortest Paths 24  
19 W 10/27/2004 Shortest Paths 25 Program 2
20 M 11/01/2004 Maximum Flow 26  
21 W 11/03/2004 Parallel Algorithms   Quiz 5
22 M 11/08/2004 Number-Theoretic Algorithms 31  
23 W 11/10/2004 Encryption    
24 M 11/15/2004 String Matching 32  
25 W 11/17/2004 Computational Geometry 33 Quiz 6
26 M 11/22/2004 NP Completeness 34  
27 W 11/24/2004 NP Completeness   Program 3
28 M 11/29/2004 Approximation Algorithms 35  
29 W 12/01/2004 Conclusions   Quiz 7