CSC 252 Algorithms Schedule

Wk	Date	Month	Day	Topic	Chapter	Assign. Due	Assign. Out
0	6	Sep	Fri	Overview	1		Assignment 0
1	9		Mon	Analysis
	11		Wed	Analysis		0	Assignment 1
	13		Fri	Analysis
2	16		Mon	Data Structures	2
	18		Wed	Data Structures		1	Assignment 2
	20		Fri	Trees
3	23		Mon	Priority Queues	2
	25		Wed	Heap Sort Japan Applet Mexico Applet Hawaii Applet		2	Assignment 3
	27		Fri	A2 review
4	30		Mon	Mountain Day!
	2	Oct	Wed	Hash Tables Linux Kernel Hash Tables			Assignment 4
	4		Fri	Hash Table Applet Binary Search Binary Search Trees BST Applet	3	3
5	7		Mon	AVL Trees AVL Applet
	9		Wed	Splay Trees Splay Tree Applet Skip Lists Skip List Applet1 Skip List Applet2			5+6=MidTerm
	11		Fri	A3 review		4
6	12		Mon	Autumn Break	4
	16		Wed	Merge Sort CMU Applet1 Toronto Applet2 Hawaii Applet3
	18		Fri	Quick Sort Princeton Applet Hawaii Applet A4 review
7	21		Mon	[Midterm work]
	23		Wed	Sorting Lower Bound Paper Discussion	4	MidTerm
	25		Fri	Techniques: Greedy & Knapsack Problem	5
8	28		Mon	Midterm review
	30		Wed	D.&C.: Partitioning			Assignment 7
	1	Nov	Fri	Dynamic Programming
9	4		Mon	Dynamic Programming
	6		Wed	Partitioning problems		A7	Assignment 8
	7		Fri	Partitioning (end); Graph Representations	6
10	11		Mon	Review of A7; Transitive Closure
	13		Wed	DFS & BFS		A8	Assignment 9
	15		Fri	DIMACS Workshop on Computational Geometry, Rutgers, NJ
11	18		Mon	DFS Mazes	7
	20		Wed	GW Applets BFS		A9
	22		Fri	Disjkstra's Algorithm Japan Applet
12	25		Mon	MST		Paper topic
	27		Wed	Thanksgiving
	29		Fri	Thanksgiving
13	2	Dec	Mon	NP-completeness Clay Inst. Problems	13
	4		Wed	NP-completeness: Poly. Reductions PushPush is NP-hard
	6		Fri	Japan Conference on Discrete and Computation Geometry, Tokyo, Japan
14	9		Mon
	11		Wed	Undecidability		10+11=Paper

	17-20			Final Exam Answers		12+13=final