Date | Topic | Notes | Homework | Solution |
T | | The Jam2000 Machine | slides, jam | HW 0 | available |
Th | | Assembly | slides, mandelbrot, list | HW 1 | available |
T | | Work through HW 1 | | | |
Th | | C | slides | HW 2 | available |
T | | Structures and lists | slides | HW 3 | available |
Th | | Linked-list containers | slides, linkedlist | HW 4 | available |
T | | Array containers, stacks, queues | slides, array | HW 5 | available |
Th | | Binary search, sorting | slides, sort | HW 6 | available |
T | | Binary search trees | slides, bst | HW 7 | available |
Th | | Depth-/breadth-first traversal | slides, traverse | HW 8 | available |
T | | Hash tables | slides, hashtable | HW 9 | available |
Th | | Representing variants | slides, variants | HW 10 | available |
T | | I/O, writing, parsing | slides, io | HW 11 | available |
Th | | Racket in Racket | slides, miniracket1 | HW 12 | miniracket2 |
T | | Environments and closures | slides, miniracket2, miniracket3 | HW 13 | miniracket4 |
Th | | Racket in C | miniracket4 | HW 14 | |
T | | Guest: John Regehr | | HW 15 | available |
Th | | Guest: Matt Might | | | |
T | | To-do stacks | slides | HW 16 | available |
Th | | Evaluator stack | miniracket5 | HW 17 | available |
| | C evaluator stack | miniracket5c | | |
T | | Spring break | | | |
Th | | Spring break | | | |
T | | Garbage collection | slides, miniracket6 | HW 18 | available |
Th | | Basic graph algorithms | slides, graph | HW 19 | available |
T | | Parallelism & concurrency | slides | | |
Th | | Machine-level concurrency | slides, count | HW 21 | available |
T | | Class canceled | | | |
Th | | Message passing | cml | | |
T | | Locks vs. message passing | field | HW 22 | |
Th | | Reduce, MapReduce, and scan | reduce, distributed | | |
T | | Language extensibility in Racket | | | |