CS 2013 - Programming with Data Structures

[4]

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

Course 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.
Credit Hours: 3 lecture hour(s) 2 activity hour(s) per week

Grading: ABC-/NC (Undergraduate Only)
Mode of Delivery: Face to Face
Campus: Main Campus
Prerequisite(s): CS 2012 with a C or better grade; Recommended: MATH 2120
Needs Permission to Enroll: No
Special Fee Applied: No

.

Articulation C-ID: COMP 132 Programming Concepts and Methodology II^{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.

For a list of institutions offering this course, search by the C-ID on the C-ID website: https://c-id.net/courses/search}

Quicklinks Search Form

Search form

University Catalog

CS 2013 - Programming with Data Structures