Schedule is subject to change.

Week Topics Text Assignment Quiz
9/1 Course Introduction
9/6
9/8 		Loop Invariants and Correctness
Asymptotic Analysis 		2.1
3
9/13
9/15 		Divide and Conquer 4.1, 4.3 – 4.5
HW 1 due
9/20
9/22 		Heapsort
Quicksort 		6.1 – 6.4
7.1 – 7.3
HW 2 due 		Quiz 1
9/27
9/29 		Linear-Time Sorting
8.1 – 8.3

HW 3 due
10/4
10/6 		Dynamic Programming 15.1, 15.3, 15.4
HW 4 due 		Quiz 2
10/11
10/13 		Greedy Algorithms 16.1 – 16.3 Project 1 Assigned
HW 5 due
10/18
10/20 		Greedy Algorithms
HW 6 due 		Quiz 3
10/25
10/27 		Multithreaded Algorithms 27.1, 27.2
HW 7 due
10/31
11/1
11/3
11/5 (Sat)
Multithreaded Algorithms 		Project 1 Due
Project 2 Assigned

HW 8 due
Quiz 4
11/8
11/10
11/12 (Sat) 		Single-Source Shortest Path 24.1 – 24.3

HW 9 due
11/15
11/17
11/19 (Sat) 		Single-Source Shortest Path 26.2 – 26.3

HW 10 due 		Quiz 5
11/22
11/24
11/26 (Sat) 		Catch-up
Thanksgiving Holiday 		Project 2 Due

HW 11 due
11/29
12/1
Computational Models
NP-Completeness 		34.1, 34.2 Quiz 6
12/6
12/7 (Wed)
12/8
NP-Completeness 34.3 – 34.5
HW 12 Due
12/13 Wrap-up and Review HW 13 Due
12/20 Final Exam Section 02 (10:00 AM): Tuesday, December 20, 10:30 – 12:30
Section 03 (1:00 PM): Tuesday, December 20, 1:00 – 3:00