SCHEDULE FOR CPT S 223

SCHEDULE FOR CPT S 223 (FALL 2009)

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

** Due dates for assignments will be posted along with the posting of the respective assignments

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