CMSC 641 Design & Analysis of Algorithms, Spring 2019

Schedule


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.

  Homework
Date Topic Reading Assign Due
Tue 01/29Review: Greedy Algorithms16.1-16.4
Thu 01/31Review: Dynamic Programming15.1-15.5HW1
Tue 02/05Amortized Analysis: introduction17.1-17.4
Thu 02/07Amortized Analysis: skew heapsHW2HW1
Tue 02/12Disjoint Set Union21.1-21.4
Thu 02/14Fibonacci Heaps19.1-19.4HW3HW2
Tue 02/19Maximum Flow26.1-26.3
Thu 02/21Maximum FlowHW4HW3
Tue 02/26Maximum Flow, Test 1
Thu 02/28Maximum FlowHW5HW4
Tue 03/05NP-completeness34.1-34.5
Thu 03/07NP-completenessHW6HW5
Tue 03/12NP-completeness, Test 2
Thu 03/14NP-completenessHW6
Tue 03/19Spring Break
Thu 03/21Spring Break
Tue 03/26Approximation Algorithms35.1-35.5
Thu 03/28Approximation AlgorithmsHW7
Tue 04/02Approximation Algs, Test 3
Thu 04/04Approximation AlgorithmsHW8HW7
Tue 04/09Randomized Algorithmstba
Thu 04/11Randomized AlgorithmsHW9HW8
Tue 04/16Test 4
Thu 04/18Randomized AlgorithmsHW10HW9
Tue 04/23Linear Programming29.1-29.3
Thu 04/25Linear ProgrammingHW11HW10
Tue 04/30Test 5
Thu 05/02TBDHW12HW11
Tue 05/07TBD
Thu 05/09TBDHW12
Tue 05/14Review
Tue 05/21Final Exam 10:30am-12:30pm, Fine Arts 215

Last Modified: 24 Jan 2019 13:59:50 EST by Richard Chang
to Spring 2019 CMSC 641 Homepage