Tentative Schedule

 


date	subject		topics			pages		deadlines
----	-------		------			-----		---------
9/3	Preliminaries	course overview		---
9/5	"		Modula-3 programming	H:1-130		MP1 out

9/8	"		top-down design		S:81-91
9/10	Data Structures	elementary data structs	S:1-17
9/12	"		stacks and queues	S:18-29

Recitations start this week
9/15	Linked Lists	ptrs & dynamic storage	H:175-182	MP1 in
9/17	"		linked stacks & queues	S:29-34		MP2 out
9/19	"		list insertion/deletion	H:182-193

9/22	"		recursion		S:51-65
9/24	Programming	simulations		---
9/26	"		exceptions		H:131-144

9/29	"		interfaces and modules	H:145-157
10/1	Thursday schedule (no class)
10/3	Rosh Hashanah (no class)

10/6	"		abstract data types	H:157-161	MP2 in
10/8	Review/Catchup
10/10	Midterm 1		

10/13	OOP		generics		H:163-171	MP3 out
10/15	"		object-orientation	H:195-216
10/17	"		inheritance/polymorphsm	H:217-226

10/20	Sorting		asymptotics		S:67-80
10/22	"		why sorting?		---
10/24	"		insertion/selection srt	S:93-100

10/27	"		quicksort		S:115-120	MP3 in
10/29	"		quicksort analysis	S:120-131	MP4 out
10/31	"		priority queues		S:145-153

11/3	"		heapsort		S:153-161
11/5	"		mergesort		S:163-176
11/7	Searching	linear/binary search	S:193-203

11/10	"		binary trees		S:203-209
11/12	"		traversing trees	S:60-61
11/14	"		building binary trees	S:209-213	MP4 in

11/17	Review/Catchup
11/19	Midterm 2
11/21	Balanced trees	red-black trees		S:215-223

11/24	"		rotations		S:223-229	MP5 out
11/26	"		splay trees		---
11/28	Thanksgiving (no class)

12/1	Hashing		hash tables		S:231-234
12/3	"		hash functions		S:234-244
12/5	Graphs		applications		S:415-418

12/8	"		data structures		S:418-423
12/10	"		traversals		S:423-435
12/12	Review/Catchup						MP5 in

12/15	Final Exam: 8:30-11:30AM

H: - Readings from Harbrison 		S: - Readings from Sedgewick