Outline for May 3, 2002

Handouts: Sample Midterm
Reading: Johnsonbaugh and Kalin, pp. 489-503, 507-533


  1. Greetings and felicitations!
  2. Structures
    1. Simple student/student ID array
    2. Linked lists
    3. Allocating, deallocating storage (malloc, free, calloc, cfree)
  3. Bit Operations
    1. Representation of integers as bit sequences
    2. & | ~
    3. Contrast with logical operators && || !

ECS 30-A, Introduction to Programming
Winter Quarter 2002
Email: cs30a@cs.ucdavis.edu