CMSC 441, Spring 1999

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. The dates given here are only applicable to Section 101. Section 201, is one lecture ahead.

Date	Topic	Reading	Due
M 2/1	Intro. & Order of Growth	1.1 - 2.2
W 2/3	Analyzing Loop Algorithms	3.1 - 3.2
M 2/8	Analyzing Recursive Algorithms	4.1 - 4.2	HW 1 due
W 2/10	The Master Theorem	4.3 - 4.4
M 2/15	Heapsort	7.1 - 7.5	HW 2 due
W 2/17	Quicksort	8.1 - 8.4
M 2/22	Lower Bounds & Linear-Time Sorts	9.1 - 9.4	HW 3 due
W 2/24	Linear-Time Selection	10.1 - 10.3
M 3/1	Exam 1
W 3/3	Exam 1 Discussion
M 3/8	Hashing	12.1 - 12.2	HW 4 due
W 3/10	Hashing	12.3 - 12.4
M 3/15	Red-Black Trees	14.1 - 14.4	HW 5 due
W 3/17	Dynamic Programming	16.1 - 16.2
M 3/22	Spring Break
W 3/25	Spring Break
M 3/29	Dynamic Programming	16.3 - 16.4	HW 6 due
W 3/31	Dynamic Programming
M 4/5	Review
W 4/7	Exam 2
M 4/12	Disjoint-Set Union	22.1 - 22.3	HW 7 due
W 4/14	Exam 2 Discussion
M 4/19	Breadth & Depth First Search	23.1 - 23.3	HW 8 due
W 4/21	Topological Sort	23.4 - 23.5
	& Connected Components
M 4/26	Minimum Spanning Tree	24.1 - 24.2	HW 9 due
W 4/28	Single-Source Shortest Paths	25.1 - 25.4
M 5/3	All-Pairs Shortest Paths	26.1 - 26.2	HW 10 due
W 5/10	Advanced Topic TBA
M 5/12	Review		PROJECT due
Tuesday, May 18	Final Exam [6-8pm, LH2. Final.]	Joint exam for both sections.