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

  Homework
Date Topic Quizzes Reading Assign Due
Th 09/02 Introduction, Proofs   1.1-3.2    
Tu 09/07 Summations, Recurrences   A.1-A.2, 4.1-4.2 HW1  
Th 09/09 Master Theorem   4.3-4.4    
Tu 09/14 Heapsort   6.1-6.5 HW2 HW1
Th 09/16 Quicksort   7.1-7.4    
Tu 09/21 Lower bounds on Sorting   8.1-8.4 HW3 HW2
Th 09/23 Linear-Time Selection Quiz 1 9.1-9.3    
Tu 09/28 Hash Tables   11.1-11.5 HW4 HW3
Th 09/30 Balanced Search Trees   12.1-13.4    
Tu 10/05 Dynamic Programming I   15.1-15.3 HW5 HW4
Th 10/07 Dynamic Programming II Quiz 2 15.4-15.5    
Tu 10/12 Dynamic Programming III     HW6 HW5
Th 10/14 Greedy Algorithms I   16.1-16.2    
Tu 10/19 Greedy Algorithms II   16.3 HW7 HW6
Th 10/21 Dynamic Programming vs Greedy Quiz 3      
Tu 10/26 Basic Graph Algorithms I   22.1-22.2 HW8 HW7
Th 10/28 Basic Graph Algorithms II   22.3-22.4    
Tu 11/02 Basic Graph Algorithms III   22.5 HW9 HW8
Th 11/04 Minimum Spanning Trees I Quiz 4 23.1-23.2    
Tu 11/09 Disjoint Set Union   21.1-21.3 HW10 HW9
Th 11/11 Minimum Spanning Trees II        
Tu 11/16 Shortest Paths I   24.1-24.3 HW11 HW10
Th 11/18 Shortest Paths II Quiz 5 24.4-24.5    
Tu 11/23 Shortest Paths III   25.1-25.3   HW11
Th 11/25 Thanksgiving break
Tu 11/30 Maxium Flow I   26.1-26.3 HW12  
Th 12/02 Maximum Flow II        
Tu 12/07 Maximum Flow III     HW13 HW12
Th 12/09 NP-completeness Quiz 6 34.1-34.5    
Tu 12/14 Review       HW13
Th 12/16 Final Exam 1:00pm - 3:00pm

Last Modified: 14 Aug 2004 16:22:26 EDT by Richard Chang
to Fall 2004 CMSC 441 Section Homepage