| Moon's day | Woden' s day | Frigga's day |
|---|
| |
|
Jan 10 |
|
Introduction; correctness of algorithms. 1.(1&2)
Slides |
|
|
|
Jan 12 |
|
Correctness of algorithms. 1.2 |
Do Ex 1.9 (pg 14) Solution
Read 1.3
|
|
| |
|
Jan 17 |
|
Efficiency of algorithms. 1.3
Slides |
Read 1.(4&5)
[For Mon, do practice problem]
|
|
|
|
Jan 22 |
|
Abstract datatype; various programming practices. 1.(5&6) |
Read 2.1
|
|
|
|
Jan 26 |
|
Finishing linear sorts |
Read 2.3
|
|
|
Jan 29 |
|
Case study: Disjoint sets and union/find. 2.2 |
Read 2.3
|
|
|
Jan 31 |
|
Case study: Heaps and priority queues. 2.3
Slides |
Project: Heaps
Read 2.4 (new) and DMFP 10.(1&6)
|
|
|
|
Feb 5 |
|
Graphs. Introduction and concepts. 3.1
Slides |
Read 3.2
|
|
|
Feb 7 |
|
Graph implementations. 3.2
Slides |
Read 3.3
|
|
|
| |
|
|
| |
|
|
Feb 23 |
|
Test |
Read 4.1 (new)
Please also read the exercises a the end of the section.
|
|
| |
|
Feb 28 |
|
Balanced BSTs. 4.3
Slides |
Read 4.4
|
|
|
| |
|
|
| |
|
|
Mar 16 |
|
Finishing balanced trees: Two-three trees and B-trees. 4.(7 & 8) |
Read 5.1
|
|
| |
|
|
Mar 23 |
|
Examples of dynamic programming algorithms. 5.4
Slides |
Read 5.5
|
|
| |
|
Mar 28 |
|
Finishing optimal BSTs |
|
|
|
| |
|
|
| |
|
Apr 11 |
|
Hash functions. 6.5
Slides |
Read 6.6
|
|
|
|
Apr 16 |
|
Hashing wrap-up. |
Read 7.1
|
|
|
|
|
Apr 23 |
|
Regular expressions. 7.5
Slides |
|
|
|
|