2015 | Tuesday | Thursday | Sunday (due 11:59pm) |
Aug 17-Aug 21 | Text: course syllabus |
Text: Weiss Ch. 1,2,3
PPT: Abstract Data Types |
... |
Aug 24-Aug 28 |
Text:
Weiss Ch. 3
Notes: Using ML |
PPT: Lists, Stacks, Queues | ... |
Aug 31-Sep 04 | PPT: Complexity (Big-Oh) |
PPT:
Trees
Assn 1 due (9:29 am) |
|
Sep 07-Sep 11 |
PPT:
Sorting with LIST
PPT: Software Engineering: Bridge pattern |
PPT: Binary Search Trees | ... |
Sep 14-Sep 18 |
O(N^2), O(N log N) illustration
O(2^N) illustration random data generation Assn 2 due (9:29 am) |
pair coding on BST | . . . |
Sep 21-Sep 25 |
PPT:
Balanced Trees: AVL
Assn 3 optional |
PPT:
Balanced Trees: Splay
Assn 4 (part 1) due (9:29 am) |
... |
Sep 28-Oct 02 |
PPT:
Binary Heap
(read ch. 6) Assn 4 (part 2) due (9:29 am) |
Heaps | ... |
Oct 05-Oct 09 | Binary Heap, Priority Queue | ... | ... |
Oct 12-Oct 16 | Hashing | No class (fall break) | ... |
Oct 19-Oct 23 | Hashing | midterm exam | ... |
Oct 26-Oct 30 | Hash Maps | Basic Graph Theory | . . . |
Nov 02-Nov 06 | Implementing Graphs | Graph Algorithms | ... |
Nov 09-Nov 13 | topological sort, shortest path | Dijkstra's shortest path | ... |
Nov 16-Nov 20 | Minimum Spanning Tree (Prim's, Kurskal's) | Euler, Hamiltonian Paths, Circuits | ... |
Nov 23-Nov 27 | Sorting | No class (holiday) | ... |
Nov 30-Dec 04 | last class day
sorting |
reading day | ... |
Dec 07 - Dec 11 |
Tues Dec 08
final exam (8 am) |
... | ... |