UMBC CMSC441, Design & Analysis of Algorithms, Spring 2011

Course Syllabus

Updated: May 5, 2011. The original syllabus is available here.

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.

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


Last Modified: 22 Jul 2024 11:29:47 EDT by Richard Chang
to Spring 2011 CMSC 441 Homepage