SCHEDULE FOR CPT S 223

SCHEDULE FOR CPT S 223 (FALL 2008)

^*Homework & program links will be activated on their posting dates.

Class	Day	Date	Topic	Readings (sections)	Assignments^*
Class	Day	Date	Topic	Readings (sections)	Due	Posting
1	M	8/25	Introduction	1.1, 1.2
2	W		Math review	1.2, 1.3
3	F		C++ & STL review (sub)	1.4-1.6
---	M	9/1	LABOR DAY - NO CLASS
4	W		Math review	1.2, 1.3		HW1
5	F		Data structures review (stacks, queues, lists, arrays)	3
6	M	9/8	Algorithmic analysis	2.1, 2.2, 2.3		Program 1
7	W		Algorithmic analysis
8	F		Algorithmic analysis
---	M	9/15	No class - Instructor travel
9	W		Maximum subsequence sum problem	2.4	HW1	HW2
10	F		Maximum subsequence sum problem	2.4
11	M	9/22	Trees: binary tree, BST	4.2
12	W		Trees		Program 1	Program 2
13	F		Trees	4.3
14	M	9/29	Trees: AVL tree
15	W		Trees	4.4	HW2	HW3
16	F		Trees: B-tree
17	M	10/6	Trees	4.7
18	W		Priority queues: Binary heap, Binomial heap	6.3, 6.8
19	F		Priority queues
20	M	10/13	Midterm Review		HW3
21	W		Midterm I
22	F		Priority queues		Program 2	Program 3
23	M	10/20	Priority queues +Midterm discussion
24	W		Priority queues			HW4
25	F		Priority queues, Hashing	5.1 to 5.6
26	M	10/27	Hashing
27	W		Disjoint sets: Union-find	8.1 - 8.5
28	F		Disjoint sets
29	M	11/3	Sorting: Insertion sort	7.2	HW4	HW5
30	W		Sorting: Heap sort, Merge sort	7.5, 7.6
31	F		Sorting: Quick sort	7.7
32	M	11/10	Sorting	7.7	Program 3	Program 4
33	W		Sorting: Lower bound	7.9
34	F		Sorting: External sorting	7.11
35	M	11/17	Midterm Review	9.2	HW5	HW6
36	W		Midterm II
37	F		Graphs: shortest path	9.3
---	M	11/24	THANKSGIVING WEEK - NO CLASSES
---	W
---	F
38	M	12/1	Graphs:		Program 4
39	W		Graphs: minimum spanning tree	9.4
40	F		Graphs
41	M	12/8	String data structure: Suffix tree	lecture notes	HW6
42	W		Course Review	lecture notes
43	F		Open in-class Discussion/Q&A
---	M	12/15	FINAL EXAM WEEK Tuesday 8-10am
---	W
---	F