Data Structures Lectures for Fall 2017
|
Lecture |
Date |
Topics |
Resources |
In-Class Questions |
|---|---|---|---|---|
|
01 |
Aug 22 |
Ch 1: Python Review |
||
|
02 |
Aug 24 |
Ch. 2: Algorithm Analysis; Big-oh; timing |
||
|
03 |
Aug 29 |
Ch. 2: Performance of Python Built-in data structures |
More algorithm and built-in data structures analysis questions |
|
|
04 |
Aug 31 |
Ch. 3: Linear data structures; stack implementations |
||
|
05 |
Sep 5 |
Stack applications; Queue implementations |
||
|
06 |
Sep 7 |
Queue applications; Deque |
||
|
07 |
Sep 12 |
Ch. 6.6: Priority Queue: binary heap implementation |
||
|
08 |
Sep 14 |
Unordered Lists implementations |
||
|
09 |
Sep 19 |
Ordered List implementation Ch. 4: Recursion: fibonacci example |
||
|
10 |
Sep 21 |
Ch. 4: Recursion continued |
||
|
11 |
Sep 26 |
Review for Test 1
|
||
|
12 |
Sep 28 |
Test 1: Chapters 1 - 3 |
||
|
|
Oct 3 |
Recursion examples: backtracking coin-change problem an dynamic programming |
||
|
14 |
Oct 5 |
Ch. 5: Searching: linear and binary search |
||
|
15 |
Oct 10 |
Searching: hashing: chaining/closed addressing implementations |
||
|
16 |
Oct 12 |
Hashing implementations: open addressing implementations; Simple sorts: bubble, selecton, and insertion sorts; |
||
|
17 |
Oct 17 |
Advanced sorts: heap, merge, and quick sorts |
||
|
18 |
Oct 19 |
Ch. 6: tree terminology, binary tree implementation, traversals, parse tree application |
||
|
19 |
Oct 24 |
Binary Search Tree implementation |
||
|
20 |
Oct 26 |
Binary Search Tree delete method |
||
|
21 |
Oct 31 |
Review for Test 2 |
|
|
|
22 |
Nov 2 |
Test 2: Chapters 4 – 5 |
||
|
23 |
Nov 7 |
AVL trees |
||
|
24 |
Nov 9 |
File Structures vs. Data Structures |
||
|
25 |
Nov 14 |
Ch. 7: Graph terminology, traversals (BFS and DFS) |
||
|
26 |
Nov 16 |
Graph implementations, Graph algorithm: topological sort |
||
|
27 |
Nov 28 |
Graph algorithms: Dijkstra’s algorithm, Prim's Algorithm |
Code mostly from lecture: |
|
|
28 |
Nov 30 |
Graph algorithms: Traveling Salesperson Problem (TSP) |
||
|
29 |
Dec 5 |
Approximation algorithm for TSP |
||
|
30 |
Dec 7 |
Review for Final Exam |
||
|
Final Exam, Tuesday (Dec 12) 8:00-9:50 AM in Wright 9 |
||||