Center for Curriculum and Transfer Articulation
Digital Design Fundamentals
Course: CSC120

First Term: 2019 Fall
Lec + Lab   4.0 Credit(s)   6.0 Period(s)   6.0 Load  
Course Type: Academic
Load Formula: T - Lab Load

Description: Number systems, conversion methods, binary and complement arithmetic, Boolean switching algebra and circuit minimization techniques. Analysis and design of combinational logic, flip-flops, simple counters, registers, Read Only Memory (ROMs), Programmable Logic Device (PLDs), synchronous and asynchronous sequential circuits, and state reduction techniques. Building physical circuits.

MCCCD Official Course Competencies
1. Represent numbers in the binary, octal, hexadecimal, and decimal systems. (I)
2. Perform fundamental arithmetic operations within each number systems. (I)
3. Apply postulates and theorems of Boolean algebra to switching functions. (II)
4. Construct and interpret truth tables. (II)
5. Write switching functions in canonical form. (II)
6. Simplify switching functions through algebraic manipulation, DeMorgan`s theorem, and Karnaugh maps. (II, III)
7. Implement switching circuits with SSI elements (AND gates, OR gates, and inverters), MSI elements (multiplexors, decoders, and bit slices), ROMs and PLAs. (IV)
8. Use synchronous sequential circuits with latches, master-slave, edge-triggered flipflops, and counters. (V)
9. Design synchronous sequential circuits by utilizing Mealy and Moore models for clocked sequential circuits, state transition tables and diagrams, and simplification techniques. (V)
10. Use Register Transfer Logic to describe the information flow between registers. (VI)
11. Develop algorithms for the control of shift registers, counters, and other register transfer-level components. (VI)
MCCCD Official Course Outline
I. Numbering systems
A. Properties of discrete versus continuous systems
B. Binary, octal, hexadecimal, and decimal representation
C. Conversion between radices
D. Signed, one`s, two`s complement representation
E. Addition and subtraction
II. Boolean and switching algebra
A. Huntington`s postulates
B. DeMorgan`s theorem
C. Truth tables
D. Sum of Products (SOP) and Products of Sums (POS) canonical forms
III. Simplification of switching functions
A. Algebraic manipulation
B. Karnaugh maps
C. Handling don`t care conditions
IV. Implementation of switching circuits
A. Random logic in Small Scale Integration (SSI)
B. Institute of Electrical and Electronics Engineers (IEEE) standard symbols
C. Mixed mode logic
D. Use of Medium Scale Integration (MSI) elements: multiplexors, decoders, bit slices
E. Synthesis using Read-Only Memory (ROM) and Programmable Logic Array (PLA)
V. Synchronous sequential circuits
A. Latches, master-slave, and edge-triggered flip-flops
B. Counters
C. Mealy and Moore models for clocked sequential circuits
D. State transition tables and diagrams
E. Simplification techniques
VI. Register level design
A. Shift registers and counters
B. Control flow specification
C. Control states and control functions
MCCCD Governing Board Approval Date: May 28, 2019

All information published is subject to change without notice. Every effort has been made to ensure the accuracy of information presented, but based on the dynamic nature of the curricular process, course and program information is subject to change in order to reflect the most current information available.