Main pageSolutions and your handins
DateTopicNotesHomeworkSolution
T
Jan  10
The Jam2000 Machineslides, jamHW 0available
Th
  12
Assemblyslides, mandelbrotHW 1available
T
  17
Allocation and stackslides, listHW 2available
Th
  19
CslidesHW 3available
T
  24
Structures and listsslidesHW 4available
Th
  26
Class canceled   
T
  31
Linked-list containersslides, linkedlistHW 5available
Th
Feb 2
Array containers, stacks, queuesslides, arrayHW 6available
T
  7
Binary search, sortingslides, sortHW 7available
Th
  9
Binary search treesslides, bstHW 8available
T
  14
Depth-/breadth-first traversalslides, traverseHW 9available
Th
  16
Hash tablesslides, hashtableHW 10available
T
  21
Representing variantsslides, variantsHW 11available
Th
  23
No meeting   
T
  28
I/O, writing, parsingslides, ioHW 12available
Th
Mar 1
Racket in Racketslides, miniracket1, miniracket2HW 13available
T
  6
Environments and closuresslides, miniracket3HW 14available
Th
  8
To-do stacksslides, miniracket3a, miniracket4, miniracket4aHW 15available
T
  13
Spring break   
Th
  15
Spring break   
T
  20
Racket in Cminiracket3HW 16available
Th
  22
C to-do stackminiracket4HW 17available
T
  27
Memory managementslides, miniracket5HW 18available
Th
  29
Garbage collectionslides, miniracket6HW 19available
T
Apr 3
Calling C from Racketslides, cursesHW 20available
Th
  5
Basic graph algorithmsslides, graphHW 21available
T
  10
Parallelism & concurrencyslides, parallelHW 22available
Th
  12
Machine-level concurrencyslides, countHW 23available
T
  17
Message passingslides, cml, fieldHW 24available
Th
  19
System and library stacksslides, execHW 25 
T
  24
The Racket Way