CMSC 641 Design & Analysis of Algorithms, Fall 2014

Course Syllabus (Original)

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
Thu 08/28Review: Greedy Algorithms 16.1-16.4    
Tue 09/02Review: Dynamic Programming 15.1-15.5 HW1  
Thu 09/04Amortized Analysis 17.1-17.4    
Tue 09/09Disjoint Set Union 21.1-21.4 HW2 HW1
Thu 09/11Fibonacci Heaps 19.1-19.4    
Tue 09/16Fibonacci Heaps   HW3 HW2
Thu 09/18Maximum Flow, Test 1 26.1-26.3    
Tue 09/23Maximum Flow   HW4 HW3
Thu 09/25Maximum Flow      
Tue 09/30Maximum Flow   HW5 HW4
Thu 10/02Linear Programming, Test 2 29.1-29.3    
Tue 10/07Linear Programming   HW6 HW5
Thu 10/09Linear Programming      
Tue 10/14NP-completeness 34.1-34.5 HW7 HW6
Thu 10/16NP-completeness, Test 3      
Tue 10/21NP-completeness   HW8 HW7
Thu 10/23Approximation Algorithms 35.1-35.5    
Tue 10/28Approximation Algorithms   HW9 HW8
Thu 10/30Approximation Algorithms      
Tue 11/04Randomized Algorithms tba HW10 HW9
Thu 11/06Test 4      
Tue 11/11Randomized Algorithms   HW11 HW10
Thu 11/13Multi-threaded Algorithms 27.1-27.3    
Tue 11/18Multi-threaded Algorithms   HW12 HW11
Thu 11/20Test 5      
Tue 11/25Parallel Merge Sort handout   HW12
Thu 11/27Thanksgiving break
Tue 12/02Computational Geometry 33.1-33.2 HW13  
Thu 12/04Computational Geometry 33.3-33.4    
Tue 12/09Review     HW13
Thu 12/11Final Exam 8am – 10am

Last Modified: 24 Sep 2014 15:08:43 EDT by Richard Chang
to Fall 2014 CMSC 641 Homepage