Syllabus and Schedule

		TOPIC 						Handout		Due
March 
	31	Intro, Analysis, Max subsequence

April
	2	Max Subsequence, Worst-case analysis		Ex 1

	7	Bi-Oh notation, Asymptotics		
	9	Sets ADT, lists, queues						Ex 1 DUE			

	14   	Hash functions, and Hashing		
	16	Analysis of Hashing,  Bloom Filters		Ex 2

	21	Heaps, and d-heaps				Prog 1
	23 	Review -- no lecture 						Ex 2 DUE

	28	leftist heaps, Search Trees.		
	30	EXAM #1


May

	5	Binary Search Trees 						Prog 1 DUE
	7	Balanced Search Trees (AVL)			Ex 3

	12	AVL Trees operations/analysis
	14	Splay Trees 					Prog 2		Ex 3

	19	B-Trees
	21	B-Trees, insert/delete				Ex 4

	26	Union Find Data structure		
	28 	Graph Algorithms 						Ex 4 DUE
										Prog 2 DUE


June
	2	Graph Algorithms
	4	EXAM #2