CS 213 Recitation Notes Fall '00

The TAs do not guarantee that these notes will be comprehensible by themselves; they will usually put up only the outlines, slides, and handouts that they have already prepared for the class. You are expected to come to recitation; these notes do not substitute for attendance.

• Recitation 1 - Bit-level operations (Sept 11)
  • Section A
  • Section B (outline)
  • Section C (outline, ps slides)
  • Sections D and E (outline)

• Recitation 2 - Assembly Code (Sept 18)
  • Section A
  • Section B (outline)
  • Section C (outline) (sample asm) (corresponding C)
  • Sections D and E (summary)

• Recitation 3 - GDB and switch statements (Sept 25)
  • Section A
  • Section B (excercise) (C switch code)
  • Section C (no outline) (C switch code)
  • Sections D and E

• Recitation 4 - Floating point numbers
  • (outline) (worksheet) (solution sheet)

• Recitation 5 - Mid-term review session(Oct 9)
  • Section A
  • Section B(outline)
  • Section C
  • Section D and E (outline) (questions) (solutions)

• Recitation 6 - Caching(Oct 16)
  • Section A
  • Section B
  • Section C
  • Section D and E (outline)

• Recitation 10 - Concurrent Programming(Nov 27)
  • Section A
  • Section B
  • Section C
  • Section D and E (outline) (code fragments) (complete code)