CMSC 641 Design & Analysis of Algorithms, Spring 2018

Course Syllabus

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/30Review: Greedy Algorithms16.1-16.4HW1 
Thu 02/01Review: Dynamic Programming15.1-15.5  
Tue 02/06Amortized Analysis: introduction17.1-17.4HW2HW1
Thu 02/08Amortized Analysis: skew heaps   
Tue 02/13Disjoint Set Union21.1-21.4HW3HW2
Thu 02/15Fibonacci Heaps19.1-19.4  
Tue 02/20Maximum Flow26.1-26.3HW4HW3
Thu 02/22Maximum Flow   
Tue 02/27Maximum Flow HW5HW4
Thu 03/01Maximum Flow, Test 1   
Tue 03/06NP-completeness34.1-34.5HW6HW5
Thu 03/08NP-completeness   
Tue 03/13NP-completeness  HW6
Thu 03/15NP-completeness, Test 2   
Tue 03/20Spring Break
Thu 03/22Spring Break
Tue 03/27Approximation Algorithms35.1-35.5HW7 
Thu 03/29Approximation Algorithms   
Tue 04/03Approximation Algorithms HW8HW7
Thu 04/05Approximation Algorithms, Test 3   
Tue 04/10Randomized AlgorithmstbaHW9HW8
Thu 04/12Randomized Algorithms   
Tue 04/17Randomized Algorithms HW10HW9
Thu 04/19Test 4   
Tue 04/24Linear Programming29.1-29.3HW11HW10
Thu 04/26Linear Programming   
Tue 05/01Linear Programming HW12HW11
Thu 05/03Test 5   
Tue 05/08TBD  HW12
Thu 05/10TBD   
Tue 05/15Review   
Thu 05/17Final Exam 1pm-3pm

Last Modified: 30 Jan 2018 01:01:03 EST by Richard Chang
to Spring 2018 CMSC 641 Homepage