Maricopa Community Colleges  CSC120   19932-19975
Official Course Description: MCCCD Approval: 12/15/92
CSC120 19932-19975 L+L 3 Credit(s) 5 Period(s)
Digital Design Fundamentals
Number systems, conversion methods, binary and complement arithmetic, Boolean and switching algebra, circuit minimizations, ROMs, PLAs, flipflops, synchronous sequential circuits, register transfer design. Prerequisites: CSC100, or ECE105, or ELT281, or equivalent, or permission of instructor.
Cross-References: EEE120
Go to Competencies    Go to Outline

MCCCD Official Course Competencies:

CSC120   19932-19975 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, 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)
Go to Description    Go to top of Competencies

MCCCD Official Course Outline:

CSC120   19932-19975 Digital Design Fundamentals
I. Numbering systems
A. Properties of discrete versus continuous systems
B. Binary, octal, hexadecimal, and decimal representation
D. Signed, one's, two's complement representation
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, master-slave, and edge-triggered 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
Go to Description    Go to top of Competencies    Go to top of Outline