Official Course Description: MCCCD Approval: 07/22/08
ELT131AA 19986-20086	LEC LAB	2 Credit(s) 0 Credit(s)	1.50 Period(s) 1.50 Period(s)
Digital and Logic Circuits I
Digital concepts and fundamentals, number systems and codes, Boolean algebra and combinational logic, logic reduction techniques, and logic hardware. Hands-on hardware and computer- aided logic design experiments. Prerequisites: ELT113, or ELT113AB, or permission of Instructor.
Cross-References: SMT131AA

Go to Competencies    Go to Outline
 

MCCCD Official Course Competencies:
ELT131AA   19986-20086	Digital and Logic Circuits I

1.	Describe the fundamentals of digital logic. (I)
2.	Make conversions among number systems and perform arithmetic operations in different number systems. (II)
3.	Use logic symbols and truth tables to describe basic gates. (III)
4.	Describe the various logic families and interfacing considerations between families. (III)
5.	Apply laws of Boolean algebra to logic problems. (IV)
6.	Use Boolean algebra to simplify combinations of logic gates. (IV)
7.	Use Karnaugh maps, DeMorgan's theorems, and rules of Boolean algebra to analyze combinational logic circuits. (V)
8.	Implement Boolean expressions using logic gates. (V)
9.	Describe, implement, and measure combinational logic circuits incorporating commonly used integrated circuits. (VI) 10.Use a PC to design and layout logic networks. (Labs)

Go to Description    Go to top of Competencies
 

MCCCD Official Course Outline:
ELT131AA   19986-20086	Digital and Logic Circuits I

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. Number systems and codes A. Decimal and binary numbers B. Binary arithmetic C. 1's and 2's complements D. Number system conversions E. Binary coded decimal (BCD) and other digital codes III. Logic gates A. The three basic logic gates: AND, OR, and NOT B. The NAND and NOR gate C. Operating characteristics of logic families IV. Boolean algebra A. Rules, laws, and DeMorgan's theorem for Boolean algebra B. Simplification of Boolean expressions for gate networks C. The Karnaugh map V. 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 VI. Functions of combinational logic A. Adders and comparators B. Encoders, decoders, and code converters C. Multiplexers and demultiplexers D. Parity generators/checkers

Go to Description    Go to top of Competencies    Go to top of Outline