UMBC CMSC441, Design & Analysis of Algorithms, Fall 2018

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.

Updated: 2018-09-26. Original schedule still available here.

  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/18Divide and ConquerQuiz 1
Thu 09/20Linear-time Selection9.1 – 9.3HW4HW3
Tue 09/25Quicksort7.1 – 7.4
Thu 09/27Lower Bounds on Sorting8.1 – 8.4HW5HW4
Tue 10/02Dynamic Programming IQuiz 215.1 – 15.3
Thu 10/04Dynamic Programming II15.4 – 15.5HW6HW5
Tue 10/09Greedy Algorithms I16.1 – 16.2
Thu 10/11Greedy Algorithms II16.3HW7HW6
Tue 10/16Dynamic Programming vs GreedyQuiz 3
Thu 10/18Dynamic Programming vs GreedyHW8HW7
Tue 10/23Basic Graph Algorithms I22.1 – 22.2
Thu 10/25Basic Graph Algorithms II22.3 – 22.4HW9HW8
Tue 10/30Basic Graph Algorithms IIIQuiz 422.5
Thu 11/01Minimum Spanning Trees I23.1 – 23.2HW10HW9
Tue 11/06Disjoint Set Union21.1 – 21.3
Thu 11/08Minimum Spanning Trees IIHW11HW10
Tue 11/13Shortest Paths IQuiz 524.1 – 24.3
Thu 11/15Shortest Paths II24.4 – 24.5HW12HW11
Tue 11/20Shortest Paths III25.1 – 25.3
Thu 11/22 Thanksgiving break
Tue 11/27Maximum Flow I26.1 – 26.3
Thu 11/29Maximum Flow II HW13HW12
Tue 12/04Maximum Flow IIIQuiz 6
Thu 12/06NP-completeness34.1 – 34.5HW13
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: 22 Jul 2024 11:28:57 EDT by Richard Chang
Back to Fall 2018 CMSC 441 Sections 01 & 02 Homepage