cs 201 lectures

A lecture may come in various formats (pdf mostly, some txt). Text chapter readings if any are given, and then followed by the lecture. Note that 6.1-3 means chapter 6, sections 1-3. Click on the lecture or handout below to get to the file associated with the label. Note - this list is not done yet and lectures may change in terms of content or order at any time.

Lectures and associated Handouts

• C review, Makefile intro (pdf) (ppt)
• gdb - debug lecture (txt) handouts:
  basic.c (txt)
  boom.c (txt)
  Makefile for handout code (txt)
  gdb command guide (txt)
  previous handouts as tar archive
  complex Makefile example
• B/O, C. 11: file I/O intro (pdf)
• K/R, C. 8: Unix System Calls and Stdio (pdf) handouts:
  benchmark - getpid.c (txt)
  unlink example (pdf)
  fork race - output race (txt)
• B/O, C.9: time.measurement (pdf)
• B/O, C. 8.1: Exceptions (pdf)
• B/O, C. 8.2-4: Processes (pdf) handouts:
  exec call - execvp0.c (txt)
  attach attach attach - attach.c (txt)
  FreeBSD libc code for exec calls- exec.c (txt)
• B/O, C. 8.5-end: Signals (pdf) waitpid and signals (onwait.txt)
• B/O, C. 7: Linking/loading (pdf) (emergency escape lecture)
• B/O, C. 6.1-3: Memory.hierarchy (pdf)
• B/O, C. 6.4: cache.microarch (pdf)
• B/O, C. 6.5-7: cache.friendly.code (pdf) data layout of 2d array normal access
  data layout of 2d array backwards access
  data layout of 3d array access
  data layout of 3d array "backwards" access
  
• B/O, C. 10.1-5,7-8: virtual.memory (pdf)
• B/O, C. 10.6: Mem.mgmt (pdf)
• allocation.usage (pdf)
• B/O, C. 10.9-10: dynamic.memory (pdf)
• B/O, C. 10.11: Memory.bugs (pdf)
• B/O, C. 5.1-6,15: Optimization.I (pdf) handouts:
  sort.c (txt)
  fatal.h (txt)
  gprof run on sort.c (txt)
• B/O, C. 5.7-14: Optimization.II (pdf)
• B/O, C. 12: Network Introduction I (CMU lecture) (pdf)

  ---

  back to cs201 page