CSE 5311 Fall 2002 - Design and Analysis of Algorithms

Schedule

Class Day Date Topic Readings Due
1 Tu 08/27/2002 Introduction    
2 Th 08/29/2002 Design and Analysis 1, 2, 3, Appendix A  
3 Tu 09/03/2002 Recurrences 4  
4 Th 09/05/2002 Heapsort and Quicksort 6, 7 Quiz 1*
5 Tu 09/10/2002 Linear Sorts, Order Statistics 8, 9  
6 Th 09/12/2002 Hash Tables 11  
7 Tu 09/17/2002 Binary and Red-Black Trees 12, 13  
8 Th 09/19/2002 Augmenting Data Structures 14 Quiz 2*
9 Tu 09/24/2002 B-Trees 18  
10 Th 09/26/2002 Dynamic Programming 15 Program 1
11 Tu 10/01/2002 Greedy Algorithms 16  
12 Th 10/03/2002     Quiz 3*
13 Tu 10/08/2002 Amortized Analysis 17  
14 Th 10/10/2002 Mergeable Heaps 19, 20  
15 Tu 10/15/2002 Disjoint Sets 21  
16 Th 10/17/2002 Graph Algorithms 22 Quiz 4*
17 Tu 10/22/2002 Minimum Spanning Trees 23  
18 Th 10/24/2002 Shortest Paths 24 Program 2
19 Tu 10/29/2002 Shortest Paths 25  
20 Th 10/31/2002 Maximum Flow 26 Quiz 5*
21 Tu 11/05/2002 Parallel Algorithms    
22 Th 11/07/2002 Number-Theoretic Algorithms 31  
23 Tu 11/12/2002 Encryption    
24 Th 11/14/2002 String Matching 32 Quiz 6*
25 Tu 11/19/2002 Computational Geometry 33  
26 Th 11/21/2002 NP Completeness 34  
27 Tu 11/26/2002 NP Completeness   Program 3
---- Th 11/28/2002 Thanksgiving Holiday    
28 Tu 12/03/2002 Approximation Algorithms 35  
29 Th 12/05/2002 Conclusions   Quiz 7*
* Quizzes will be held 5:00-5:30pm in 315 Nedderman Hall on the UTA campus.