Calendar and Lecture Slides

CSE 326 - Winter 2008

Links to original slides and slides after use in lecture.
The original slides are pdf files, 4 slides per page, and should print fine as is. These should be posted no later than lunchtime on the day of the lecture.
The slides from lecture are collections of image files, one per page. The claim is that they can be printed 4-up in landscape mode to save paper.

(All future topics and dates are a tentative guess and are subject to change. )
Expect links to be broken until slides are posted.

Week of	Monday	Wednesday	Thursday - Section	Friday	Reading
Jan 7	Introduction, Stacks and Queues slides	Asymptotic analysis, Big-O slides Project 1 released	Intro	Asymptotic analysis, Big-O slides from lecture	Chapters 1, 2 & 3
Jan 14	Priority queues & Binary heaps slides	Binary heaps slides from lecture Project 1 due	Heaps	D-heaps & Leftist heaps slides Testing & JUnit slides SimpleArrayList SimpleArrayListTest Homework 1 due	Chapter 6
Jan 21	MLK Day Holiday No Class	Leftist heaps slides from lecture	Heaps	Java Generics slides Homework 2 due	Chapter 6
Jan 28	Skew Heaps Binomial Queues slides slides from lecture	Binary Search Trees slides slides from lecture Project 2A due	Trees, search algorithms	AVL trees slides Homework 3 due	Chapter 4
Feb 4	AVL trees slides from lecture	Midterm Review topic list slides old midterms: wi06 wi07 sp07	Midterm Review	MIDTERM	Chapter 4
Feb 11	Splay trees slides slides from lecture	B-Trees slides Project 2B due	Midterms Returned & Discussed, B-Trees	B-trees (concl) slides from lecture Hashing slides Project 3 posted Homework 4 due	Chapter 4, 5
Feb 18	Presidents Day Holiday No Class	Hashing slides from lecture Sorting slides	Hashing, Sets, Project #3	Sorting Homework 5 due	Chapters 5, 8
Feb 25	Sorting (concl) slides from lecture	Disjoint sets - union/find slides	Project #3, Sorting	Union/find (concl.) slides from lecture Graphs/Topological sort slides slides from lecture Homework 6 due	Chapters 7 & 9
Mar 3	Shortest path algorithms Dijkstra's algorithm slides ewd archive at utexas	Dijkstra's algorithm slides from lecture Minimum spanning trees slides Project 3 – Code due	Project 3 Graphs	Kruskal's algorithm Prim's algorithm slides from lecture Homework7 due	Chapter 9
Mar 10	Floyd-Warshall algorithm slides slides from lecture Ackerman's function slides grafitti from lecture	Hard problems slides Project 3 – Benchmarking, etc. due	Final Review	Final Review topic list old finals: wi07 sp07 slides Homework 8 due	Chapter 10
Last-minute (well, almost) exam review: Monday, March 17, 4:30-5:30+ pm, CSE 503 FINAL EXAM: Tuesday, March. 18, 2:30-4:20 pm

CREDITS

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