Syllabus and Schedule

		TOPIC 						Handout		Due
Jan 
	4	Intro, Analysis, Max subsequence
	6	Max Subsequence, Worst-case analysis		Ex 1

	11	Bi-Oh notation, Asymptotics		
	13	Sets ADT, lists, queues						Ex 1 DUE			

	18   	Hash functions, and Hashing		
	20	Heaps, and d-heaps 				Ex 2

	25 	** Away at Conference -- No Lecture ** 			
	27	leftist heaps					Prog 1		Ex 2 DUE

Feb

	1	Review HW 1 and 2, Search Trees.		
	3	MidTerm #1

	8	Binary Search Trees 						Prog 1 DUE
	10	Balanced Search Trees (AVL)			Ex 3

	15	Midterm Solutions. Start Splay trees.
	17	Splay Trees and Analysis 			Prog 2		Ex 3

	22	B-Trees
	24	B-Trees, insert/delete

Mar
	1	Union Find Data structure			Ex 4		Prog 2 DUE
	3 	Graph Algorithms 				
										
	8	Graph Algorithms						Ex 4 DUE
	10	EXAM #2