Associate in Science Degree in Computer Science
2025-2026 Map
Total Units: 60 - 64
Term 1
14.00 - 15.00 Units. Specified core courses are signified by icon.| Course Name | Units | Notes | |
|---|---|---|---|
| Select one: Meets Area 2 | 5.00 | ||
|
|||
| Area 1A Choice (See GE Guide) | 3.00 - 4.00 | ||
|
|
|||
| Area 4 Choice (See GE Guide) | 3.00 | ||
|
|
|||
| Area 6 Choice (See GE Guide) | 3.00 | ||
|
|
|||
Term 2
14.00 - 15.00 Units. Specified core courses are signified by icon.| Course Name | Units | Notes | |
|---|---|---|---|
| CSCI 20: Programming and Algorithms I | 3.00 | ||
|
Unit(s): 3.00
This course is an introduction to the discipline of computer science, with a focus on the design and implementation of algorithms to solve simple problems using a high-level programming language. Topics include fundamental programming constructs, problem-solving strategies, debugging techniques, declaration models, and an overview of procedural and object-oriented programming languages. Students will learn to design, implement, test, and debug algorithms using pseudocode and a high-level programming language. (C-ID COMP 122). |
|||
| MATH 31: Analytic Geometry and Calculus II | 4.00 | Meets Area 2. | |
|
Prerequisite(s): MATH 30 or MATH 30s This course is the second of a series in differential and integral calculus of a single variable. Topics will include the concept, techniques and applications of integration, infinite sequences and series, as well as polar and parametric equations. Intended for Science, Technology, Engineering & Math Majors. (C-ID MATH 220). |
|||
| Select one: Meets Area 5A/5C | 4.00 - 5.00 | ||
|
|||
| Area 1B/C Choice (See GE Guide) | 3.00 | ||
|
|
|||
Term 3
15.00 - 17.00 Units. Specified core courses are signified by icon.| Course Name | Units | Notes | |
|---|---|---|---|
| CSCI 21: Programming and Algorithms II | 3.00 | ||
|
Prerequisite(s): CSCI 20 This is a software engineering course, focused on the application of software engineering techniques for the design and development of large programs. Topics include data abstraction, data structures and associated algorithms, recursion, declaration models, and garbage collection. Students will learn to design, implement, test, and debug programs using an object-oriented language. (C-ID COMP 132). |
|||
| Select one: Meets Area 5A/5C | 4.00 - 5.00 | ||
|
|||
| Area 3 Choice (See GE Guide) | 3.00 - 4.00 | ||
|
|
|||
| Graduation Requirement Choice (See GE Guide) | 2.00 | ||
|
|
|||
| Elective (any course numbered 1-99 or C1000-C1999) | 3.00 | Only necessary if the 60 units needed to graduate have not been completed. Consider taking a Cal-GETC General Education course. Visit www.assist.org to see options. | |
|
|
|||
Term 4
17 Units. Specified core courses are signified by icon.| Course Name | Units | Notes | |
|---|---|---|---|
| CSCI 22: Discrete Structures | 3.00 | Prerequisite: CSCI 20 and MATH 26 or MATH 26s or MATH 13 or MATH 13s | |
|
Prerequisite(s): CSCI 20 and MATH 13 or MATH 13s or MATH 26 or MATH 26s or MATH 28 or MATH 28s This course is an introduction to the discrete structures used in Computer Science, with an emphasis on their applications. Topics covered include functions, relations and sets, basic logic, proof techniques, basics of counting, graphs and trees, and discrete probability. (C-ID COMP 152). |
|||
| Select one: | 3.00 | ||
|
|||
| Elective (any course numbered 1-99 or C1000-C1999) | 11.00 | Only necessary if the 60 units needed to graduate have not been completed. Consider taking a Cal-GETC General Education course. Visit www.assist.org to see options. | |
|
|
|||