Calendar and Lecture Slides
CSE 373 - Winter 2009

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

Week of	Monday	Wednesday	Thursday	Friday	Reading
Jan 5	Introduction	Stacks and Queues & Math Review		Asymptotic Analysis I	Chapters 1, 2 & 3
Jan 12	Asymptotic Analysis II	Trees	HW 1 due (11:45pm)	AVL trees	Chapter 4
Jan 19	MLK Day NO CLASS	AVL Trees (no new slides)		HW 2 due at the beginning of lecture AVL Trees: (Proof & Extra Slides, Ans#1, Ans#2, Ans#3) & Priority Queues Intro: Binary min heaps	Chapter 4 & Chapter 6
Jan 26	Priority Queues: Binary min heaps (no new slides)	Binary Min Heaps & D-heaps (no new slides)		MIDTERM I (Jan 30)	Chapter 6
Feb 2	D-heaps& Leftist heaps	Leftist heaps & Skew Heaps	HW 3 due (11:45pm)	Disjoint Sets	Chapter 6 & 8
Feb 9	Disjoint Sets II	Hashing I		HW 4 due at the beginning of lecture Hashing II (no new slides)	Chapter 8 & 5
Feb 16	Presidents Day NO CLASS	Hashing (no new slides) (Ans #1)		Memory Hierarchy	Chapter 5
Feb 23	B-trees HW 5 due Tues Jan 24 (11:45pm)	B-trees (no new slides)		MIDTERM II (Feb 27)	Section 4.7
March 2	Graphs: Representations & Topological Sort	Graphs: Dijkstra’s Algorithm (Ans #1 - note order for 2 and 4 could be reversed)		Graphs: MSTs - Kruskal's & Prim's algorithms	Chapter 9
March 9	Sorting I	Sorting II (Recurrence Relations Solved)	HW 6/7 due (11:45pm)	Last Day of Class (Ans to RadixSort )	Chapter 7
March 16	Final Exam: Tuesday, March 17, 2009 2:30-4:20 p.m.

CREDITS

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