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

Course Syllabus (Revised 11/27/2001)

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.

Note:  The syllabus was revised to compensate for class cancellation on September 11 and other changes. The original syllabus is available here.

Date Topic Reading Assign Due
Th 08/30 Intro, Asymptotic Notation 1.1-3.2    
Tu 09/04 Summations A.1-A.2 HW1  
Th 09/06 Recurrences 4.1-4.2    
Tu 09/11 Class Cancelled
Th 09/13 Master Theorem 4.3-4.4 HW2 HW1
Tu 09/18 Heap Sort 6.1-6.5    
Th 09/20 Quicksort 7.1-7.4 HW3 HW2
Tu 09/25 Lower bounds on Sorting 8.1-8.4    
Th 09/27 Linear-Time Selection 9.1-9.3 HW4 HW3
Tu 10/02 Review      
Th 10/04 Exam 1
Tu 10/09 Hashing 11.1-11.4 HW5 HW4
Th 10/11 Red-Black Trees 13.1-13.4    
Tu 10/16 Dynamic Programming I 15.1-15.3 HW6 HW5
Th 10/18 Dynamic Programming II 15.4-15.5    
Tu 10/23 Greedy Algorithms I 16.1-16.2 HW7 HW6
Th 10/25 Greedy Algorithms II 16.3    
Tu 10/30 Review     HW7
Th 11/01 Exam 2
Tu 11/06 Intro to Graphs 22.1-22.2 HW8  
Th 11/08 Depth-First Search 22.3    
Tu 11/13 Topological Sort &
Strongly Connected Components		 22.4 - 22.5 HW9 HW8
Th 11/15 Minimum Spanning Trees &
Disjoint Set Union		 23.1 - 23.2, 21.1 - 21.3    
Tu 11/20 Shortest Paths I 24.3   HW9
Th 11/22 Thanksgiving
Tu 11/27 Shortest Paths II 24.1, 25.2 HW10  
Th 11/29 Maximum Flow I 26.1 - 26.2    
Tu 12/04 Maximum Flow II 26.3 HW11 HW10
Th 12/06 Maximum Flow III      
Tu 12/11 Review     HW11
Th 12/13 Final Exam 1pm-3pm

Last Modified: 27 Nov 2001 22:39:41 EST by Richard Chang
to Fall 2001 CMSC 441 Section Homepage