CMSC 641 Design & Analysis of Algorithms, Spring 2015

Course Syllabus

Updated 5/1/15: Original syllabus still available here.

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

Date Topic Reading Assign Due
Tue 01/27Review: Greedy Algorithms16.1-16.4  
Thu 01/29Review: Dynamic Programming15.1-15.5HW1 
Tue 02/03Amortized Analysis17.1-17.4  
Thu 02/05more Dynamic Programming HW2HW1
Tue 02/10Amortized Analysis   
Thu 02/12Disjoint Set Union21.1-21.4HW3HW2
Tue 02/17Disjoint Set Union   
Thu 02/19Fibonacci Heaps19.1-19.4HW4HW3
Tue 02/24Fibonacci Heaps, Test 1   
Thu 02/26Maximum Flow26.1-26.3HW5HW4
Tue 03/03Maximum Flow   
Thu 03/05snow day HW6HW5
Tue 03/10Maximum Flow, Test2  HW5
Thu 03/12Maximum Flow HW6HW6
Tue 03/17Spring Break
Thu 03/19Spring Break
Tue 03/24NP-completeness34.1-34.5  
Thu 03/26NP-completeness HW7HW6
Tue 03/31NP-completeness   
Thu 04/02NP-completeness HW8HW7
Tue 04/07Approximation Algorithms35.1-35.5  
Thu 04/09Approximation Algorithms HW9HW8
Tue 04/14Test 3   
Thu 04/16Approximation Algorithms HW10HW9
Tue 04/21Approximation Algorithmstba  
Thu 04/23Randomized Algorithms HW11HW10
Tue 04/28Test 4   
Thu 04/30Randomized Algorithms HW12HW11
Tue 05/05Linear Programming29.1-29.3HW12 
Thu 05/07Linear Programming  HW12
Tue 05/12Review  HW12
Tue 05/19Final Exam 1pm–3pm

Last Modified: 1 May 2015 09:57:29 EDT by Richard Chang
to Spring 2015 CMSC 641 Homepage