CMSC 641 Design & Analysis of Algorithms, Spring 2010

Original Course Syllabus

This is the original course syllabus. Please use the current syllabus here.

We will follow the textbook Introduction to Algorithms, either the second or third 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.

  Reading Homework
Date Topic Quizzes 3/e 2/e Assign Due
Thu 01/28 Review: Greedy Algorithms 16.1 – 16.4 16.1 – 16.4
Tue 02/02 Review: Dynamic Programming 15.1 – 15.5 15.1 – 15.5 HW1
Thu 02/04 Amortized Analysis 17.1 – 17.4 17.1 – 17.4
Tue 02/09 Disjoint Set Union 21.1 – 21.4 21.1 – 21.4 HW2 HW1
Thu 02/11 Fibonacci Heaps 19.1 – 19.4 20.1 – 20.4
Tue 02/16 Fibonacci Heaps HW3 HW2
Thu 02/18 Maximum Flow 26.1 – 26.3 26.1 – 26.3
Tue 02/23 Maximum Flow HW4 HW3
Thu 02/25 Maximum Flow Quiz 1
Tue 03/02 Maximum Flow HW5 HW4
Thu 03/04 Linear Programming 29.1 – 29.3 29.1 – 29.3
Tue 03/09 Linear Programming HW6 HW5
Thu 03/11 Linear Programming Quiz 2
Tue 03/16 Spring Break
Thu 03/18 Spring Break
Tue 03/23 NP-completeness 34.1 – 34.5 34.1 – 34.5 HW7 HW6
Thu 03/25 NP-completeness
Tue 03/30 NP-completeness HW8 HW7
Thu 04/01 Approximation Algorithms Quiz 3 35.1 – 35.5 35.1 – 35.5
Tue 04/06 Approximation Algorithms HW9 HW8
Thu 04/08 Approximation Algorithms
Tue 04/13 Randomized Algorithms tba tba HW10 HW9
Thu 04/15 Randomized Algorithms Quiz 4
Tue 04/20 Multi-threaded Algorithms 27.1 – 27.3 download HW11 HW10
Thu 04/22 Multi-threaded Algorithms
Tue 04/27 Multi-threaded Algorithms HW12 HW11
Thu 04/29 Parallel Merge Sort Quiz 5 handout handout
Tue 05/04 Computational Geometry 33.1 – 33.2 33.1 – 33.2 HW13 HW12
Thu 05/06 Computational Geometry 33.3 – 33.4 33.3 – 33.4
Tue 05/11 Computational Geometry HW13
Thu 05/13 Review
Tue 05/18 Final Exam 1pm – 3pm

Last Modified: 12 Feb 2010 09:28:49 EST by Richard Chang
to Spring 2010 CMSC 641 Homepage