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

01 
Aug 25 
Ch 1: Python Review 


02 
Aug 27 
Ch. 2: Algorithm Analysis; Bigoh; timing 


03 
Sep 1 
Ch. 2: Performance of Python Builtin data structures 

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


05 
Sep 8 
Stack applications; Queue implementations 


06 
Sep 10 
Queue applications; Deque 


07 
Sep 15 
Ch. 6.6: Priority Queue: binary heap implementation 


08 
Sep 17 
Unordered Lists implementations 

09 
Sep 22 
Ordered List implementation Ch. 4: Recursion: fibonacci example 


10 
Sep 24 
Ch. 4: Recursion continued 


11 
Sep 29 
Review for Test 1 


12 
Oct 1 
Test 1: Chapters 1  3 

13 
Oct 6 
Recursion examples: backtracking coinchange problem an dynamic programming 


14 
Oct 8 
Ch. 5: Searching: linear and binary search 

15 
Oct 13 
Searching: hashing: chaining/closed addressing implementations 


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


17 
Oct 20 
Advanced sorts: heap, merge, and quick sorts 


18 
Oct 22 
Ch. 6: tree terminology, binary tree implementation, traversals, parse tree application 


19 
Oct 27 
Binary Search Tree implementation 


20 
Oct 29 
Binary Search Tree delete method 


21 
Nov 3 
Review for Test 2 

22 
Nov 5 
Test 2: Chapters 4 – 5 

23 
Nov 10 
AVL trees 


24 
Nov 12 
File Structures vs. Data Structures 

25 
Nov 17 
Ch. 7: Graph terminology, traversals (BFS and DFS) 


26 
Nov 19 
Graph implementations, Graph algorithm: topological sort 


27 
Dec 1 
Graph algorithms: Dijkstra’s algorithm, Prim's Algorithm 
Code from lecture: 

28 
Dec 3 
Graph algorithms: Traveling Salesperson Problem (TSP) 


29 
Dec 8 
Review for Final Exam 

30 
Dec 10 
Review for Final Exam 


Final Exam, Tuesday (Dec. 15) 8:009:50 AM in ITT 328 