NOTE: This is the web page for the Tu/Th section of 12B. If you are not in that section, you are in the wrong place.

Teaches students to implement common data structures and the associated algorithms with each data structure, through progressively difficult exercises. Topics include big-O notation; pointers, recursion (induction), and dynamic allocation; linked lists and list processing; stacks, queues, binary trees and binary search trees; simple sorting techniques and simple search techniques. ANSI C programming. Prerequisite: cmps012a. Prior experience with Unix is assumed.

Midterm exam 1: Tuesday, April 30, 2002 (GRADES POSTED)
Midterm exam 2: Tuesday May 21, 2002 (GRADES POSTED)

Final exam: Wednesday, June 5, 8-11am

QUIZ for EXTRA CREDIT -- use login and password you use to check grades