UMBC CMSC441, Design & Analysis of Algorithms, Fall 2001, 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.

Note:  This is the original syllabus. It has been superceded by a revised syllabus.

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 Master Theorem 4.3-4.4 HW2 HW1
Th 09/13 Heap Sort 6.1-6.5    
Tu 09/18 Quicksort 7.1-7.4 HW3 HW2
Th 09/20 Lower bounds on Sorting 8.1-8.4    
Tu 09/25 Linear-Time Selection, Review 9.1-9.3   HW3
Th 09/27 Hashing, Review 11.1-11.4    
Tu 10/02 Exam 1 HW4  
Th 10/04 Red-Black Trees 13.1-13.4    
Tu 10/09 Dynamic Programming I 15.1-15.3 HW5 HW4
Th 10/11 Dynamic Programming II 15.4-15.5    
Tu 10/16 Greedy Algorithms I 16.1-16.2 HW6 HW5
Th 10/18 Greedy Algorithms II 16.3    
Tu 10/23 Dynamic Programming vs Greedy   HW7 HW6
Th 10/25 Disjoint Set Union 21.1-21.3    
Tu 10/30 Review     HW7
Th 11/01 Exam 2    
Tu 11/06 Graph Search 22.1-22.3 HW8  
Th 11/08 Topological Sort 22.4    
Tu 11/13 Strongly Connected Components 22.5 HW9 HW8
Th 11/15 Minimum Spanning Trees 23.1-23.2    
Tu 11/20 Single-Source Shortest Paths I 24.1-24.3   HW9
Th 11/22 Thanksgiving
Tu 11/27 Single-Source Shortest Paths II 24.4-24.5 HW10  
Th 11/29 All-Pairs Shortest Path 25.1-25.3    
Tu 12/04 Advanced Topic TBA   HW11 HW10
Th 12/06 Advanced Topic TBA      
Tu 12/11 Review     HW11
Th 12/13 Final Exam 1pm-3pm

Last Modified: 22 Jul 2024 11:28:20 EDT by Richard Chang
to Fall 2001 CMSC 441 Section Homepage