CMSC 641 Design & Analysis of Algorithms, Spring 2008

Original Course Syllabus

Updated January 24, 2008.

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	Amortized Analysis		17.1-17.4
Thu 02/07	Binomial Heaps		19.1-19.2	HW2	HW1
Tue 02/12	Fibonacci Heaps		20.1-20.4
Thu 02/14	Fibonacci Heaps			HW3	HW2
Tue 02/19	Maximum Flow	Quiz 1	26.1-26.3
Thu 02/21	Maximum Flow			HW4	HW3
Tue 02/26	Maximum Flow		handout
Thu 02/28	Linear Programming		29.1-29.2	HW5	HW4
Tue 03/04	Linear Programming	Quiz 2	29.3
Thu 03/06	NP-completeness		34.1-34.5	HW6	HW5
Tue 03/11	NP-completeness
Thu 03/13	NP-completeness			HW7	HW6
Tue 03/18	Spring Break
Thu 03/20	Spring Break
Tue 03/25	Approximation Algorithms		35.1-35.5
Thu 03/27	Approximation Algorithms			HW8	HW7
Tue 04/01	Approximation Algorithms
Thu 04/03	Randomized Algorithms		handout	HW9	HW8
Tue 04/08	Randomized Algorithms	Quiz 3
Thu 04/10	Randomized Algorithms			HW10	HW9
Tue 04/15	Sorting Networks		27.1-27.5
Thu 04/17	Sorting Networks			HW11	HW10
Tue 04/22	Parallel Algorithms	Quiz 4	handout
Thu 04/24	Parallel Algorithms			HW12	HW11
Tue 04/29	Parallel Algorithms
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: 2 Mar 2008 15:36:33 EST by Richard Chang

to Spring 2008 CMSC 641 Homepage