UMBC CMSC441, Design & Analysis of Algorithms, Fall 2002, Section 0101

Course Syllabus

We will follow the textbook Introduction to Algorithms, second edition, by Cormen, Leiserson, Rivest and Stein. The following schedule outlines the material to be covered during the semester and specifies the corresponding sections of the textbook.

Date Topic Reading HW Assigned HW Due Writing Assigned Writing Due
Th 08/29 Introduction 1.1-3.2        
Tu 09/03 Proofs       Draft  
Th 09/05 Summations A.1-A.2        
Tu 09/10 Recurrences 4.1-4.2 HW1     Draft
Th 09/12 Master Theorem 4.3-4.4        
Tu 09/17 Heapsort 6.1-6.5 HW2 HW1    
Th 09/19 Quicksort 7.1-7.4     Rev 1  
Tu 09/24 Lower bounds on Sorting 8.1-8.4 HW3 HW2    
Th 09/26 Linear-Time Selection 9.1-9.3     Critique Rev 1
Tu 10/01 Dynamic Programming I 15.1-15.3 HW4 HW3   Critique
Th 10/03 Dynamic Programming II 15.4-15.5     Rev 2  
Tu 10/08 Greedy Algorithms I 16.1-16.2 HW5 HW4    
Th 10/10 Greedy Algorithms II 16.3       Rev 2
Tu 10/15 Dynamic Programming vs Greedy     HW5    
Th 10/17 Review          
Tu 10/22 Midterm Exam
Th 10/24 Basic Graph Algorithms I 22.1-22.5     Draft  
Tu 10/29 Basic Graph Algorithms II          
Th 10/31 Basic Graph Algorithms III   HW7     Draft
Tu 11/05 Minimum Spanning Trees I 23.1-23.2        
Th 11/07 Shortest Paths I 24.1-24.3 HW8 HW7    
Tu 11/12 Shortest Paths II 24.4-24.5     Rev 1  
Th 11/14 Shortest Paths III 25.1-25.3 HW9 HW8    
Tu 11/19 Maxium Flow I 26.1-26.3     Critique Rev 1
Th 11/21 Maximum Flow II     HW9   Critique
Tu 11/26 Maximum Flow III       Rev 2  
Th 11/28 Thanksgiving break
Tu 12/03 Advanced Topic TBA   HW10      
Th 12/05 Advanced Topic TBA         Rev 2
Tu 12/10 Advanced Topic TBA     HW10    
Tu 12/17 Final Exam 1:00pm - 3:00pm

Last Modified: 7 Aug 2003 12:48:41 EDT by Richard Chang
to Fall 2002 CMSC 441 Section Homepage