CMPS 12B: Introduction to Data Structures
- Winter 2010
- Fall 2009
- Spring 2009
- Winter 2009
- Fall 2008
- Spring 2008
- Winter 2008
- Fall 2007
- Summer 2007
- Spring 2007
- Winter 2007
- Spring 2006
- Winter 2006
- Fall 2005
- Summer 2005
- Spring 2005
- Winter 2005
- Fall 2004
- Summer 2004
- Spring 2004
- Winter 2004
- Fall 2003
- Summer 2003
- Spring 2003
- Winter 2003
- Fall 2002
- Winter 2002
- Fall 2001
- Spring 1999
Teaches students to implement common data structures and the algorithms associated 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. Students will gain a working knowledge of the elements of the Java and C programming languages. Prior experience with Unix is assumed. Prerequisite(s): course 12A. Concurrent enrollment in course 12M required. Enrollment limited to 150. (General Education Code(s): IN.) W. Mackey
5 Credits
While the information on this web site is usually the most up to date, in the event of a discrepancy, please contact your adviser to confirm which information is correct.