Tentative Syllabus and Schedule

		TOPIC 					Assignments	
Jan 
	8	Introduction
	10	Universal Hashing

	15	Collision Handling, Theory of Hashing 		HW #1
	17   	Constructing Universal Hash Functions		Prog #1

	22   	Perfect Hashing
	24	Priority Queues

	29	d-Heaps and Leftist Heaps 					HW #1 DUE
	31 	Review HW #1. Search Trees 			HW #2		Prog #1 DUE


Feb
	5 	Balanced Search Trees
	7	*** MIDTERM #1  (in class) ***

	12	AVL Trees 
	14	Splay Trees 					Prog #2		HW #2 DUE

	19	Amortized Analysis 
	21	Graph Algorithms

	26	Applications of DFS 				HW #3
	28	Union Find Data Structure					Prog #2 DUE

Mar
	5	Mininum Spanning trees
	7	Shortest Paths 							HW #3 DUE

	12 	Review and Misc topics
	14	*** Exam 2. (in class) ***