TOPIC	DATE	READING FROM TEXT	NOTES
Course overview	Jan 29, 2008	Ch 1 – Sec 1.1, 1,2	Lecture1 (in PPT)
Recursion	Jan 31, 2008	Ch 1 – Sec 1.3	Lecture2 (in PDF)
Review of c++	Feb 5,2008	Ch 1 – Sec. 1.4 – 1.6	Lecture 3 (in PDF)
Insertion and selection sorting, algorithm analysis	Feb 7, 2008	Ch 2 – Sec 2.1 – 2.3	Lecture 4 (in PDF)
Algorithm analysis (continued)	Feb 12, 2008	Chapter 2 (rest)	Lecture 5 (in PDF)
Linked list	Feb 14, 2008	Ch 3 (Sec 3.1 – 3.5)	Lecture 6 corrected(in PDF)
Linked list (continued), stacks	Feb 19,2008	Ch 3 (3.3 – 3.6)	Lecture 7 (in PDF)
Stack applications – exp evaluation, infix -> postfix	Feb 21, 2008	Ch 3 (3.6)	Lecture 8 (in PDF)
Queue and application to BFS	Feb 26, 2008	Ch 9 (Sec 9.3)	Lecture 9 (in PDF)
Hashing	Feb 28, 2008	Ch 5	Lecture 10 (in PDF)
Hashing (continued)	Mar 4, 2008	Ch 5	Lecture 11 (in PDF)
Mid-semester Test # 1	Mar 6, 2008	All topics covered so far
Hashing (continued)	March 11, 2008	Ch 5	Lecture 11 (in PDF)
Application of hashing (LZW compression algorithm)	March 11, 2008	Notes on LZW algorithm	Lecture 12 (in PDF)
Binary Heap	March 18, 2008	Ch 6	Lecture 13 (in PDF)
Binary heap (continued)	March 20, 2008	Ch 6	Lecture 13 (in PDF)
Binary heap (continued)	April 1, 2008	Ch 6	Lecture 16 (in PDF)
Binary heap applications	April 3, 2008	Ch 6 and handout	Lecture 16
Binary trees – expression tree, tree traversals	April 8, 2008	Ch 4	Lecture 17 (in PDF)
Binary trees – binary search trees, search, insert	April 10, 2008	Ch 4	Lecture 17 (in PDF)
NO CLASS	April 15, 2008
Binary trees (deletion)	April 17, 2008	Ch 4	Lecture 17
AVL trees	April 22, 2008		Lecture 18 (in PDF)
MID-SEMESTER # 2	April 24, 2008
AVL trees (completed)	April 29, 2008	Ch 4	Lecture 19
Rectangle area problem using BST	May 1, 2008		Lecture 20 (in PPT)
Quicksort	May 6, 8 2008	Ch 7	Lecture 21 (in PPT)
Graph representations, DFS	May 13, 2008	Ch 8	Lecture 22
Shortest path problem	May 15, 2008	Ch 8	(contained in Lecture 22 slides)