| 2016 | Tuesday | Thursday | Sunday (due 11:59pm) |
| Jan 12,14,17 | Text: course syllabus |
Text: Weiss Ch. 1,2,3
PPT: Abstract Data Types |
... |
| Jan 19,21,24 |
Text:
Weiss Ch. 3
Notes: Using ML |
PPT: Lists, Stacks, Queues | ... |
| Jan 26,28,31 |
Text: Weiss Ch. 2
PPT: Complexity (Big-Oh) |
PPT: Software Engineering: Bridge pattern | |
| Feb 2,4,7 |
Text: Weiss Ch. 4
PPT: Trees |
PPT: Binary Search Trees | ... |
| Feb 9,11,14 |
O(N^2), O(N log N) illustration
O(2^N) illustration random data generation |
pair coding on BST | . . . |
| Feb 16,18,21 | PPT: Balanced Trees: AVL | PPT: Balanced Trees: Splay | ... |
| Feb 23,25,28 |
PPT:
Priority Queue
PPT: Binary Heap (read ch. 6) |
Heaps | ... |
| Mar 1,3,6 | Binary Heap, Priority Queue | ... | ... |
| Mar 8,10,13 |
PPT:
Maps and Sets
, review |
midterm exam | ... |
| Mar 15,17,20 | No class (spring break) | No class (spring break) | ... |
| Mar 22,24,27 | ... |
Text: Weiss Ch. 5
PPT: Hashing, Hash Maps |
(Easter). . . |
| Mar 29,31,Apr 3 | PPT: Hashing, Hash Maps | Basic Graph Theory | ... |
| Apr 5,7,10 | Modeling, Implementing Graphs |
Graph Algorithms
topological sort, shortest path |
Dijkstra's shortest path |
| Apr 12,14,17 | Minimum Spanning Tree (Prim's, Kurskal's) | Euler, Hamiltonian Paths, Circuits | ... |
| Apr 19,21,24 | Sorting | Sorting | ... |
| Apr 26,28, May 1 | last class day
Sorting |
reading day | ... |
| May 3,5,8 |
Tues May 03
final exam (12 noon) |
... | ... |