*****COURSES ARE SUBJECT TO CHANGE*****
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 11 or 12A or Computer Engineering 13. Concurrent enrollment in course 12M required. Enrollment limited to 150. (General Education Code(s): IN, MF - Mathematical and Formal Reasoning) W. Mackey
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.