Calendar and Lecture Slides

CSE 373 - Spring 2008

Links to slides used in lecture.

(All future topics and dates subject to change.)

Week of	Monday	Wednesday	Thursday	Friday	Reading
March 31	Introduction	Stacks and Queues, Asymptotic Analysis		Asymptotic Analysis I	Chapters 1, 2 & 3
April 7	Asymptotic Analysis II	Math & Trees	HW 1 due (11:59pm)	BSTs & AVL trees	Chapter 4
April 14	AVL Trees (Ans #1, Ans #2, Ans #3)	Splay Trees		HW 2 due at beginning of class Splay Trees (Ans #1, Ans #2, Ans#3)	Chapter 4
April 21	Priority Queues: Binary min heaps	MIDTERM I (April 23)		Binary Min Heaps & D-heaps	Chapter 6
April 28	D-heaps, Leftist heaps, & Skew Heaps	Leftist heaps (no new slides)	HW 3 due (11:59pm)	Disjoint Sets	Chapter 6 & 8
May 5	Disjoint Sets II	Memory Hierarchy	HW 4 due (11:59pm)	B-trees	Chapter 8 & 4.7
May 12	B-trees (no new slides)	Hashing I		Hashing II (no new slides) (Ans #1)	Chapter 5
May 19	Graphs: Representations HW 5 due (at beginning of lecture)	Graphs: Topological Sort (no new slides)		MIDTERM II (May23)	Chapter 9
May 26	NO CLASS	Graphs: Dijkstra’s Algorithm (Ans #1 - note order for 2 and 4 could be reversed)		Graphs: Dijkstra’s, Minimum spanning trees, Kruskal's & Prim's algorithms	Chapter 9
June 2	MST: Prim’s & Kruskal’s (no new slides)	Sorting I (Complexity Examples & Ans to RadixSort )		Sorting II (Last Day of Class)	Chapter 7
June 9		Final Exam: Wednesday, Jun 11, 2008 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.