Syllabus and Schedule

		TOPIC 						Homework
October
	1	Intro, Analysis, Max subsequence 	Exercise Set 1
	3	Max Subsequence, Worst-case analysis

	8	Bi-Oh notation, Asymptotics		Exercise Set 2
	10	Sets ADT, lists, queues			

	15   	Hash functions, and Hashing		Exercise Set 3
	26	Analysis of Hashing,  Bloom Filters	

	22	Heaps, and d-heaps			Exercise Set 4
	24 	leftist heaps, Search Trees.		
	
	29	Binary Search Trees 			No assignment 
	31	*** EXAM 1 ***

NOVEMBER

	5	Exam Solution Review 			Exercise Set 5-6
	7	B-Trees I (Shiyuan)

	12	NO CLASS (official holiday) 
	14	B-Trees, insert/delete

	19	Union Find Data structure		Exercise Set 7
	21 	Graphs, Spanning Tree			Prog Assignment #2

	28	Topological Sort, Shortest Paths


DECEMBER
	3 	Balanced Search Trees (AVL)

	5	EXAM 2


	Practice Problems: 
	Chapter 8: 1, 2, 4, 11
	Chapter 9: 1, 6, 7a, 16,