CMSC 441, Fall 1996

Combined Course Syllabus


We will follow the textbook Introduction to Algorithms, by Cormen, Leiserson and Rivest. The following schedule outlines the material to be covered during the semester and specifies the correpsonding section of the textbook.
DateTopicReadingDue
Tu 9/3Introduction1.1 - 1.4
Th 9/5Order & Summation2.1 - 3.2
Tu 9/10Recurrences4.1 - 4.2
Th 9/12The Master Theorem4.3HW 1
Tu 9/17Heap Sort7.1 - 7.5
Th 9/19Quicksort, Radix Sort8.1 - 8.4, 9.1 - 9.4HW 2
Tu 9/24Linear Time Selection10.1 - 10.2
Th 9/26Linear Time Selection10.3HW 3
Tu 10/1Review
Th 10/3Exam 1
Tu 10/8Dynamic Sets11.1 - 11.4
Th 10/10Hashing12.1 - 12.2HW 4
Tu 10/15Hashing12.3 - 12.4
Th 10/17Red-Black Trees14.1 - 14.4HW 5
Tu 10/22Review
Th 10/24Dynamic Programming16.1 - 16.2HW 6
Tu 10/29Dynamic Programming16.3 - 16.4
Th 10/31Disjoint Set Union22.1 - 22.3HW 7
Tu 11/5Introduction to Graphs23.1
Th 11/7Breadth First Search23.2HW 8
Tu 11/12Review
Th 11/14Exam 2
Tu 11/19Depth First Search23.3
Th 11/21Topological Sort23.4 - 23.5HW 9
& Connected Components
Tu 11/26Minimum Spanning Tree24.1 - 24.2
Th 11/28Thanksgiving Break
Tu 12/3Single Source Shortest Paths25.1 - 25.4
Th 12/5All Pairs Shortest Paths26.1 - 26.2HW 10
Tu 12/10Advanced Topic TBAPROJECT
TBAFinal Exam

Last Modified: Tue Sep 3 08:14:01 EDT 1996

Richard Chang, chang@gl.umbc.edu