TOPIC 
DATE 

NOTES 
Course overview 
Aug 26, 2008 
Ch 1 – Sec 1.1, 1,2 

recursion 
Aug 28, 2008 
Ch 2 

Overview of c++, more examples of recursion 
Sept 2, 3008 
Ch 1 

Insertion sorting and algorithm analysis 
Sept 4, 2008 
Ch 1 and 2 

Analysis of Selection sorting, image filtering 
Sept 9, 2008 
Ch 2 

List class, subset generation using vector of lists 
Sept 11, 2008 
Ch 3 – Sec 3.1 – 3.5 

List functions, Stack overview 
Sept 16, 2008 
Ch 3  Sec 3.6 

Stack –implementation and applications 
Sept 18, 2008 
Ch 3 – Sec 3.7 
Lecture 8 (see below) 
Infix to postfix conversion 
Sept 23, 2008 
Ch 3 – Sec 3.7 

Queues and BFS 
Sept 25, 2008 
Ch 9 – Sec 9.3 

Hashing  1 
Sept 30, 2008 
Ch 5 

Hashing – 2 
Oct 2, 2008 
Ch 5 

Hashing  3 
Oct 7, 2008 

Lecture 12 
Midsemester Test # 1 
Oct 9, 2008 


Hashing  4 
Oct 14, 2008 
Ch 5 
Lecture 12 
Hashing  5 
Oct 16, 2008 


Priority queue 
Oct 21, 2008 
Ch 6 

Binary heap – height, insert and deletemin 
Oct 23, 2008 
Ch 6 
Lecture 16 
Binary heap – other operations, heap sorting, application to a scheduling problem 
Oct 28, 2008 
Ch 6 

Binary trees 
Nov 4, 2008 
Ch 5 

Expression trees, tree traversals, binary search tree 
Nov 6, 2008 

Lecture 20 
MIDSEMESTER TEST # 2 
Nov 13, 2008 


Binary search tree operations 
Nov 18, 2008 

Lecture 21

Balanced binary search tree 
Nov 20, 2008 


Application of binary search trees 
Nov 25, Dec 4 2008 


Quick sort and bucket sort 
Dec 9, 2008 


Shortest path in graph, Dijkstra's algorithm 
Dec 11, 12 2008 









