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.

In Winter 2002, this course is being taught using WebCT. To access the course and all course materials, you must log in to http://webct.ic.ucsc.edu:8000. You must have a user id and password.

To get a user id and password, look at the directions at http://www.ic.ucsc.edu/docs/webct/students.shtml.


Don’t Panic

If you are wondering what you can do during winter break to prepare for 12B, here are some hints.
 -- Play around on your cats account and really become familiar with UNIX. Understanding UNIX will really give you an edge.
-- If you don’t know Java, learn it. You are expected to know Java.
-- Don’t think that reading textbooks will help. Do things on the computer.

If in doubt, email me: tara@cse.ucsc.edu