| Moon's day | Woden' s day | Frigga's day |
|---|
| |
|
Jan 16 |
|
Algorithms and correctness, 1.2
Slides |
Read 1.3, pg 26-36
|
|
|
Jan 18 |
|
Algorithms and correctness, 1.2; algorithms and efficiency, 1.3
Slides |
Do Ex 1.9 (pg 14)
|
|
| |
|
Jan 23 |
|
Algorithms and efficiency, 1.3
Slides |
Read 1.4, pg 36-49
|
|
|
| |
|
Jan 30 |
|
No class: College closed for cold weather |
Practice problems
Read 2.1, pg 119-132
|
|
|
|
Feb 4 |
|
More about counting sort and radix sort, 2.1 |
|
|
|
Feb 6 |
|
Disjoint sets, 2.2
Slides |
Read 2.3, pg 150-172
|
|
|
| |
|
Feb 13 |
|
Graphs. Concepts and implementation, 3.(1 & 2)
Slides |
Read 3.3, pg 199-201
|
|
|
Feb 15 |
|
Graph traversal, 3.3 |
Read 3.4, pg 201-206
Do practice problem from handout
|
|
| |
|
|
| |
|
|
Mar 1 |
|
Test |
Read 4.(1&2) pg 215-236
|
|
| |
|
Mar 6 |
|
More about binary search trees; AVL trees
Slides |
Read 4.3, pg 236-246
|
|
|
| |
|
|
| |
|
|
Mar 22 |
|
Finishing balanced trees
Slides |
Read 5.(1 & 2), pg 289-295
|
|
| |
|
Mar 27 |
|
Principles of dynamic programming, 5.3 |
Read 5.4, pg 298-299
|
|
|
Mar 29 |
|
Examples of dynamic programming algorithms, 5.4
Slides |
Read 5.5, pg 300-306
|
|
| |
|
Apr 3 |
|
Finishing optimal BSTs |
|
|
|
|
Apr 8 |
|
Test |
Read 6.(1&2), pg 309-323
|
|
|
Apr 10 |
|
No class: family illness |
|
|
|
| |
|
Apr 17 |
|
Hash functions, 6.5
Slides |
Read 6.6, pg 354-361
|
|
|
| |
|
|
|
Apr 29 |
|
Regular expressions, 7.5 |
|
|
|
|