CS 2013 - Programming with Data Structures

(3)

This course is repeatable: No
Max # of units may be repeated: 0
Total # of units allowed for credit: 3
Max times this course can be taken for credit: 1

Description Advanced programming techniques; data structures such as linked lists, stacks, queues, trees, hash tables, skip lists, and graphs; sorting and searching algorithms; basic algorithm analysis; Laboratory activities and software development. Lecture 2 hours, laboratory 3 hours.

Grading: ABC-/NC (Undergraduate Only)
Mode of Delivery: Face to Face
Campus: Main Campus

Prerequisite(s): CS 2012, Recommended: MATH 2120
Needs Permission to Enroll: No
Special Fee Applied: No

.

Articulation C-ID: COMP 132
^{This University course articulates with any California Community College (CCC) course that is approved by the C-ID program and given the corresponding “C-ID Course” designation listed here. The articulation is one-way articulation, meaning the approved community college course will articulate for the indicated course credit at the four-year university. Articulation does NOT apply from the four-year institution to the community college or between the four-year institutions.}

Quicklinks Search Form

Search form

University Catalog

CS 2013 - Programming with Data Structures