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.
| Date | Topic | Reading | Due |
| Tu 9/3 | Introduction | 1.1 - 1.4 | |
| Th 9/5 | Order & Summation | 2.1 - 3.2 | |
| Tu 9/10 | Recurrences | 4.1 - 4.2 | |
| Th 9/12 | The Master Theorem | 4.3 | HW 1 |
| Tu 9/17 | Heap Sort | 7.1 - 7.5 | |
| Th 9/19 | Quicksort, Radix Sort | 8.1 - 8.4, 9.1 - 9.4 | HW 2 |
| Tu 9/24 | Linear Time Selection | 10.1 - 10.2 | |
| Th 9/26 | Linear Time Selection | 10.3 | HW 3 |
| Tu 10/1 | Review | | |
| Th 10/3 | Exam 1 | | |
| Tu 10/8 | Dynamic Sets | 11.1 - 11.4 | |
| Th 10/10 | Hashing | 12.1 - 12.2 | HW 4 |
| Tu 10/15 | Hashing | 12.3 - 12.4 | |
| Th 10/17 | Red-Black Trees | 14.1 - 14.4 | HW 5 |
| Tu 10/22 | Review | | |
| Th 10/24 | Dynamic Programming | 16.1 - 16.2 | HW 6 |
| Tu 10/29 | Dynamic Programming | 16.3 - 16.4 | |
| Th 10/31 | Disjoint Set Union | 22.1 - 22.3 | HW 7 |
| Tu 11/5 | Introduction to Graphs | 23.1 | |
| Th 11/7 | Breadth First Search | 23.2 | HW 8 |
| Tu 11/12 | Review | | |
| Th 11/14 | Exam 2 | | |
| Tu 11/19 | Depth First Search | 23.3 | |
| Th 11/21 | Topological Sort | 23.4 - 23.5 | HW 9 |
| & Connected Components | | |
| Tu 11/26 | Minimum Spanning Tree | 24.1 - 24.2 | |
| Th 11/28 | Thanksgiving Break | | |
| Tu 12/3 | Single Source Shortest Paths | 25.1 - 25.4 | |
| Th 12/5 | All Pairs Shortest Paths | 26.1 - 26.2 | HW 10 |
| Tu 12/10 | Advanced Topic TBA | | PROJECT |
| TBA | Final Exam | | |
Last Modified:
Tue Sep 3 08:14:01 EDT 1996
Richard Chang, chang@gl.umbc.edu