Calendar and Lecture Slides

CSE 373 - Spring 2007

Links to slides used in lecture. Slides and ink tend to print well in landscape mode, with 4 slides per page.

(All future topics and dates subject to change.)

Week of	Monday	Wednesday	Friday	Reading
March 26	Introduction	Stacks and Queues, Asymptotic Analysis	Asymptotic Analysis	Chapters 1, 2 & 3
April 2	Asymptotic Analysis, Math Fundamentals	Trees Assignment 1 due - Prog	AVL trees	Chapter 4
April 9	AVL & Splay Trees	Priority Queues (Binary min heaps ) Assignment 2 due	Splay Trees	Chapter 4 & 6
April 16	Binary min heaps	D-heaps & Review	MIDTERM I (April 20)	Chapter 6
April 23	Leftist heaps & Skew Heaps	Binomial Queues	Disjoint Sets	Chapter 6 & 8
April 30	Disjoint Sets II	Memory Hierarchy Assignment 3 due	Hashing I	Chapter 8 & 5
May 7	Hashing II	Hashing III Assignment 4 due	B-trees	Chapter 5 & 4.7
May 14	Graphs: Representations	Graphs: Topological Sort & Review Assignment 5 due	MIDTERM II (May18)	Chapter 9
May 21	Graphs: Dijkstra’s Algorithm	Graphs: Dijkstra’s, Minimum spanning trees, Kruskal's & Prim's algorithms (Assignment 6 & 7 – part I suggested due date)	Sorting I	Chapter 9 & 7
May 28	NO CLASS	Sorting II Assignment 6 & 7 due	Final Review (Last Day of Class)	Chapter 7
June 4		Final Exam: Wednesday, June 6, 2:30-4:20 p.m.

Final Exam: Wednesday, June 6, 2:30-4:20 p.m.

Old List of slides (no longer updated): here

CREDITS

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