Date | Sections | Topic |
---|---|---|
15 August | Chapter 1 | Introduction |
17 August | Chapter 2 | Sets, Bags, & Tuples |
20 August | Relations and Logarithms | |
22 August | Inductive proof | |
24 August | Chapter 3 | big-O |
27 August | big-Ω and big-Θ | |
29 August | Simplifying rules | |
31 August | Section 4.1 | Lists |
5 September | Chapter 4 | Stacks and Queues |
7 September | C++ reprise | classes and pointers |
10 September | templates | |
12 September | Sections 5.1 & 5.2 | Binary tree properties |
14 September | Section 5.3 | Binary tree implementation |
17 September | C++ reprise | Union and inheritance |
19 September | Math reprise | Homework 1 |
21 September | Section 5.3 | Array implementation |
24 September | Sections 5.4 & 5.5 | Binary search trees and Heaps |
26 September | Quiz 1 | |
28 September | Section 5.6 | Quiz 1 review and Huffman coding |
1 October | Chapter 6 | Trees |
3 October | Union-Find | |
5 October | Chapter 7 | Sorting |
8 October | bad sort animation all sort animation |
|
15 October | Chapter 8 | External storage |
17 October | Disk systems | |
19 October | File processing | |
22 October | File systems | Unix and Windows |
24 October | ||
26 October | Chapter 9 | Search |
29 October | Chapter 10 | Indexing |
31 October | Hashing and sorting reprise |
Hashing examples Homework 5 solution |
2 November | Chapter 10 | B-trees |
5 November |
B+ tree node definition B+ tree interface (C++) B+ tree I/O routine B+ tree insertion roution |
|
7 November | Quiz 2 -- Chapters 4 to 7 | |
9 November | Chapter 11 | Graphs |
12 November | Search in graphs | |
14 November | More graphs | |
16 November | Even more graphs | |
19 November | Prim and Kruskal animation | |
26 November | Chapter 12 | Memory management |
28 November | ||
30 November |
The original Skip List animation |
|
3 December | ||
5 December | Quiz 3 | |
7 December | Review | |
14 December | Final exam 1:15-3:45 pm |