UMBC CMSC441, Design & Analysis of Algorithms, Spring 2009

Course Syllabus

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

  Homework
Date Topic Quizzes Reading Assigned Due
Tue 01/27 Introduction 1.1-3.2
Thu 01/29 Summations A.1-A.2 HW1
Tue 02/03 Recurrences 4.1-4.2
Thu 02/05 Master Theorem 4.3-4.4 HW2 HW1
Tue 02/10 Heapsort 6.1-6.5
Thu 02/12 Quicksort 7.1-7.4 HW3 HW2
Tue 02/17 Lower bounds on Sorting 8.1-8.4
Thu 02/19 Linear-Time Selection 9.1-9.3 HW4 HW3
Tue 02/24 Hash Tables Quiz 1 11.1-11.5
Thu 02/26 Dynamic Programming I 15.1-15.3 HW5 HW4
Tue 03/03 Dynamic Programming II 15.4-15.5
Thu 03/05 Dynamic Programming III HW6 HW5
Tue 03/10 Greedy Algorithms I Quiz 2 16.1-16.2
Thu 03/12 Greedy Algorithms II 16.3 HW7 HW6
Tue 03/17 Spring Break
Thu 03/19 Spring Break
Tue 03/24 Dynamic Programming vs Greedy
Thu 03/26 Basic Graph Algorithms I 22.1-22.2 HW8 HW7
Tue 03/31 Basic Graph Algorithms II 22.3-22.4
Thu 04/02 Basic Graph Algorithms III 22.5 HW9 HW8
Tue 04/07 Minimum Spanning Trees I Quiz 3 23.1-23.2
Thu 04/09 Disjoint Set Union 21.1-21.3 HW10 HW9
Tue 04/14 Minimum Spanning Trees II
Thu 04/16 Shortest Paths I 24.1-24.3 HW11 HW10
Tue 04/21 Shortest Paths II Quiz 4 24.4-24.5
Thu 04/23 Shortest Paths III 25.1-25.3 HW12 HW11
Tue 04/28 Maximum Flow I 26.1-26.3
Thu 04/30 Maximum Flow II HW13 HW12
Tue 05/05 Maximum Flow III Quiz 5
Thu 05/07 NP-completeness 34.1-34.5 HW13
Tue 05/12 Review
Tue 05/19 Final Exam 10:30am - 12:30pm


Last Modified: 22 Jul 2024 11:28:46 EDT by Richard Chang
to Spring 2009 CMSC 441 Homepage