|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
2.00 Credits
Lecture, 1 hour; laboratory, 3 hours. Prerequisite(s): CS 005 or CS 010 or knowledge of programming or consent of instructor. Practical exploration of problem solving using Bash scripting in a laboratory setting. Focus is on syntax, concepts, and idiomatic use. Graded Satisfactory (S) or No Credit (NC). Segment is repeatable as topics change to a maximum of 12 units.
-
2.00 Credits
Lecture, 1 hour; laboratory, 3 hours. Prerequisite(s): CS 005 or CS 010 or knowledge of programming or consent of instructor. Practical exploration of problem solving and software development using Python in a laboratory setting. Focus is on syntax, concepts, standard library, and development tool-chain use. Graded Satisfactory (S) or No Credit (NC). Segment is repeatable as topics change to a maximum of 12 units.
-
4.00 Credits
Lecture, 3 hours; laboratory, 3 hours. Prerequisite(s): CS 010 with a grade of "C-" or better. An introduction to computer organization. Topics include number representation, combinational and sequential logic, computer instructions, memory organization, addressing modes, interrupt, input/output (I/O), assembly language programming, assemblers, and linkers.
-
4.00 Credits
Lecture, 3 hours; laboratory, 3 hours. Prerequisite(s): CS 141. Development and construction of software products. Topics include design, coding layout, and style; implementation strategies; quality attributes; prototyping, reuse, and components; debugging, testing, and performance; integration and maintenance; documentation; standards, analysis, and selection of tools and environment; and personal software processes.
-
4.00 Credits
Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 010; CS 011/MATH 011; MATH 009C or MATH 09HC. Study of discrete mathematical structures with emphasis on applications to computer science. Topics include asymptotic notation, generating functions, recurrence equations, elements of graph theory, trees, algebraic structures, and number theory. Cross-listed with MATH 111.
-
5.00 Credits
Lecture, 3 hours; laboratory, 6 hours. Prerequisite(s): CS 061 with a grade of "C-" or better. Covers the design of digital systems. Topics include Boolean algebra; combinational and sequential logic design; design and use of arithmeticlogic units, carry-lookahead adders, multiplexors, decoders, comparators, multipliers, flip-flops, registers, and simple memories; state-machine design; and basic register-transfer level design. Interdisciplinary laboratories involve use of hardware description languages, synthesis tools, programmable logic, and significant hardware prototyping. Cross-listed with EE 120A.
-
5.00 Credits
Lecture, 3 hours; laboratory, 6 hours. Prerequisite(s): CS 120A/EE 120A. Introduction to hardware and software design of digital computing systems embedded in electronic devices (such as digital cameras or portable video games). Topics include embedded processor programming, custom processor design, standard peripherals, memories, interfacing, and hardware/software tradeoffs. Interdisciplinary laboratory involves use of synthesis tools, programmable logic, and microcontrollers and development of working embedded systems. Cross-listed with EE 120B.
-
5.00 Credits
Lecture, 3 hours; laboratory, 6 hours. Prerequisite(s): CS 012 or CS 013; CS 120B/EE 120B. Covers software and hardware design of embedded computing systems. Topics include hardware and software codesign, advanced programming paradigms (including state machines and concurrent processes), real-time programming and operating systems, basic control systems, and modern chip and design technologies. Laboratories involve use of microcontrollers, embedded microprocessors, programmable logic and advanced simulation, and debug environments.
-
5.00 Credits
Lecture, 3 hours; laboratory, 6 hours. Prerequisite(s): CS 122A. Explores state-of-the-art aspects of building embedded computer systems. Topics include real-time programming, synthesis of coprocessor cores, application-specific processors, hardware and software cosimulation and codesign, low-power design, reconfigurable computing, corebased design, and platform-based methodology.
-
4.00 Credits
Lecture, 3 hours; laboratory, 3 hours. Prerequisite(s): CS 141, MATH 113 (MATH 113 may be taken concurrently); or consent of instructor. A study of the fundamentals of computer graphics necessary to design and build graphics applications. Examines raster graphics algorithms including scan-converting graphics primitives, antialiasing, and clipping. Also covers geometric transformations, viewing, solid modeling techniques, hiddensurface removal algorithms, color models, illumination, and shading. Individual and group projects are assigned.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|