Calendar and Lecture Slides

CSE 326 - Winter 2006

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

Week of	Monday	Wednesday	Thursday - Section	Friday	Reading
Jan 2	NO CLASS	Introduction, Stacks and Queues Project 1 released	Intro	Asymptotic analysis, Big-O	Chapters 1, 2 & 3
Jan 9	Asymptotic analysis, Big-O	Priority queues & Binary heaps Homework 1 released	Big-O	Binary heaps Project 1 due	Chapter 6
Jan 16	HOLIDAY – Martin Luther King Day	D-heaps & Leftist heaps	Amortized analysis, BSTs, heaps	Skew Heaps and Binomial Queues	Chapter 6
Jan 23	Binary search trees Project 2(part A) released	AVL trees Homework 1 due	AVL trees, search algorithms	Splay Trees	Chapter 4
Jan 30	Splay Trees, Memory Hierarchy Project 2 (phase A) due - Tues Jan 31	Review: StudentSubmissions-A	Midterm Review	MIDTERM	Chapter 4
Feb 6	B-Trees	Hashing I Project 2 (phase B) due	Midterms Returned & Discussed, B-Trees	Hashing II Homework 2 released	Chapter 5
Feb 13	Disjoint Sets ADT Project 3 released (Tues)	Disjoint Sets II	Hashing, Sets, Project #3	Sorting I	Chapters 8 & 7
Feb 20	HOLIDAY – Presidents Day	Sorting II Homework 2 due at beginning of lecture	Project #3, Sorting	Graph representations Topological Sort	Chapters 7 & 9
Feb 27	Topological Sort Shortest Path Project 3 - in progress checkin, Mon Feb 27 Homework 3 released	Dijkstra’s Algorithm	Project 3 due - Thurs March 2	Minimum spanning trees Kruskal's algorithm Prim's algorithm	Chapter 9
Mar 6	Shortest Path & Huffman Coding	Homework 3 due Final Review Student Submissions-A	Final Review	Data Structures in Compilers	Chapter 10
FINAL EXAM (both sections) - Saturday March 11, 2006 12:30pm-2:30pm Location: EE1-105 (Note this is different than the regular exam slot.)

CREDITS

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