Official Course
Description: MCCCD Approval: 04/27/99 

CSC120
1999 Fall – 2000 Summer II 
L+L 
4 Credit(s) 
6 Period(s) 
Digital
Design Fundamentals 

Number
systems, conversion methods, binary and complement arithmetic, Boolean
switching algebra and circuit minimization techniques. Analysis and design of
combinational logic, flipflops, simple counters, registers, ROMs, PLDs,
synchronous and asynchronous sequential circuits, and state reduction
techniques. Building physical circuits. Prerequisites: CSC100, or CSC110, or
CSC181, or ELE181, or NET181, or equivalent, or permission of instructor. 

CrossReferences:
EEE120


Go to Competencies Go to Outline
MCCCD
Official Course Competencies: 



CSC120 1999
Fall – 2000 Summer II 
Digital Design Fundamentals 
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,
masterslave, edgetriggered 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 transferlevel components. (VI) 
Go to Description Go to top of
Competencies
MCCCD
Official Course Outline: 



CSC120 1999
Fall – 2000 Summer II 
Digital Design Fundamentals 
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. SOP and 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 SSI B. IEEE standard symbols C. Mixed mode logic D. Use of MSI elements:
multiplexors, decoders, bit slices E. Synthesis using ROMs and
PLAs V. Synchronous sequential
circuits A. Latches, masterslave,
and edgetriggered flipflops 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 