Data Structures Lectures for Fall 2010
Lecture 
Date 
Topics 
Overheads 
Handouts 

01 
Aug 24 
Algorithm Complexity Analysis 

02 
Aug 26 
Revisit Complexity Analysis, searching 


03 
Aug 31 
Simple sorts: selection, bubble 


04 
Sep 02 
Python “Review” 


05 
Sep 07 
Recursion review, dynamic programming 


06 
Sep 09 
Review classes, pydoc, pyunit testing 


07 
Sep 14 
Collections overview, array vs. linked tradeoffs 

08 
Sep 16 
Stack implementations 

09 
Sep 21 
Queue implementations 

10 
Sep 23 
Stack Applications and Priority Queue implementations 

11 
Sep 28 
Review for Test 1 


12 
Sep 30 
Test 1: Chapters 11 – 14 


13 
Oct 05 
List types and Positional List Implementations 

14 
Oct 07 
Iterators 


15 
Oct 12 
Heap, Merge, and Quick Sorts 


16 
Oct 14 
Quick sort analysis, and coinchange backtracking 


17 
Oct 19 
coinchange dynamic programming 


18 
Oct 21 
Binary Tree terminology and operations 

19 
Oct 26 
Binary Tree and Binary Search Tree implementation 


20 
Oct 28 
Binary Search Tree remove operation and Intro to AVL trees 

21 
Nov 02 
Review for Test 2 


22 
Nov 04 
Test 2: 


23 
Nov 09 
More AVL Tree 


24 
Nov 11 
BST vs. AVL performance; Intro. To hashing 

25 
Nov 16 
Hash table implementations 


26 
Nov 18 
File data structures: Hashing and B+ Trees 

Thanksgiving Break: 11/22 to 11/26 

27 
Nov 30 
Graph Representation 

28 
Dec 01 
Graph Traversals 

29 
Dec 07 
Graph Algorithms: Prim's Min.Spanning Tree and Dijkstra's Shortest Path 


30 
Dec 09 
Review for Final Exam 


Final Exam, Tuesday (December 14) 89:50 AM in ITT 328 