CMSC 641 Design & Analysis of Algorithms, Spring 2008

Course Syllabus

Updated March 2, 2008.


This syllabus has been revised to reflect some slippage in the schedule. The original syllabus is still available here.

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. Selected topics not in the textbook will require reading from handouts.

  Homework
Date Topic Quizzes Reading Assign Due
Tue 01/29 Review: Greedy Algorithms 16.1-16.4
Thu 01/31 Review: Dynamic Programming 15.1-15.5 HW1
Tue 02/05 Review: Greedy vs Dynamic Programming
Thu 02/07 Amortized Analysis 17.1-17.4 HW2 HW1
Tue 02/12 Binomial Heaps 19.1-19.2
Thu 02/14 Fibonacci Heaps 20.1-20.4 HW3 HW2
Tue 02/19 Fibonacci Heaps Quiz 1
Thu 02/21 Maximum Flow HW4 HW3
Tue 02/26 Maximum Flow
Thu 02/28 Maximum Flow handout HW5 HW4
Tue 03/04 Maximum Flow Quiz 2
Thu 03/06 Linear Programming 29.1 – 29.2 HW6 HW5
Tue 03/11 Linear Programming 29.3
Thu 03/13 NP-completeness 34.1-34.5 HW7 HW6
Tue 03/18 Spring Break
Thu 03/20 Spring Break
Tue 03/25 NP-completeness
Thu 03/27 NP-completeness HW8 HW7
Tue 04/01 Approximation Algorithms 35.1 – 35.5
Thu 04/03 Approximation Algorithms HW9 HW8
Tue 04/08 Approximation Algorithms Quiz 3
Thu 04/10 Randomized Algorithms handout HW10 HW9
Tue 04/15 Randomized Algorithms
Thu 04/17 Randomized Algorithms HW11 HW10
Tue 04/22 Sorting Networks Quiz 4 27.1-27.5
Thu 04/24 Sorting Networks HW12 HW11
Tue 04/29 Parallel Merge Sort handout
Thu 05/01 Computational Geometry 33.1-33.2 HW13 HW12
Tue 05/06 Computational Geometry Quiz 5 33.3-33.4
Thu 05/08 Computational Geometry handout HW13
Tue 05/13 Review
Thu 05/15 Final Exam 1pm - 3pm


Last Modified: 16 Apr 2008 19:48:55 EDT by Richard Chang
to Spring 2008 CMSC 641 Homepage