| Moon's day | Woden' s day | Frigga's day |
|---|
| |
|
|
| |
|
Jan 20 |
|
Case study: Disjoint sets and union/find |
|
|
|
Jan 22 |
|
Algorithms: correctness
Slides |
Read Section 1.4 plus response
|
|
|
Jan 25 |
|
Algorithms: analysis |
|
|
|
|
| |
|
Feb 3 |
|
Graphs. Introduction
Slides |
|
|
|
Feb 5 |
|
Graph implementations |
|
|
|
Feb 8 |
|
Graph traversal |
Read Section 4.3 plus response
|
|
|
|
| |
|
|
|
Feb 22 |
|
Test |
Read Sections 3.(1&2) plus response
|
|
|
Feb 24 |
|
Binary search trees. Introduction to trees and BSTs |
Read Sections 3.3 plus response
|
|
|
Feb 26 |
|
Overview of balanced trees
Slides |
|
|
| |
|
|
| |
|
|
| |
|
Mar 16 |
|
Two-three trees |
Read pg 866-874 plus response
|
|
|
|
Mar 21 |
|
Finishing balanced trees |
|
|
|
|
| |
|
|
| |
|
Apr 6 |
|
Test |
Read section 3.4 pg 458-468 plus response by Apr 11
|
|
|
Apr 8 |
|
Hash tables. Introduction to hashing; separate chaining |
|
|
|
Apr 11 |
|
Hash functions |
Read section 3.4 pg 469-479 plus response
|
|
|
|
Apr 15 |
|
Performance of open addressing |
|
|
| |
|
Apr 20 |
|
Hashing wrap-up.
Strings. String sorting; radix sort revisited
Slides |
Read Section 5.2 (no response necessary)
|
|
|
|
Apr 25 |
|
Substring search |
Skim Section 5.4 (no response necessary)
|
|
|
Apr 27 |
|
String compression |
|
|
|