UMBC CMSC441, Design & Analysis of Algorithms, Fall 2018

Original 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.

  Homework
Date Topic Quizzes Reading Assign Due
Thu 08/30Recursion & Induction1.1 – 3.2HW1
Tue 09/04SummationsA.1 – A.2
Thu 09/06Recurrences4.1 – 4.2HW2HW1
Tue 09/11Master Theorem4.3 – 4.4
Thu 09/13Heapsort6.1 – 6.5HW3HW2
Tue 09/18QuicksortQuiz 17.1 – 7.4
Thu 09/20Lower bounds on Sorting8.1 – 8.4HW4HW3
Tue 09/25Linear-Time Selection9.1 – 9.3
Thu 09/27Dynamic Programming I15.1 – 15.3HW5HW4
Tue 10/02Dynamic Programming IIQuiz 215.4 – 15.5
Thu 10/04Greedy Algorithms I16.1 – 16.2HW6HW5
Tue 10/09Greedy Algorithms II16.3
Thu 10/11Dynamic Programming vs GreedyHW7HW6
Tue 10/16Dynamic Programming vs GreedyQuiz 3
Thu 10/18Basic Graph Algorithms I22.1 – 22.2HW8HW7
Tue 10/23Basic Graph Algorithms II22.3 – 22.4
Thu 10/25Basic Graph Algorithms III22.5HW9HW8
Tue 10/30Minimum Spanning Trees IQuiz 423.1 – 23.2
Thu 11/01Disjoint Set Union21.1 – 21.3HW10HW9
Tue 11/06Minimum Spanning Trees II
Thu 11/08Shortest Paths I24.1 – 24.3HW11HW10
Tue 11/13Shortest Paths IIQuiz 524.4 – 24.5
Thu 11/15Shortest Paths III25.1 – 25.3HW12HW11
Tue 11/20Maximum Flow I26.1 – 26.3
Thu 11/22 Thanksgiving break
Tue 11/27Maximum Flow II
Thu 11/29Maximum Flow III HW13HW12
Tue 12/04NP-completenessQuiz 634.1 – 34.5
Thu 12/06NP-completenessHW13
Tue 12/11Review
Thu 12/13Section 01 Final Exam 10:30am – 12:30pm
Tue 12/18Section 02 Final Exam 10:30am – 12:30pm


Last Modified: 26 Sep 2018 12:32:51 EDT by Richard Chang
Back to Fall 2018 CMSC 441 Sections 01 & 02 Homepage