Course schedule

Date	Lecture	Reading (to be done before class)
Week #1
January 12-16	Introduction, policies & procedures, and computing environment
	C++ intro: pointers	Chapters 1 & 2
	C++ intro: memory allocation
Week #2
January 19-23	C++ intro: defining classes	C++ Primer
	C++ intro: templates	C++ Primer
		Quiz #1
	Jan. 23 is last day to ADD/DROP courses
Week #3
January 26-30	C++ intro: destructors C++ intro: inheritance C++ intro: virtual functions	C++ Primer
January 26-30	UML class diagrams LRStruct and BRStruct code design	Chapters 4 & 5
Week #4
February 2-6	Binary Search Tree review	PP1 due Chapter 6 Section 9.1
February 2-6	Algorithm analysis	Chapter 3
Week #5
February 9-13	Algorithm analysis
	AVL trees	Section 9.2
	Splay trees	(lecture notes)
Week #6
February 16-20	Exam (Feb 17)
February 16-20	Priority Queues and heap implementation	Chapter 7 (lecture notes)
Week #7
February 23-27	Exam return
February 23-27	Binomial Heaps	(lecture notes)
Week #8
March 1-5	Hashing introduction	PP2 due (03/01)
	Red-black trees	Sections 9.3-9.5
	March 5 is last day to RESIGN courses
Week #9
March 8-12	Hashing continued	Chapter 8
March 8-12	Hashing continued	Chapter 8
Week #10
March 15-19
March 15-19	SPRING BREAK ! ! !
Week #11
March 22-26	Exam (Mar 23)	Chapters 7, 8 and section 9.5
	More asymptotic notations Proofs of properties of asymptotic notations	Chapter 3
	March 26 is last day to RESIGN courses (for first-semester students ONLY)
Week #12
March 29 - April 2	Sorting review	Chapter 10
March 29 - April 2	Sorting theorem	Chapter 10
Week #13
April 5-9	Graph Algorithms	Chapter 12
April 5-9	Graph Algorithms	Chapter 12
Week #14
April 12-16	Graph Algorithms	Chapter 12
April 12-16	Graph Algorithms	Chapter 12
Week #15
April 19-23	TBA
April 19-23	Final exam review
Week #16
April 26	Monday - no class	PP4 due

Carl G. Alphonce

Last modified: Thu Mar 25 11:39:30 EST 2004