UMBC CMSC641, Design & Analysis of Algorithms, Spring 2001

Course Syllabus

We will mainly 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 corresponding sections of the textbook. Selected topics not in the textbook will require reading from handouts. The schedule may be adjusted as the semester progresses. However, due dates for the homework assignments and the dates for the exams will not change.
Date Topic Reading Due
Tue 01/30 Intro, Greedy Algorithms 17.1 - 17.3
Thu 02/01 Dynamic Programming 16.1 - 16.4
Tue 02/06 Amortized Analysis 18.1 - 18.4 HW 1 due
Thu 02/08 Binomial Heaps 20.1 - 20.2
Tue 02/13 Fibonacci Heaps 21.1 - 21.2 HW 2 due
Thu 02/15 Fibonacci Heaps 21.3 - 21.4
Tue 02/20 Disjoint Set Union 22.1 - 22.4 HW 3 due
Thu 02/22 Splay Trees (skipped) handout
Tue 02/27 Maximum Flow 27.1 - 27.2 HW 4 due
Thu 03/01 Maximum Flow 27.3 - 27.4
Tue 03/06 Maximum Flow handout HW 5 due
Thu 03/08 Sorting Networks 28.1 - 28.5
Tue 03/13 TBA HW 6 due
Thu 03/15 Midterm Exam, in class
Tue 03/20 Spring Break
Thu 03/22 Spring Break
Tue 03/27 Parallel Algorithms 30.1 - 30.3
Thu 03/29 Parallel Merge Sort handout
Tue 04/03 Parallel Merge Sort HW 7 due
Thu 04/05 Randomized Algorithms handout
Tue 04/10 Randomized Algorithms HW 8 due
Thu 04/12 Randomized Algorithms
Tue 04/17 Computational Geometry 35.1 - 35.2 HW 9 due
Thu 04/19 Convex Hulls 35.3 - 35.4
Tue 04/24 Voronoi Diagrams handout HW 10 due
Thu 04/26 NP-completeness 36.1 - 36.2
Tue 05/01 NP-completeness 36.3 - 36.4 HW 11 due
Thu 05/03 NP-completeness 36.5
Tue 05/08 Approximation Algorithms 37.1 - 37.4 HW 12 due
Thu 05/10 Approximation Algorithms handout
Tue 05/15 Approximation Algorithms HW 13 due
Tue 05/22 Final Exam, 3:30pm - 5:30pm

Last Modified: 27 Jun 2001 13:26:22 EDT by
Richard Chang

Back up to Spring 2001 CMSC 641 Homepage