CMSC 441, Spring 1997

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.
Date Topic Reading Due
Th 1/30Intro. & Order of Growth1.1 - 2.2
Tu 2/4Analyzing Loop Algorithms3.1 - 3.2
Th 2/6Analyzing Recursive Algorithms4.1 - 4.2 HW 1 due
Tu 2/11The Master Theorem4.3 - 4.4
Th 2/13Heapsort7.1 - 7.5 HW 2 due
Tu 2/18Quicksort8.1 - 8.4
Th 2/20Lower Bounds & Linear-Time Sorts9.1 - 9.4 HW 3 due
Tu 2/25Linear-Time Selection10.1 - 10.3
Th 2/27Exam 1
Tu 3/4Exam 1 Discussion
Th 3/6Hashing12.1 - 12.2 HW 4 due
Tu 3/11Hashing12.3 - 12.4
Th 3/13Red-Black Trees14.1 - 14.4 HW 5 due
Tu 3/18Dynamic Programming16.1 - 16.2
Th 3/20Dynamic Programming16.3 - 16.4 HW 6 due
Tu 3/25Spring Break
Th 3/27Spring Break
Tu 4/1Dynamic Programming
Th 4/3Disjoint-Set Union22.1 - 22.3 HW 7 due
Tu 4/8Review
Th 4/10Exam 2
Tu 4/15Exam 2 Discussion
Th 4/17Breadth & Depth First Search23.1 - 23.3 HW 8 due
Tu 4/22Topological Sort23.4 - 23.5
& Connected Components
Th 4/25Minimum Spanning Tree24.1 - 24.2 HW 9 due
Tu 4/29Single-Source Shortest Paths25.1 - 25.4
Th 5/1All-Pairs Shortest Paths26.1 - 26.2 HW 10 due
Tu 5/6Advanced Topic TBA
Th 5/8Advanced Topic TBA PROJECT due
TBAFinal Exam

Last Modified: Wed Jan 29 11:56:39 EST 1997

Richard Chang, chang@gl.umbc.edu