August
| Mon | Tue | Wed | Thu | Fri | Sat | Sun |
|---|---|---|---|---|---|---|
| 20 | 21 FDOC | 22
FDOC for 410
Topic: syllabus Topic: alg efficiency, eBay sort, bubble sort |
23 | 24 | 25 | 26 |
| 27
Text: Ch. 1,2,3 PPT: abstract data types PPT: Oracle Tutorial |
28 | 29
Text: Ch. 3 Implementations: an exercise PPT: Lists, Stacks, Queues PPT: a sentinel |
30 | 31 | ||
September
| Mon | Tue | Wed | Thu | Fri | Sat | Sun |
|---|---|---|---|---|---|---|
| 01 | 02
ASSN 0 due 11:55pm |
|||||
| 03
holiday no class |
04 | 05
Text: Ch. 2 PPT: Complexity (Big-Oh) PPT: Recursion and Run-time |
06 | 07 | 08 | 09 |
| 10
PPT: Recursion and Run-time |
11 | 12
hurricane
no class |
13 | 14 | 15 | 16 |
| 17
hurricane
no class |
18 | 19
Text:Ch. 4 PPT: Trees PPT: Binary Search Trees |
20 | 21 | 22 | 23 |
| 24
PPT: Notes on Trees Big O |
25 | 26
Text: Ch. 6 PPT: Priority Queue |
27 | 28 | 29 | 30 |
October
| Mon | Tue | Wed | Thu | Fri | Sat | Sun |
|---|---|---|---|---|---|---|
| 01
Text: Ch. 6 PPT: Binary Heap PPT: Array rep for binary trees |
02 | 03
O(N) Heap Build
Binary Heap JS code |
04 | 05 | 06 | 07 |
| 08
Text: Ch. 4 (again) PPT: Balanced Trees: AVL Examples: data structure animation |
09 | 10
PPT: Balanced Trees: Splay |
11 | 12 | 13 | 14 |
| 15
PPT: Maps and Sets |
16 | 17
midterm exam |
18 fall break ` | 19 fall break | 20 fall break | 21 fall break |
| 22
Text: Ch. 5 PPT: Hashing, Hash Maps |
23 | 24
PPT: Hashing, Hash Maps PPT: Blockchain |
25 | 26 | 27 | 28 |
| 29
Text: Ch. 9 PPT: Basic Graph Theory |
30 | 31
PPT: Modeling, Implementing Graphs |
||||
November
| Mon | Tue | Wed | Thu | Fri | Sat | Sun |
|---|---|---|---|---|---|---|
| 01 | 02 | 03 | 04 | |||
| 05
no class (water main break) |
06 | 07
PPT: Graph Algorithms topological sort, shortest path |
08 | 09 | 10 | 11 |
| 12
PPT: Minimum Spanning Tree (Prim's, Kurskal's) |
13 | 14
PPT: Minimum Spanning Tree (Prim's, Kurskal's) |
15 | 16 | 17 | 18 |
| 19
PPT: Euler, Hamiltonian Paths, Circuits |
20 | 21
t'giving break
no class |
22 t'giving break | 23 t'giving break | 24 t'giving break | 25 t'giving break |
| 26
Text: Ch. 4 (again) PPT: Balanced Trees: AVL |
27 | 28
PPT: Balanced Trees: Splay |
29 | 30 | ||
December
| Mon | Tue | Wed | Thu | Fri | Sat | Sun |
|---|---|---|---|---|---|---|
| 01 | 02 | |||||
| 03
Text:Ch. 8 PPT: Sorting, finish up |
04 | 05
LDOC
yes class Text: Ch. 10.4.2 Skip Lists PPT: Trie for type-ahead text retrieval |
06 reading day | 07 | 08 | 09 |
| 10
Final Exam
12:00 noon, in our classroom |
11 | 12 reading day | 13 | 14 | 15 | 16 |