Maricopa Community Colleges  ELE131   20036-20045
Official Course Description: MCCCD Approval: 05/27/03
ELE131 20036-20045 LEC
LAB
3 Credit(s)
0 Credit(s)
3 Period(s)
3 Period(s)
Digital Logic and Circuits
Number systems, binary arithmetic, and Boolean algebra, combinational and sequential logic circuits, and memory elements. Prerequisites: Grade of "C" or better in GTC107 or equivalent or satisfactory math placement scores in (ELE101 or MAT092 or higher).
Go to Competencies    Go to Outline

MCCCD Official Course Competencies:

ELE131   20036-20045 Digital Logic and Circuits
 1. Describe the fundamentals of digital logic. (I) 2. Use logic symbols and truth tables to describe basic gates. (II) 3. Describe the various logic families and interfacing considerations between families. (II) 4. Apply laws of Boolean algebra to logic problems. (III) 5. Use Boolean algebra to simplify combinations of logic gates. (III) 6. Use Karnaugh maps, DeMorgan's theorems, and rules of Boolean algebra to analyze combinational logic circuits. (IV) 7. Implement Boolean expressions using logic gates. (IV) 8. Describe, implement, and measure combinational logic circuits incorporating commonly used integrated circuits. (V) 9. Explain the functional operation and characteristics of the flip-flog as a logic device. (VI) 10. Describe, implement, and measure sequential logic circuits incorporating commonly used integrated circuits. (VI, VII, VIII) 11. Use timing diagrams to analyze sequential logic circuits. (VI, VII, VIII) 12. Identify the types and applications of various memory devices. (IX)
Go to Description    Go to top of Competencies

MCCCD Official Course Outline:

ELE131   20036-20045 Digital Logic and Circuits
I. Overview of Digital Logic
A. Logic levels and pulse waveforms
B. Elements and functions of digital logic
C. Levels of digital integrated circuits
D. Digital testing and troubleshooting instruments
II. Logic Gates
A. The three basic logic gates, and, or and not
B. The nand and nor gate
C. Operating characteristics of logic families
III. Boolean Algebra
A. Rules, laws and DeMorgan's theorem for Boolean algebra
B. Simplification of Boolean expressions for gate networks
C. The Karnaugh map
IV. Combinational Logic
A. Analysis and design of combinational logic circuits
B. The universal property of the Nand and Nor Gate
C. Pulsed operation and troubleshooting
V. Functions of Combinational Logic
B. Encoders, decoders and code converters
C. Multiplexers and emultiplexers
D. Parity generators/checkers
VI. Flip-Flops and Other Multivibrator
A. Latches and edge-triggered flip-flops
B. Master-slave flip-flops
C. Operating characteristics and applications
D. One-shots and astable multivibrators
VII. Counters
A. Asynchronous counters
B. Synchronous counters