UMBC CMSC441, Design & Analysis of Algorithms, Spring 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-01-21.

  Homework
Date Topic Quizzes Reading Assign Due
Tue 01/29Introduction1.1–3.2
Thu 01/31Summations & RecurrencesA.1–A.2, 4.1–4.2HW1
Tue 02/05Master Theorem4.3–4.4
Thu 02/07Heapsort6.1–6.5HW2HW1
Tue 02/12Quicksort7.1–7.4
Thu 02/14Lower bounds on Sorting8.1–8.4HW3HW2
Tue 02/19vEB TreesQuiz 120.1–20.3
Thu 02/21Linear-Time Selection9.1–9.3HW4HW3
Tue 02/26Dynamic Programming I15.1–15.3
Thu 02/28Dynamic Programming II15.4–15.5HW5HW4
Tue 03/05Greedy Algorithms IQuiz 216.1–16.2
Thu 03/07Greedy Algorithms II16.3HW6HW5
Tue 03/12Dynamic Programming vs Greedy
Thu 03/14Dynamic Programming vs GreedyHW6
Tue 03/19Spring Break
Thu 03/21Spring Break
Tue 03/26Basic Graph Algorithms I22.1–22.2
Thu 03/28Basic Graph Algorithms II22.3–22.4HW7
Tue 04/02Basic Graph Algorithms IIIQuiz 322.5
Thu 04/04Minimum Spanning Trees I23.1–23.2HW8HW7
Tue 04/09Disjoint Set Union21.1–21.3
Thu 04/11Minimum Spanning Trees IIHW9HW8
Tue 04/16Shortest Paths IQuiz 424.1–24.3
Thu 04/18Shortest Paths II24.4–24.5HW10HW9
Tue 04/23Shortest Paths III25.1–25.3
Thu 04/25Maximum Flow I26.1–26.3HW11HW10
Tue 04/30Maximum Flow IIQuiz 5
Thu 05/02Maximum Flow IIIHW12HW11
Tue 05/07NP-completeness34.1–34.5
Thu 05/09NP-completenessHW12
Tue 05/14Review
Thu 05/16Final Exam 1pm–3pm


Last Modified: 21 Jan 2019 18:21:19 EST by Richard Chang
Back to Spring 2019 CMSC 441 Section 01 Homepage