| Moon's day | Woden' s day | Frigga's day |
|---|
| |
|
Jan 15 |
|
Algorithms and correctness, 1.2
Slides |
Do Ex 1.6 (pg 19)
Read 1.3, pg 37-54
|
|
|
Jan 17 |
|
Algorithms and correctness, 1.2; algorithms and efficiency, 1.3
Slides |
Read 1.4, 54-77
|
|
| |
|
Jan 22 |
|
Algorithms and efficiency, 1.(3 & 4)
Slides |
Read 2.1, pg 79-95
do practice problem on handout, same as 1.(27,28,42,43) in book (for Jan 27)
|
|
|
| |
|
Jan 29 |
|
More on data structures; programming practices. 2.(2-5) |
Read 3.1, pg 177-191
|
|
|
|
Feb 3 |
|
More about counting sort and radix sort, 3.1 |
|
|
|
Feb 5 |
|
Disjoint sets and array forests, 3.2
Slides |
Read 3.3, pg 209-236
|
|
|
| |
|
Feb 12 |
|
Graphs. Concepts and implementation, 4.(1 & 2)
Slides |
Read 4.3, pg 284-302
|
|
|
Feb 14 |
|
Graph traversal, 3.3
Sample graph |
Read 4.4, pg 302-322
|
|
| |
|
|
Feb 21 |
|
Minimum spanning trees |
|
|
| |
|
|
Feb 28 |
|
Test |
Read 5.(1&2) pg 347-373
|
|
| |
|
Mar 4 |
|
More about binary search trees; AVL trees, 5.3
Slides |
|
|
|
| |
|
|
| |
|
|
| |
|
|
Mar 27 |
|
Finishing balanced trees |
Read 6.(1 & 2), pg 453-478
|
|
|
Mar 30 |
|
Dynamic programming. Introduction, 6.(1 & 2) |
Read 6.3, 478-482
Do Ex 6.(5-7), submit through Schoology
|
|
|
Apr 1 |
|
Principles of dynamic programming, 6.3 |
Read 6.4, pg 482-496
|
|
|
Apr 3 |
|
Examples of dynamic programming algorithms, 6.4 |
Practice problem Due Apr 6
Read 6.5, pg 496-507
|
|
| |
|
|
|
Apr 13 |
|
Test |
Read 7.(1&2), pg 511-526
|
|
|
|
|
Apr 20 |
|
Hash functions, 7.4 |
Read 7.5, pg 557-565
|
|
|
|
Apr 24 |
|
Hashing wrap-up, 7.6 |
Read Ch 8 intro and 8.1 (to be made available on schoology)
|
|
|
Apr 27 |
|
Strings. String sorting; radix sort revisited, 8.1 |
Read 8.2 (to be made available on schoology)
|
|
|
|