Certificate of Achievement in Computer Engineering
2025-2026 Map
Total Units: 17
Term 1
4 Units. Specified core courses are signified by icon.| Course Name | Units | Notes | |
|---|---|---|---|
| ENGR 10: Digital Logic Fundamentals | 4.00 | ||
|
Unit(s): 4.00
In this course the student will be trained in the use of symbolic digital logic including switching algebra, optimization, Karnaugh map construction and use and the design of combinational logic networks. The student will develop skills in mapping of sequential logic theory to practical devices using flip-flops, registers and counters. |
|||
Term 2
3 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). |
|||
Term 3
3 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). |
|||
Term 4
7 Units. Specified core courses are signified by icon.| Course Name | Units | Notes | |
|---|---|---|---|
| CSCI 22: Discrete Structures | 3.00 | Prerequisite: CSCI 20 and MATH 13 or MATH 13s or MATH 26 or MATH 26s or MATH 28 or MATH 28s | |
|
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). |
|||
| ENGR 17: Electrical Circuits and Devices | 4.00 | Prerequisite: PHYS 42, MATH 40 (or concurrent enrollment) | |
|
Prerequisite(s): PHYS 42, MATH 40 (or concurrent enrollment) An introduction to the analysis, construction and measurement of electrical circuits. Use of analytical techniques based on the application of circuit laws and network theorems. Basic use of electrical test and measurement instruments including multimeters, oscilloscopes, power supplies, and function generators. Use of circuit simulation software. Interpretation of measured and simulated data based on principles of circuit analysis for Direct Current (DC), analysis, transient, and sinusoidal steady-state Alternating Current (AC) conditions containing resistors, capacitors, inductors, dependent sources, operational amplifiers and/or switches. Elementary circuit design. Practical considerations such as component value tolerance and non-ideal aspects of laboratory instruments. Construction and measurement of basic operational amplifier circuits. Natural and forced responses of first and second order RLC circuits; the use of phasors; AC power calculations; power transfer; and energy concepts. (C-ID ENGR 260/260L). |
|||