| |
Dec 05, 2025
|
|
|
|
|
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 Per Week: 3 lecture hour(s) 2 activity hour(s)
Grading: ABC-/NC (Undergraduate Only)
Mode of Delivery: Face to Face
Campus: Main Campus
Cross-Listing and/or Equivalent Course(s): None
Prerequisite(s): CS 2012 with a C or better grade;
Needs Permission to Enroll: No
.
Please CLICK HERE for the articulation information regarding this course.
Add to Portfolio (opens a new window)
|
|
