UMBC CMSC441, Design & Analysis of Algorithms, Fall 2019

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: 2019-08-22.

  Homework
Date Topic Quizzes Reading Assign Due
Thu 08/29Introduction1.1-3.2HW1
Tue 09/03Summations & RecurrencesA.1-A.2, 4.1-4.2
Thu 09/05Master Theorem4.3-4.4HW2HW1
Tue 09/10Heapsort6.1-6.5
Thu 09/12Quicksort7.1-7.4HW3HW2
Tue 09/17Lower bounds on Sorting8.1-8.4
Thu 09/19Linear-Time Selection9.1-9.3HW4HW3
Tue 09/24Dynamic Programming IQuiz 115.1-15.3
Thu 09/26Dynamic Programming II15.4-15.5HW5HW4
Tue 10/01Dynamic Programming III
Thu 10/03Greedy Algorithms I16.1-16.2HW6HW5
Tue 10/08Greedy Algorithms IIQuiz 216.3
Thu 10/10Dynamic Programming vs GreedyHW7HW6
Tue 10/15Dynamic Programming vs Greedy
Thu 10/17Basic Graph Algorithms I22.1-22.2HW8HW7
Tue 10/22Basic Graph Algorithms IIQuiz 322.3-22.4
Thu 10/24Basic Graph Algorithms III22.5HW9HW8
Tue 10/29Minimum Spanning Trees I23.1-23.2
Thu 10/31Disjoint Set Union21.1-21.3HW10HW9
Tue 11/05Minimum Spanning Trees IIQuiz 4
Thu 11/07Shortest Paths I24.1-24.3HW11HW10
Tue 11/12Shortest Paths II24.4-24.5
Thu 11/14Shortest Paths III25.1-25.3HW12HW11
Tue 11/19Maximum Flow IQuiz 526.1-26.3
Thu 11/21Maximum Flow IIHW13HW12
Tue 11/26Maximum Flow III
Thu 11/28Thanksgiving Day
Tue 12/03NP-completenessQuiz 634.1-34.5
Thu 12/05NP-completenessHW13
Tue 12/10Review
Thu 12/12Section 01 Final Exam 10:30am – 12:30pm, ITE 233
Tue 12/17Section 02 Final Exam 10:30am – 12:30pm, ITE 233


Last Modified: 19 Nov 2019 23:13:54 EST by Richard Chang
Back to Fall 2019 CMSC 441 Sections 01 & 02 Homepage