CMPS 12B
- Spring 2008
- Winter 2008
- Spring 2005
- Winter 2004
- Winter 2003
- Spring 2002 #02
- Winter 2002
- Spring 1999
- Winter 1998
- Fall 1997
- Spring 1997
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
(sourced from /cse/classes/cmps012b/description.txt)