Data Structures Lectures for Fall 2016
Lecture 
Date 
Topics 
Resources 
InClass Questions 

01 
Aug 23 
Ch 1: Python Review 

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

03 
Aug 30 
Ch. 2: Performance of Python Builtin data structures 
More algorithm and builtin data structures analysis questions 

04 
Sep 1 
Ch. 3: Linear data structures; stack implementations 

05 
Sep 6 
Stack applications; Queue implementations 

06 
Sep 8 
Queue applications; Deque 

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

08 
Sep 15 
Unordered Lists implementations 

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

10 
Sep 22 
Ch. 4: Recursion continued 

11 
Sep 27 
Review for Test 1



12 
Sep 29 
Test 1: Chapters 1  3 


Oct 4 
Recursion examples: backtracking coinchange problem an dynamic programming 

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

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

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

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

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

19 
Oct 25 
Binary Search Tree implementation 

20 
Oct 27 
Binary Search Tree delete method 

21 
Nov 1 
Review for Test 2 

22 
Nov 3 
Test 2: Chapters 4 – 5 

23 
Nov 8 
AVL trees 

24 
Nov 10 
File Structures vs. Data Structures 

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

26 
Nov 17 
Graph implementations, Graph algorithm: topological sort 

27 
Nov 29 
Graph algorithms: Dijkstra’s algorithm, Prim's Algorithm 
Code from lecture: 

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

29 
Dec 6 
Approximation algorithm for TSP 

30 
Dec 8 
Review for Final Exam 

Final Exam, Tuesday (December 13) 8:009:50 AM in ITT 328 