# Computer Science/Software Engineering (CSC) courses

Porterville College · 2026-2027 Catalog · 5 courses

Source: https://reg-prod.ec.kccd.edu/StudentRegistrationSsb/ssb/term/termSelection?mode=courseSearch

"Offered" lists sections in this catalog year's class schedules: Summer 2026, Fall 2026, Spring 2027.

### CSC P112 — Prog Method Using Python

- **Units:** 3
- **Hours:** Total lecture 54 hours
- **C-ID:** COMP 112
- **Transfers to:** CSU, UC
- **Offered:** not on the Summer 2026, Fall 2026, Spring 2027 schedules
- Degree applicable

This course is designed as a first course in Software Engineering and Computer Science majors. Students will use the object-oriented programming language to learn the fundamentals of programming. Topics include: variables, sequence, selection, iteration, file I/O, error handling, the software life-cycle, as well as common programming algorithms such as sorting and searching. Students will need access to a computer and internet to use the programming tool such as Python and/or Microsoft Visual Studio Code.

### CSC P122 — Prog Concept & Meth I C++

- **Units:** 4
- **Hours:** Total lecture 72 hours
- **Advisory:** CSC P112 or equivalent.
- **C-ID:** COMP 122
- **Transfers to:** CSU, UC
- **Offered:** Spring 2027, 2 sections (/c/porterville-college/schedule/spring-2027/csc.md)
- Degree applicable

Introduces the discipline of computer science using an object-oriented language (C++).Topics included are: overview of high-level languages, fundamental programming constructs such as file I/O, computation, conditionals and iterative structures, functions, variable types, object-oriented design (abstraction, encapsulation, inheritance, and polymorphism, problem-solving techniques, debugging programs, reading and writing pseudocode, binding, visibility, scope, and lifetime management. Students will need access to internet, computer, and software with integrated development environment (IDE) such as Microsoft Visual Studio Code.

### CSC P133 — Prog Concept & Meth II C++

- **Units:** 3
- **Hours:** Total lecture 54 hours
- **Prerequisite:** CSC P122 or equivalent.
- **C-ID:** COMP 132
- **Transfers to:** CSU, UC
- **Offered:** not on the Summer 2026, Fall 2026, Spring 2027 schedules
- Degree applicable

Application of software engineering techniques to the design and development of large programs; data abstraction and structures and associated algorithms. Object-Oriented Programming techniques and design including inheritance, polymorphism, encapsulation. Structures including arrays, records, strings, linked lists, queues, stacks, hash tables, and graphs. Growth rates of algorithms will be analyzed using time and space complexity utilizing best, average, and worst case scenarios (Big-O). Students will need access to internet, computer, and software (integrated development environment IDE) such as Microsoft Visual Studio Code.

### CSC P142 — Computer Arch & Org

- **Units:** 4
- **Hours:** Total lecture 54 hours, total laboratory 54 hours
- **Advisory:** ENGR P120 or equivalent.
- **C-ID:** COMP 142
- **Transfers to:** CSU, UC
- **Offered:** Fall 2026, 1 section (/c/porterville-college/schedule/fall-2026/csc.md)
- Degree applicable

The organization and behavior of real computer systems at the assembly-language level. The mapping of statements and constructs in a high-level language onto sequences of machine instructions is studied, as well as the internal representation of simple data types and structures. Numerical computation is examined, noting the various data representation errors and potential procedural errors.

### CSC P152 — Discrete Structures

- **Units:** 3
- **Hours:** Total lecture 54 hours
- **Prerequisite:** ENGR P120 or equivalent.
- **C-ID:** COMP 152
- **Transfers to:** CSU, UC
- **Offered:** Spring 2027, 1 section (/c/porterville-college/schedule/spring-2027/csc.md)
- Degree applicable

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.