Not too many hours left...
The theory final is so take-home and so not done yet. (due at 11am.)
And I really don't want to talk about affordances or scaffolding or scenarios or whatever. *grumbly, makes face*
Can I figure out O(n logn) algorithms for mumblefoos and frobnitzim and {weighted,directed,maximally matched,flow}graphs in the next four and a half hours? When was the last time I was able to prove things about dynamic programming off the top of my head?
We'll find out, I suppose.
The theory final is so take-home and so not done yet. (due at 11am.)
And I really don't want to talk about affordances or scaffolding or scenarios or whatever. *grumbly, makes face*
Can I figure out O(n logn) algorithms for mumblefoos and frobnitzim and {weighted,directed,maximally matched,flow}graphs in the next four and a half hours? When was the last time I was able to prove things about dynamic programming off the top of my head?
We'll find out, I suppose.