UMBC CMSC441, Design & Analysis of Algorithms, Spring 2020


ORIGINAL Schedule

This is the original schedule from the beginning of the semester. Please use the current schedule.


  Homework
Date Topic Quizzes Reading Assign Due
Tue 01/28Introduction1.1-3.2
Thu 01/30Summations & RecurrencesA.1-A.2, 4.1-4.2HW1
Tue 02/04More Recurrences
Thu 02/06Master Theorem4.3-4.4HW2HW1
Tue 02/11Heapsort6.1-6.5
Thu 02/13Quicksort7.1-7.4HW3HW2
Tue 02/18Lower bounds on SortingQuiz 18.1-8.4
Thu 02/20Linear-Time Selection9.1-9.3HW4HW3
Tue 02/25Greedy Algorithms I16.1-16.2
Thu 02/27Greedy Algorithms II16.3HW5HW4
Tue 03/03Greedy Algorithms IIQuiz 2
Thu 03/05Dynamic Programming I15.1-15.3HW6HW5
Tue 03/10Dynamic Programming II15.4-15.5
Thu 03/12Dynamic Programming IIIHW7HW6
Tue 03/17Spring Break
Thu 03/19Spring Break
Tue 03/24Basic Graph Algorithms IQuiz 322.1-22.2
Thu 03/26Basic Graph Algorithms II22.3-22.4HW8HW7
Tue 03/31Basic Graph Algorithms III22.5
Thu 04/02Minimum Spanning Trees I23.1-23.2HW9HW8
Tue 04/07Disjoint Set UnionQuiz 421.1-21.3
Thu 04/09Minimum Spanning Trees IIHW10HW9
Tue 04/14Shortest Paths I24.1-24.3
Thu 04/16Shortest Paths II24.4-24.5HW11HW10
Tue 04/21Shortest Paths IIIQuiz 525.1-25.3
Thu 04/23Maximum Flow I26.1-26.3HW12HW11
Tue 04/28Maximum Flow II
Thu 04/30Maximum Flow IIIHW13HW12
Tue 05/05NP-completenessQuiz 634.1-34.5
Thu 05/07NP-completenessHW13
Tue 05/12Review
Tue 05/19 Section 02 Final Exam 10:30am – 12:30pm, ITE 227
Section 01 Final Exam 1pm – 3pm, Sherman 013


Readings are from Introduction to Algorithms, (3/e), by Cormen, Leiserson, Rivest and Stein.


Last Modified: 24 Mar 2020 21:19:59 EDT by Richard Chang
Back to Spring 2020 CMSC 441 Sections 02 & 01 Homepage