Calendar and Lecture Slides
CSE 373 - Spring 2010

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

Week of	Monday	Wednesday	Thursday	Friday	Reading
March 29	Introduction [slides]	Stacks and Queues & Math Review [slides]		Math Review [no new slides]	Chapters 1, 2 & 3
April 5	Asymptotic Analysis I [slides]	Asymptotic Analysis II [no new slides, ink]	HW 1 due (11:45pm)	Dictionaries & Trees [slides, ink]	Chapter 2 & 4 (4.1, 4.2, 4.3)
April 12	AVL Trees [slides, ink] [AVL Proof & Code, ex1, ex2, ex3]	AVL Trees II [no new slides]		HW 2 due at the beginning of lecture Priority Queues Intro: Binary min heaps [slides, ink]	Chapter 4.4 & Chapter 6 (6.1-6.4)
April 19	Binary min heaps & D-heaps [no new slides]	D-heaps & Leftist heaps [slides, ink]		MIDTERM I (April 23)	Chapter 6.3-6.6
April 26	Leftist heaps & Skew Heaps [no new slides]	Disjoint Sets [slides, ink]	HW 3 due (11:45pm)	Disjoint Sets II [no new slides]	Chapter 6.6-6.7, Chapter 8
May 3	Disjoint Sets & Hashing Intro [slides, ink]	Hashing I [no new slides]		HW 4 due at the beginning of lecture Hashing II [no new slides]	Chapter 5.1-5.6
May 10	Memory Hierarchy [slides, ink]	B-trees [slides, ink, example]		B-trees II [no new slides]	Section 4.7
May 17	Graphs: Representations & Topological Sort [slides, ink]	MIDTERM II (May 19)	HW 5 due (11:45pm)	Graphs: Topological Sort [no new slides]	Chapter 9 (9.1-9.3)
May 24	Graphs: Dijkstra’s Algorithm [slides, ink, Examples]	Graphs: MSTs - Kruskal's & Prim's algorithms [slides, ink]		(HW 6/7 – Part I recommended due date – nothing to turn in) Sorting I [slides, ink, recurrence relations, radix sort example]	Chapter 9 (9.5), Chapter 7
May 31	Memorial Day - NO CLASS	Sorting II	HW 6/7 due (11:45pm)	Last Day of Class	Chapter 7 (7.1-7.9)
June 7		Final Exam: Wednesday, June 9, 2010 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.