College of Inform & Comp Sci 210 - Data Structures

An introduction to the design, analysis, and implementation of data structures. This course teaches you how to build, test, debug, document, and evaluate objects that encapsulate data and their associated operations using programming constructs and data abstractions of a modern programming language. Concepts and techniques covered include linear and non-linear structures, recursive structures and algorithms, traversal algorithms, binary search trees, balanced trees, priority queues, union-find, hash tables, bloom filters, and graphs. We will also informally compare and contrast the run time efficiency of algorithms and their performance characteristics including the concept of worst-case running time analysis and the classification of algorithms in terms of constant, logarithmic, linear, log linear, quadratic, and exponential time using Big-O notation. (Gen. Ed. R2)

Open to freshmen, sophomores, and juniors in Computer Science and Informatics. CICS 160 w/ C STUDENTS ARE NOT PERMITTED TO TAKE CICS 210 AFTER SUCCESSFULLY COMPLETING COMPSCI 187. AFTER ELIGIBLE CS AND INFORM MAJORS HAVE ENROLLED, WILL OPEN TO OTHER FRESHMEN, SOPHOMORE, AND JUNIORS, IF AVAILABLE SEATS. ELIGIBLE NON-CS AND NON-INFORM MAJORS SHOULD WAIT FOR THE MAJOR ELIGIBILITY RESTRICTION TO BE REMOVED TO SELF-ENROLL OR ADD TO THE WAITLIST (IF AVAILABLE) AND SHOULD NOT REQUEST AN OVERRIDE. STUDENTS NEEDING SPECIAL PERMISSION MUST REQUEST OVERRIDES VIA THE ON-LINE FORM: https://www.cics.umass.edu/overrides.