Data Structures Lectures for Spring 2010
Lecture 
Date 
Topics 
Overheads 
Handouts 

01 
Jan 12 
Data structures overview and introduction to classes/objects 

02 
Jan 14 
“Advanced” class stuff: static members, friends, operator overloading 

03 
Jan 19 
“Advanced” class stuff: practice with IntArray class 

04 
Jan 21 
Exceptions and computational complexity 

05 
Jan 26 
Algorithm analysis for computational complexity 

06 
Jan 28 
Finish algorithm analysis 


07 
Feb 02 
Template classes, C++ STL (standard template library) 

08 
Feb 04 
Singlylinked list 

09 
Feb 09 
Singlylinked list Implementation 


10 
Feb 11 
Stack and Queue Implementations 


11 
Feb 16 
Priority Queue via Binary Heap Implementations 


12 
Feb 18 
Heap sort and recursion “review” 

13 
Feb 23 
Review for Test 1 


14 
Feb 25 
Test 1 

15 
Mar 02 
Recursive Implementations: binary search, merge sort, quick sort 


16 
Mar 04 
Recursive backtracking and dynamic programming 


17 
Mar 09 
Binary Search Trees, BST 

18 
Mar 11 
NO CLASS – AT A CONFERENCE 


Spring Break March 1519 

19 
Mar 23 
AVL Trees 


20 
Mar 25 
Hashing Introduction and Openaddress rehashing 

21 
Mar 30 
Review for Test 2 


22 
Apr 01 
Test 2 


23 
Apr 06 
Hashing Openaddress rehashing and passing functions as parameters 


24 
Apr 08 
Return Test 2, discuss virtual memory, magnetic disk organization 


25 
Apr 13 
File data structures: Hashing and B+ Trees 

26 
Apr 15 
B+ Trees and Graph representation 


27 
Apr 20 
Graph Traversals and Dijkstra's shortest path algorithm 


28 
Apr 22 
Graph Algorithms 


29 
Apr 27 
Graph Algorithms – topological sort 

30 
Apr 29 
Review for Final Exam 


Final Exam, Tuesday (May 4) 89:50 AM in ITT 322 