Also note the dates here were planned with a MWF section in mind; there will be at least slight variations for a TTh section.
| Lecture Topic | Reading Assignment | Projected Date | |
| Shaffer | Notes | ||
| Introduction & Review | Ch 1 | C00 | Jan 14 - 18 |
| App00, App01 | |||
| Linear Structures | Jan 21 - Feb 4 | ||
| General Lists | 4.1 | C01 | |
| Skip Lists | 12.1 | ||
| Stacks | 4.3 | C01 | |
| Queues | 4.4 | C01 | |
| Algorithm Analysis | Ch 3 | Feb 6 - 8 | |
| Definitions and Examples | C02 | ||
| Asymptotics | Feb 8 - Feb 11 | ||
| Definitions and Theorems | C03 | ||
| Binary File I/O | C11 | Feb 13 - 15 | |
| Secondary Storage | C09 | Feb 18 - 22 | |
| Physical Characteristics | 8.1 - 8.2 | ||
| Access Times | |||
| Buffer Pools | 8.3 | ||
| Midterm Test | Feb 28 & Mar 1 | ||
| Spring Break | |||
| Trees | Feb 27 - Mar 22 | ||
| Binary Trees | 5.1 - 5.3 | C04 | |
| BSTs | 5.4 | C05 | |
| Balanced Trees (splaying) | 13.2.2 | ||
| AVL Trees | 13.2.1 | C06 | |
| Heaps | 5.5 | C07 | |
| Indexing I | Mar 25 - Apr 1 | ||
| Linear Indices | 10.1 | C12 | |
| Hashing | 9.4 | C10 | |
| Self-organizing Lists | 9.2 | C16 | |
| Sorting | C14 | Apr 3 - Apr 8 | |
| Insertion Sort | 7.2.1 | ||
| Theoretical Bounds | 7.8 - 7.9 | ||
| Shell Sort | 7.3 | ||
| HeapSort | 7.6 | ||
| MergeSort | 7.5 | ||
| QuickSort | 7.4 | ||
| Radix Sort | 7.7 | ||
| Indexing II | C13 | Apr 10 - 17 | |
| B trees | 10.5 | ||
| B+ trees | 10.6 | ||
| Red-Black Trees | |||
| External Sorting | 8.5 | C17 | Apr 19 |
| General Trees | Ch 6 | C08 | Apr 22 |
| Graphs | C15 | Apr 24 - Apr 29 | |
| Representation Schemes | 11.2 | ||
| Traversal Algorithms | 11.3 | ||
| Shortest Path | 11.4 | ||
| Minimal Spanning Trees | 11.5 | ||
| Prim's Algorithm | |||
| Kruskal's Algorithm | |||
| Classes End | May 1 | ||
|
Final Exam |
|
|
Tues, May 7 1:05 - 3:05 |