Calendar and Lecture Slides
CSE 373 - Autumn 2009

Links to slides used in lecture. (All future topics and dates subject to change.)

Week of	Monday	Wednesday	Thursday	Friday	Reading
Sept 28	No Class	Introduction	-	Lists, Stacks and Queues Applets: Circular array queue	Chapters 1, 2 & 3
Oct 5	Asymptotic Analysis I	Asymptotic Analysis II	HW 1 due (11:45pm)	Trees	Chapter 4
Oct 12	AVL Trees Applets: Trees	B Trees		HW 2 due at the beginning of lecture B Trees (no new slides)	Chapter 4
Oct 19	Priority Queues: Binary min heaps	Binary Min Heaps		MIDTERM I (Oct 23)	Chapter 6
Oct 26	Midterm postmortem and Hashing I	Hashing II		Hashing III	Chapter 5
Nov 2	Sorting I	Sorting II	HW 3 due (11:45pm)	Sorting III (no new slides)	Chapter 7
Nov 9	Sorting III Applet: Sorting Algorithms	Veterans Day NO CLASS		HW 4 due at the beginning of lecture Disjoint Sets	Chapter 7 & 8
Nov 16	MIDTERM II (Nov 16)	Disjoint Sets II		Disjoint Sets III (no new slides)	Section 8
Nov 23	Graphs I	Graphs II (no new slides)		Thanksgiving NO CLASS	Chapter 9
Nov 30	MST I	MST II (no new slides)	HW 5 due (11:45pm)	Network Flow	Chapter 9
Dec 7	Final Review	Final Review (no new slides)		MIDTERM III (Good luck Everyone!) (Dec 11)

CREDITS

Lecture slides borrow heavily from those used in previous offerings on cse373, who in turn borrowed from previous offerings, etc.