CMPS101: Algorithms and Abstract Data Types

*****COURSES ARE SUBJECT TO CHANGE*****

Studies basic algorithms and their relationships to common abstract data types. Covers the notions of abstract data types and the distinction between an abstract data type and an implementation of that data type. The complexity analysis of common algorithms using asymptotic (big "O") notation is emphasized. Topics include sorting and searching techniques, basic graph algorithms, and algorithm design techniques. Abstract data types covered include priority queues, dictionaries, disjoint sets, heaps, balanced trees, and hashing. Familiarity with C, Java, and Unix is assumed. Prerequisite(s): course 12B or 13H; CMPE 16 or 16H; MATH 19B, 20B or 11B; and one course from the following: MATH 21, 22, 23A, or AMS 10.

5 Credits

YearFallWinterSpringSummer
2017-18
  • Section 50
    Staff
    Summer courses are tentative until instructor appointment has been verified.
2016-17
2015-16
  • Section 01
    Patrick Tantalo (ptantalo)
    Summer Session 8 Weeks
2014-15
2013-14
2012-13
2011-12
2010-11
2009-10
2008-09
2007-08
2006-07
2005-06
2004-05
2003-04
2002-03
2001-02
2000-01
1999-00
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.