Moon's day  Woden' s day  Frigga's day 


Jan 11 
Introduction (1.1&2) 




Jan 18 
Algorithms: correctness (3.1) Slides 
Read Section 1.4 plus response


Jan 20 
Algorithms: efficiency (1.4) Slides 



Jan 25 
Case study: Disjoint sets and union/find (1.5) 



Jan 30 
Case study: Heaps and priority queues (2.4) Slides 
Project: Heaps Read Sections 4.(1&2) plus response


Feb 1 
Graphs. Introduction (4.1&2) Slides 


Feb 3 
Graph implementations (4.1&2) 


Feb 6 
Graph traversal (4.1&2) 
Read Section 4.3 plus response


Feb 8 
Minimum spanning tree algorithms (4.3) Slides 
Project: MST Read Section 4.4 plus response



Feb 13 
Singlesource shortest path algorithms (4.4) 
Project: SSSP


Feb 15 
Finishing SSSP Slide 




Feb 22 
Test 
Read Sections 3.(1&2) plus response


Feb 24 
Binary search trees. Introduction to trees and BSTs (3.2) 
Read Sections 3.3 plus response


Feb 27 
Overview of balanced trees (3.3) Slides 








Mar 15 
Twothree trees Slides 
Read pg 866874 plus response


Mar 17 
Btrees (6 pg 866). Finishing balanced trees 







Mar 31 
Test 
Read section 3.4 pg 458468 plus response by Apr 7


Apr 3 
Finishing optimal BSTs 



Apr 7 
Hash functions 
Read section 3.4 pg 469479 plus response





Apr 17 
Hashing wrapup. 
Skim Section 5.1 (no response necessary)


Apr 19 
Strings. String sorting; radix sort revisited (5.1) 
Read Section 5.2 (no response necessary)



Apr 24 
Regular expressions (5.4) 
Skim Section 5.4 (no response necessary)


Apr 26 
Regular expressions practice 


