CSE 326 -- Summer 2003 -- Calendar

CSE 326: Data Structures

Summer 2003

All dates and topics are subject to change, check back frequently!

Week of	Monday	Wednesday	Thursday	Friday
June 23	Introduction Stacks and Queues Homework 1 released	Asymptotic analysis Big-O	Read 1.1-1.3, 4.1, Chapters 2 & 3 in text	Priority queues & heaps Binary heap Homework 2 released
June 30	More heaps Leftist, Skew, & d-heaps Homework 1 due	More heaps Leftist, Skew, & d-heaps	Read Chapter 6 in text	HOLIDAY!!!
July 7	Trees Binary search trees Homework 2 due Homework 3(part A) released	AVL trees Homework 3(part B) released	Read Chapters 4 in text	Splay Trees
July 14	Finish splay trees. B-Trees Homework 3 due (Tuesday at 11 p.m.)	B-trees Homework 4 released	Read Chapter 5 in text	Finish B-trees Start Hashing
July 21	Open and closed hashing	Finish Hashing MazeRunner competition awards! Midterm review Homework 4 due Homework 5 released	Read Chapter 8 in text Midterm review	MIDTERM
July 28	Disjoint Sets ADT	Sorting Comparison based sorting	Read Chapter 7 in text	Radix sorting
August 4	Graphs Topological sort Homework 5 due (Tuesday at 11 p.m.)	Graph searching Shortest path algorithms Dijkstra's algorithm Homework 6 released	Read Chapter 9 in text except skip 9.4, skim 9.6	Minimum spanning trees Kruskal's algorithm Prim's algorithm
August 11	Randomized data structures & algorithms Treaps, Skip lists Primality checking Homework 7 released	Multidimensional search trees k-d trees, quad trees (no handouts)	Read Chapters 10 & 12 in text	Becoming famous with P and NP
August 18	Greedy Algorithms Divide & Conquer Dynamic Programming Homework 6 due (Tuesday at 11 p.m.)	Review	Review	FINAL EXAM

CREDITS

Most of the lecture slides presented here were originally developed by Steve Wolfman for Winter 2000 CSE 326, later modified by Bart Niswonger, Hannah Tang, Brian Tjaden, and even a few current professors. Rajesh Rao crafted a new set of slides for Winter 2003; these slides are cited where used.

cse326-staff@cs.washington.edu