Calendar and Lecture Slides

CSE 326 - Autumn 2006

(All future topics and dates subject to change)

Week of	Monday	Wednesday	Thursday - Section	Friday	Reading
Sept. 25	NO CLASS	Introduction, Stacks and Queues Project 1 released	Intro	Asymptotic analysis, Big-O	Chapters 1, 3 & 2
Oct 2	Asymptotic analysis, Big-O	Priority queues & Binary heaps Homework 1 released	Big-O	Binary heaps	Chapter 6
Oct 9	D-heaps & Leftist heaps	Skew Heaps and Binomial Queues Project 1 due	Amortized analysis, BSTs, heaps	Binary search trees Project 2(part A) released	Chapter 6, 4
Oct 16	AVL trees Homework 1 due	Splay Trees	AVL trees, search algorithms	Splay Trees, Memory Hierarchy Project 2 (A) due Sunday@10AM	Chapter 4
Oct 23	B-Trees	Review:	Midterm Review	MIDTERM	Chapter 4
Oct 30	Midterm post mortem	Hashing I Project 2 (phase B) due	Midterms Returned	Disjoint Sets ADT Homework 2 released	Chapter 5
Nov 6	Disjoint Sets II Project 3 released	Sorting I	Hashing, Sets, Project #3	HOLIDAY – Veterans Day	Chapters 8 & 7
Nov 13	Sorting II Homework 2 due at beginning of lecture	Graph representations Topological Sort	Project #3, Sorting	Topological Sort Shortest Path Project 3 - in progress checkin	Chapters 7 & 9
Nov 20	Dijkstra’s Algorithm	Transport Algorithms	HOLIDAY – Thanksgiving	HOLIDAY – Thanksgiving	Chapter 9
Nov 27	Minimum spanning trees Homework 3 released	Kruskal's algorithm	Project 3 due - Thurs Nov 30	Prim's algorithm	Chapter 9
Dec 4	Shortest Path & Huffman Coding	Final Review Homework 3 due	Final Review	Data Structures in Compilers	Chapter 10
FINAL EXAM - Wednesday December 13, 2006 2:30pm-4:20pm Location: EE1-037

CREDITS

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