UMBC CMSC441, Design & Analysis of Algorithms, Spring 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 Assign Due
Tu 01/29 Intro, Asymptotic Notation 1.1-3.2    
Th 01/31 Summations A.1-A.2 HW1  
Tu 02/05 Recurrences 4.1-4.2    
Th 02/07 Master Theorem 4.3-4.4 HW2 HW1
Tu 02/12 Heap Sort 6.1-6.5    
Th 02/14 Quicksort 7.1-7.4 HW3 HW2
Tu 02/19 Lower bounds on Sorting 8.1-8.4    
Th 02/21 Linear-Time Selection 9.1-9.3 HW4 HW3
Tu 02/26 Hashing 11.1-11.4    
Th 02/28 Review     HW4
Tu 03/05 Exam 1 13.1-13.4    
Th 03/07 Dynamic Programming I 15.1-15.3 HW5  
Tu 03/12 Dynamic Programming II 15.4-15.5    
Th 03/14 Greedy Algorithms I 16.1-16.2 HW6 HW5
Tu 03/19 Greedy Algorithms II 16.3    
Th 03/21 Dynamic Programming vs Greedy     HW6
Tu 03/26 Spring Break      
Th 03/28 Spring Break      
Tu 04/02 Review      
Th 04/04 Exam 2      
Tu 04/09 Basic Graph Algorithms I 22.1-22.5 HW7  
Th 04/11 Basic Graph Algorithms II      
Tu 04/16 Basic Graph Algorithms III   HW8 HW7
Th 04/18 Minimum Spanning Trees I 23.1-23.2    
Tu 04/23 Minimum Spanning Trees II 21.1-21.3 HW9 HW8
Th 04/25 Shortest Paths I 24.1-24.3    
Tu 04/30 Shortest Paths II 24.4-24.5 HW10 HW9
Th 05/02 Shortest Paths III 25.1-25.3    
Tu 05/07 Advanced Topic TBA   HW11 HW10
Th 05/09 Advanced Topic TBA      
Tu 05/14 Review     HW11
F 05/17 Final Exam 3:30-5:30pm ACIV 151 (!!!)

Last Modified: 22 Apr 2002 11:11:13 EDT by Richard Chang
to Spring 2002 CMSC 441 Section Homepage