| Moon's day | Woden's day | Thor's day | Frigga's day |
|---|
| |
|
Aug 27 |
|
Prolegomena. General introduction
Slides |
|
|
|
|
Aug 29 |
|
Algorithms and correctness |
|
|
| |
|
Sept 3 |
|
Algorithms and correctness; algorithms and efficiency |
|
|
|
Sept 4 |
|
Writing invariants |
|
|
|
Sept 5 |
|
Algorithms and efficiency |
|
|
|
Sept 8 |
|
Algorithms and efficiency |
|
|
|
Sept 10 |
|
Abstract data types |
ADT review assigned
|
|
|
Sept 11 |
|
Basic data structures |
|
|
|
|
Sept 15 |
|
Data structures; programming practices |
|
|
|
Sept 17 |
|
Case studies. Counting sort |
|
|
|
|
Sept 19 |
|
Radix sort |
ADT review due; linear sort assigned
|
|
|
Sept 22 |
|
Disjoint sets and array forests |
|
|
|
Sept 24 |
|
Priority queus and heaps |
Linear sort due; heaps assigned
|
|
|
Sept 25 |
|
N-sets and bit vectors |
|
|
|
Sept 26 |
|
Priority queues and heaps |
|
|
|
Sept 29 |
|
Graphs. Concepts and implementation |
|
|
|
|
|
Oct 3 |
|
Minimum spanning trees |
Heaps due; MST assigned
|
|
|
Oct 6 |
|
Minimum spanning trees |
|
|
|
Oct 8 |
|
Single source shortest paths |
MST due; SSSP assigned
|
|
|
Oct 9 |
|
Applied graph traversal |
|
|
|
Oct 10 |
|
Single source shortest paths |
|
|
| |
|
|
Oct 16 |
|
Basic binary search trees, pt 1 |
|
|
|
Oct 17 |
|
Binary search trees. BST intro |
SSSP due; BST rotations assigned
|
|
| |
|
|
Oct 23 |
|
Basic binary search trees, pt 2 |
|
|
|
Oct 24 |
|
Balanced BST problem; AVL trees |
|
|
|
Oct 27 |
|
AVL trees |
BST rotations due; AVL trees assigned
|
|
|
Oct 29 |
|
Traditional red-black trees |
Trad RB trees assigned
|
|
|
Oct 30 |
|
From BSTs to sorted arrays |
|
|
|
Oct 31 |
|
Left-learning red-black trees |
AVL trees due
|
|
| |
|
Nov 5 |
|
Dynamic programming. Introduction |
Trad RB trees due
|
|
|
|
| |
|
|
|
|
Nov 17 |
|
Optimal BSTs |
Opt BSTs assigned
|
|
|
Nov 19 |
|
Hash tables. Introduction; separate chaining |
|
|
|
|
Nov 21 |
|
Open addressing |
Linear probing assigned
|
|
|
Nov 24 |
|
Hash functions |
Opt BSTs due
|
|
|
|
|
|
Dec 1 |
|
Perfect hashing |
Linear probing due; perfect hashing assigned
|
|
|
Dec 3 |
|
Hash table performance |
|
|
|
|
Dec 5 |
|
Strings. Sorting strings |
|
|
|
Dec 8 |
|
Tries |
Perfect hashing due; tries assigned
|
|
|
Dec 10 |
|
Regular expressions |
|
|
|
|