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