Calendar and Lecture Slides

CSE 326 - Autumn 2007

(All future topics and dates subject to change)

Week of	Monday	Wednesday	Thursday - Section	Friday	Reading
Sept. 24	NO CLASS	Introduction, Stacks and Queues Project 1 released	Intro	Asymptotic analysis, Big-O	Chapters 1, 3 & 2
Oct 1	Asymptotic analysis, Big-O	Priority queues & Binary heaps	Big-O, Induction	Binary heaps, d-heaps Homework 1 Due	Chapter 6
Oct 8	Leftist Heaps, Skew Heaps	Binomial Queues Project 2a released Project 1 due	Leftist, Skew heaps, Binomial Queues	Binary search trees Homework 2 Due	Chapter 6, 4
Oct 15	AVL trees	Splay Trees	AVL trees, Splay Trees	B-Trees Homework 3 Due	Chapter 4
Oct 22	k-d trees	Review Project 2b released Project 2a due	Midterm Review	MIDTERM	Chapter 4
Oct 29	Hashing I	Midterm Post-Mortem	CELT Mid-Course Feedback Session	Disjoint Sets ADT Homework 4 Due	Chapter 5
Nov 5	Disjoint Sets II	Sorting I Project 3 released Project 2b due	Hashing, Sets, HW Questions	Sorting II Homework 5 Due	Chapters 8 & 7
Nov 12	HOLIDAY – Veterans Day	Graph representations Topological Sort	Sorting, Graphs, HW Questions	Graph Traversals Shortest Path Homework 6 Due	Chapters 7 & 9
Nov 19	Dijkstra’s Algorithm	A* and Floyd-Warshall Algorithms	HOLIDAY – Thanksgiving	HOLIDAY – Thanksgiving	Chapter 9
Nov 26	Network Flow	Spanning Trees Project 3 Code due		Data Compresson Homework 7 Due	Chapter 9
Dec 3	No Lecture	Final Review Project 3 Benchmarking / Readme due	Final Review	NP-Completeness	Chapter 10
FINAL EXAM: Wednesday, December 12, 2007, 2:30-4:20 PM Location: ARC 160

CREDITS

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