Data Structures Lectures for Spring 2015
Lecture 
Date 
Topics 
Files 
InClass Questions 

01 
Jan 13 
Ch 1: Python Review 


02 
Jan 15 
Ch. 2: Algorithm Analysis; Bigoh; timing 


03 
Jan 20 
Ch. 2: Performance of Python Builtin data structures 

More algorithm and builtin data structures analysis questions 
04 
Jan 22 
Ch. 3: Linear data structures; stack implementations 


05 
Jan 27 
Stack applications; Queue implementations 


06 
Jan 29 
Queue applications; Deque 


07 
Feb 3 
Ch. 6.6: Priority Queue: binary heap implementation 


08 
Feb 5 
Unordered Lists implementations 

09 
Feb 10 
Ordered List implementation Ch. 4: Recursion: fibonacci example 


10 
Feb 12 
Ch. 4: Recursion continued 


11 
Feb 17 
Review for Test 1 


12 
Feb 19 
Test 1: Chapters 1  3 

13 
Feb 24 
Recursion examples: backtracking coinchange problem an dynamic programming 


14 
Feb 26 
Ch. 5: Searching: linear and binary search 

15 
March 3 
Searching: hashing: chaining/closed addressing implementations 


16 
March 5 
Hashing implementations: open addressing implementations; Simple sorts: bubble, selecton, and insertion sorts; 


17 
March 10 
Advanced sorts: heap, merge, and quick sorts 


18 
March 12 
Ch. 6: tree terminology, binary tree implementation, traversals, parse tree application 


Spring Break March 16 to March 20 

19 
March 24 
Binary Search Tree implementation 


20 
March 26 
Binary Search Tree delete method 


21 
March 31 
Review for Test 2 

22 
April 2 
Test 2: Chapters 4 – 5 

23 
April 7 
AVL trees 


24 
April 9 
File Structures vs. Data Structures 

25 
April 14 
Ch. 7: Graph terminology, traversals (BFS and DFS) 


26 
April 16 
Graph implementations, Graph algorithm: topological sort 


27 
April 21 
Graph algorithms: Dijkstra’s algorithm, Prim's Algorithm 
Code from lecture: 

28 
April 23 
Graph algorithms: Traveling Salesperson Problem (TSP) 


29 
April 28 
Review for Final Exam 


30 
April 30 
Review for Final Exam 


Final Exam, Tuesday (May 5) 8:009:50 AM in ITT 328 