CSE 326 Autumn 2001

Schedule

See also:

Course Requirements and Grading

Homework and Quizzes

Programming Projects

	Monday		Wednesday		Thurs (Section)		Friday (*)	HD	Q	PD
1 Oct	CSE 326 Introduction	3 Oct	Asymptotic Analysis	4 Oct	Unix and g++ Pseudocode guidelines	5 Oct	Analyzing Recursion
8 Oct	Lists, Stacks and Queues	10 Oct	Lists, Stacks and Queues 2	11 Oct	Recurrence equations C++ Templates	12 Oct	Finish: LSQ2 Trees	HW1	Q1
15 Oct	Trees Quiz 1	17 Oct	Finish: Trees Binary Search Trees	18 Oct		19 Oct	Binary Search Trees AVL Trees			P1
22 Oct	AVL Trees AVL deletion AVL depth proof	24 Oct	Splay Trees Adrien’s Tree Animator	25 Oct		26 Oct	B-Trees Quiz 2	HW2	Q2
29 Oct	B-Trees	31 Oct	Heaps	1 Nov		2 Nov	Heaps			P2
5 Nov	Finish: Heaps Start: Hashing	7 Nov	Hashing Hash function calculator	8 Nov		9 Nov	Hashing
12 Nov	Holiday	14 Nov	Finish: Hashing HW3 due, Quiz 3	15 Nov		16 Nov	Graphs	HW3	Q3
19 Nov	Graphs	21 Nov	Disjoint Sets	22 Nov	Holiday	23 Nov	Holiday
26 Nov	Graphs 2	28 Nov	Sorting	29 Nov		30 Nov	Sorting Java Sorting Demos
3 Dec	Randomized Data Structures	5 Dec	M-D Trees HW4 due, Quiz 4	6 Dec	Review	7 Dec	M-D Trees	HW4	Q4	P3
10 Dec	Review	12 Dec	Wrap-up			17 Dec	Final Exam Dec 17 2:30 – 4:20pm

(*) HD=Homework Due Q=Quiz(in-class, 20 minutes) PD=Project Due