CS 2013 - Programming with Data Structures
Prerequisite: CS 2012, recommended: MATH 2070. 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. Graded ABC/NC.
CI-D COMP 132:
The University course listed above 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.
[Add to Portfolio]