UMBC CMSC441, Design & Analysis of Algorithms, Fall 2005, Section 0201, Dr. White

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. This schedule is subject to change as the course progresses; check here for updates!

Date Event Topic Reading Assign Due
Th 09/01  Introduction, Proofs 1.1-3.2   
Tu 09/06  SummationsA.1-A.2HW1  
Th 09/08  Recurrences4.1-4.2  
Tu 09/13  Master Theorem 4.3-4.4 HW2 HW1
Th 09/15  Heapsort 6.1-6.5   
Tu 09/20  Quicksort 7.1-7.4 HW3 HW2
Th 09/22  Lower bounds on Sorting 8.1-8.4   
Tu 09/27  Linear-Time Sorting   HW3
Th 09/29  Midterm I    
Tu 10/04  Linear-Time Selection9.1-9.3 HW4 
Th 10/06  Hashing11.1-11.5  
Tu 10/11  Dynamic Programming I 15.1-15.5 HW5 HW4
Th 10/13  Dynamic Programming II    
Tu 10/18  Dynamic Programming III  HW6 HW5
Th 10/20  Greedy Algorithms I 16.1-16.2   
Tu 10/25  Greedy Algorithms II 16.3  
Th 10/27  Basic Graph Algorithms I22.1-22.2 HW7HW6
Tu 11/01  Basic Graph Algorithms II 22.3-22.4   
Th 11/03  Midterm II   HW7
Tu 11/08  Basic Graph Algorithms III 22.5HW8  
Th 11/10  Shortest Paths I 24.1-24.3   
Tu 11/15  Shortest Paths II 24.4-24.5 HW9HW8
Th 11/17  Shortest Paths III 25.1-25.3  
Tu 11/22  Minimum Spanning Trees I 23.1HW10HW9
Th 11/24  Thanksgiving Break    
Tu 11/29  Disjoint Set Union 21.1-21.3   
Th 12/01  Minimum Spanning Trees II 23.2  
Tu 12/06  Easy Problems: Linear Programming[29] HW10
Th 12/08  Hard Problems: NP-completeness[34]  
Tu 12/13  NO CLASS  Project
Th 12/15  Final Exam