Data Structures Lectures for Spring 2013
Lecture |
Date |
Topics |
Overheads |
Handouts |
---|---|---|---|---|
01 |
Jan 15 |
Ch 1: Python Review |
||
02 |
Jan 17 |
Ch. 2: Algorithm Analysis; Big-oh; timing |
||
03 |
Jan 22 |
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 |
Jan 24 |
Ch. 3: Linear data structures; stack implementations |
|
|
05 |
Jan 29 |
Stack applications; Queue implementations |
|
|
06 |
Jan 31 |
Queue applications; Deque |
|
|
07 |
Feb 5 |
Ch. 6.6: Priority Queue: binary heap implementation |
|
|
08 |
Feb 7 |
Unordered Lists implementations |
|
|
09 |
Feb 12 |
Ordered List implementation Ch. 4: Recursion: fibonacci example |
|
|
10 |
Feb 14 |
Ch. 4: Recursion continued |
|
|
11 |
Feb 19 |
Review for Test 1 |
||
12 |
Feb 21 |
Test 1: Chapters 1 - 3 |
|
|
13 |
Feb 26 |
Recursion examples: backtracking coin-change problem an dynamic programming |
|
|
14 |
Feb 28 |
Ch. 5: Searching: linear and binary search |
||
15 |
Mar 5 |
Searching: hashing: chaining/closed addressing implementations |
|
|
16 |
Mar 7 |
Hashing implementations: open addressing implementations; Simple sorts: bubble, selecton, and insertion sorts; |
|
|
17 |
Mar 12 |
Advanced sorts: heap, merge, and quick sorts |
|
|
18 |
Mar 14 |
Ch. 6: tree terminology, binary tree implementation, traversals, parse tree application |
|
|
Spring Break March 18 to March 22 |
||||
19 |
Mar 26 |
Binary Search Tree implementation |
|
|
20 |
Mar 28 |
Binary Search Tree delete method |
|
|
21 |
Apr 2 |
Review for Test 2 |
||
22 |
Apr 4 |
Test 2: Chapters 4 – 5 |
|
|
23 |
Apr 9 |
AVL trees |
|
|
24 |
Apr 11 |
More AVL trees |
|
|
25 |
Apr 16 |
File Structures vs. Data Structures |
||
26 |
Apr 18 |
Ch. 7: Graph terminology, traversals (BFS and DFS) |
|
|
27 |
Apr 23 |
Graph implementations |
|
|
28 |
Apr 25 |
Graph select algorithms: topological sort, Dijkstra’s algorithm, Prim's Algorithm |
Code from lecture: |
|
29 |
Apr 30 |
Graph algorithms: Traveling Salesperson Problem (TSP) |
|
|
30 |
May 2 |
Review for Final Exam |
||
Final Exam, Thursday (May 9) 10-11:50 AM in ITT 322 |