UMBC CMSC441, Design & Analysis of Algorithms, Fall 1999, Section 0201

Course Syllabus

We will follow the textbook Introduction to Algorithms, by Cormen, Leiserson and Rivest. The following schedule outlines the material to be covered during the semester and specifies the correpsonding section of the textbook.

Date Topic Reading Due
W 09/01Asymptotic Notation1.1-2.2
M 09/06Labor Day
W 09/08Summations3.1-3.2
M 09/13Recurrences4.1-4.2HW1
W 09/15Master Theorem4.3-4.4
M 09/20Heap Sort7.1-7.5HW2
W 09/22Quicksort8.1-8.4
M 09/27Lower Bounds on Sorting9.1-9.4HW3
W 09/29Linear-Time Selection10.1-10.3
M 10/04Review, Project Assigned, Divide & Conquer vs Randomization HW4
W 10/06Exam 1  
M 10/11Red-Black Trees14.1-14.4 
W 10/13Hashing12.1-12.4HW5
M 10/18Greedy Algorithms17.1-17.3 
W 10/20Dynamic Programming16.1-16.4HW6
M 10/25Local vs Global Optimization  
W 10/27Dynamic Programming HW7
M 11/01Dynamic Programming  
W 11/03Review HW8
M 11/08Exam 2  
W 11/10Introduction to Graphs23.1
M 11/15Breadth-First and Depth-First Search23.2-23.3
W 11/17Topological Sort23.4Project
M 11/22Connected Components23.5HW9
W 11/24Disjoint Sets22.1-22.3
M 11/29Thanksgiving
W 12/01Minimum Spanning Trees24.1-24.2
M 12/06Shortest Paths25.1-25.5HW10
W 12/08Shortest Paths26.1-26.2
M 12/13ReviewHW11

Maitreyee Pasad
Last modified: Wed Sep 1 13:44:54 EDT 1999
to Fall 1999 CMSC 441 Section Homepage