Courses

CMPS12B: Introduction to Data Structures

*****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

5 Credits

YearFallWinterSpringSummer
2016-17
  • Section 01
    Charles Mc Dowell (mcdowell)
    Patrick Tantalo (ptantalo)
    Concurrent enrollment in course 12M required.
2015-16
  • Section 01
    Nathan Oliver John Whitehead (nwhitehe)
  • Section 01
    Patrick Tantalo (ptantalo)
    Summer Session 8 Weeks
2014-15
  • Section 01
    Nathan Oliver John Whitehead (nwhitehe)
2013-14
2012-13
2011-12
2010-11
  • Section 01
    Wesley Mackey (wmackey)
    Patrick Tantalo (ptantalo)
2009-10
2008-09
2007-08
2006-07
2005-06
2004-05
2003-04
2002-03
2001-02
1998-99

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.