CMSC 641 Design & Analysis of Algorithms, Fall 2014

Course Syllabus

Updated: October 28, 2014

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.

This syllabus has been updated. The original syllabus is avaliable here.

  Homework
Date Topic Reading Assign Due
Thu 08/28Greedy Algorithms16.1-16.4    
Tue 09/02Matroids   HW1  
Thu 09/04Dynamic Programming15.1-15.5    
Tue 09/09Dynamic Programming   HW2HW1
Thu 09/11Amortized Analysis17.1-17.4    
Tue 09/16Disjoint Set Union21.1-21.4HW3HW2
Thu 09/18Disjoint Set Union, Test 1      
Tue 09/23Fibonacci Heaps19.1-19.4HW4HW3
Thu 09/25Fibonacci Heaps      
Tue 09/30Maximum Flow26.1-26.3HW5HW4
Thu 10/02Max Flow, Test 2      
Tue 10/07Maximum Flow   HW6HW5
Thu 10/09Maximum Flow      
Tue 10/14Linear Programming29.1-29.3HW7HW6
Thu 10/16Linear Programming, Test 3      
Tue 10/21Linear Programming   HW8HW7
Thu 10/23NP-completeness34.1-34.5    
Tue 10/28NP-completeness   HW9HW8
Thu 10/30NP-completeness      
Tue 11/04NP-completeness   HW10HW9
Thu 11/06Test 4      
Tue 11/11Approximation Algorithms 35.1-35.5 HW11HW10
Thu 11/13Approximation Algorithms      
Tue 11/18Approximation Algorithms   HW12HW11
Thu 11/20Randomized Algorithms tba    
Tue 11/25Randomized Algorithms     HW12
Thu 11/27Thanksgiving break
Tue 12/02Parallel Merge Sort handout HW13  
Thu 12/04Test 5      
Tue 12/09Review     HW13
Thu 12/11Final Exam 8am – 10am

Last Modified: 28 Oct 2014 10:27:33 EDT by Richard Chang
to Fall 2014 CMSC 641 Homepage