Solutions and your handins

DateTopicNotesHomeworkSolution
T
Jan  11
The Jam2000 Machineslides, jamHW 0available
Th
  13
Assemblyslides, mandelbrot, listHW 1available
T
  18
Work through HW 1   
Th
  20
CslidesHW 2available
T
  25
Structures and listsslidesHW 3available
Th
  27
Linked-list containersslides, linkedlistHW 4available
T
Feb 1
Array containers, stacks, queuesslides, arrayHW 5available
Th
  3
Binary search, sortingslides, sortHW 6available
T
  8
Binary search treesslides, bstHW 7available
Th
  10
Depth-/breadth-first traversalslides, traverseHW 8available
T
  15
Hash tablesslides, hashtableHW 9available
Th
  17
Representing variantsslides, variantsHW 10available
T
  22
I/O, writing, parsingslides, ioHW 11available
Th
  23
Racket in Racketslides, miniracket1HW 12miniracket2
T
Mar 1
Environments and closuresslides, miniracket2, miniracket3HW 13miniracket4
Th
  3
Racket in Cminiracket4HW 14 
T
  8
Guest: John Regehr HW 15available
Th
  10
Guest: Matt Might   
T
  15
To-do stacksslidesHW 16available
Th
  17
Evaluator stackminiracket5HW 17available
  lab
C evaluator stackminiracket5c  
T
  22
Spring break   
Th
  24
Spring break   
T
  29
Garbage collectionslides, miniracket6HW 18available
Th
  31
Basic graph algorithmsslides, graphHW 19available
T
Apr 5
Parallelism & concurrencyslides  
Th
  7
Machine-level concurrencyslides, countHW 21available
T
  12
Class canceled   
Th
  14
Message passingcml  
T
  19
Locks vs. message passingfieldHW 22 
Th
  21
Reduce, MapReduce, and scanreduce, distributed  
T
  26
Language extensibility in Racket