|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Basic principles of algorithmic problem solving and programming using methods of top-down design, stepwise refinement and procedural abstraction. Basic control structures, data types, and input/output. Introduction to the software development process: design, implementation, testing and documentation. The syntax and semantics of a modern programming language. Credit not available for students who have taken CSC/CPE 108. 3 lectures, 1 laboratory. Prerequisite: MATH 118 (or equivalent) with a grade of C- or better, and basic computer literacy (CSC 100 or CSC 232 or equivalent).
-
4.00 Credits
Basic design, implementation, testing, and documentation of object-oriented software. Introduction to classes, interfaces, inheritance, algorithms (sort, search, recursion), abstract data types, data structures (lists, stacks, queues), file I/O, and exceptions. Credit not available for students who have taken CSC/CPE 108. 3 lectures, 1 laboratory. Prerequisite: CSC/CPE 101 with a C- grade or better and either MATH 141 or MATH 221 with a C- grade or better. Corequisite: CSC 141.
-
4.00 Credits
Introduction to data structures and analysis of algorithms. Abstract data types. Specification and implementation of advanced data structures. Theoretical and empirical analysis and proofs of properties of recursive and iterative algorithms. Software performance evaluation and testing techniques. 3 lectures, 1 laboratory. Prerequisite: CPE 102 with a C- grade or better and CSC 141 with a C- grade or better.
-
4.00 Credits
Accelerated introduction to basic principles of algorithmic and object-oriented problem solving and programming. Introduction to programming language concepts including control structures, data types, classes, and inheritance. Program design principles. Use and implementation of algorithms (searching, sorting, recursion) and data structures (lists, stacks, and queues). Intended for students with experience in algorithmic problem solving and using basic control structures and data types in a modern programming language (CSC/CPE 101), but who are not ready for CSC/CPE 102. Credit not available for students who have taken CSC/CPE 102. 3 lectures, 1 laboratory. Prerequisite: Math 118 (or equivalent) with a grade of C- or better, significant experience in computer programming, and consent of instructor. Corequisite: CSC 141.
-
3.00 Credits
Number systems, Boolean algebra, Boolean functions, and minimization. Analysis and design of combinational logic circuits. Feedback circuits. Analysis and design of sequential logic circuits. Applying Hardware Description Language (HDL) to synthesize digital logic circuits in Programmable Logic Devices (PLDs). 3 lectures. Prerequisite: An orientation course in student's major (EE 111/151 for EE students, CPE 100 for CPE students), CPE/CSC 101. Concurrent: CPE 169.
-
1.00 Credits
Experiments to analyze and design combinational and sequential logic circuits with discrete ICs and PLDs. Introduction to laboratory equipment such as the logic state analyzer for testing circuits. Introduction to a hardware description language for logic simulation and design. 1 laboratory. Prerequisite: An orientation course in student's major (EE 111/151 for EE students, CPE 100 for CPE students), CPE/CSC 101. Concurrent: CPE 129.
-
1.00 - 2.00 Credits
Individual investigation, research, studies, or surveys of selected problems. Total credit limited to 4 units, with a maximum of 2 units per quarter. Prerequisite: Consent of instructor.
-
3.00 Credits
Design and implementation of digital computer circuits via CAD tools for programmable logic devices (PLDs). Basic computer design with its data path components and control unit. Introduction to assembly language pro-gramming of an off-the-shelf RISC-based microcontroller. 3 lectures. Pre-requisite: CPE 129&169 with a C- grade or better. Concurrent: CPE 269.
-
4.00 Credits
Introduction to the fundamentals of computer programming with an emphasis on mathematical, scientific and engineering applications: principles of algorithmic problem solving and procedural programming using a modern programming language, data types, elementary data structures, input/output and control structures. Not a substitute for CSC/CPE 101 for CSC/CPE majors or minors. 3 lectures, 1 laboratory. Prerequisite: MATH 141 or MATH 161 with a grade of C- or better, or consent of instructor.
-
4.00 Credits
Further study of computer program development with an emphasis on mathematical, scientific and engineering applications. Introduction to more complicated data types and structures. Practice of more complicated techniques of procedural programming. Introduction to the principles of object-oriented programming using a modern programming language. Detailed discussion of lists and classic list algorithms, algorithm analysis, multidimensional arrays, records, dynamic data structures, file input/output, classes. Not a substitute for CSC/CPE 102 for CSC/CPE majors or minors. 3 lectures, 1 laboratory. Prerequisite: CSC/CPE 235 with a grade of C- or better, or consent of instructor.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|