0% found this document useful (0 votes)
1K views13 pages

Computer Servicing 4: Introduction To Logic Gates Boolean Algebra

The document introduces basic logic gates and Boolean algebra. It defines logic variables and functions, and describes truth tables for AND, OR, NOT, NAND, NOR and XOR gates. Basic logic gate symbols and their functions are explained. Boolean expressions are evaluated using truth tables and converted to hexadecimal. Common logic gate IC numbers and their associated gates are identified.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1K views13 pages

Computer Servicing 4: Introduction To Logic Gates Boolean Algebra

The document introduces basic logic gates and Boolean algebra. It defines logic variables and functions, and describes truth tables for AND, OR, NOT, NAND, NOR and XOR gates. Basic logic gate symbols and their functions are explained. Boolean expressions are evaluated using truth tables and converted to hexadecimal. Common logic gate IC numbers and their associated gates are identified.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Computer Servicing 4

INTRODUCTION TO LOGIC GATES BOOLEAN ALGEBRA


Objectives
 Know what Truth Tables are
 Know the Truth Tables for the Basic Gates
- AND, OR, NOT, NAND, NOR
 Know how to Analyze Simple Logic Circuits
- Via Timing Diagrams and Truth Tables
 Be able to use Boolean Algebra to manipulate simple digital logic equations
 Know what a Venn diagram is and how they apply to digital logic
 Know how to implement a function in both Sum of Products and Product of Sums form

Variables and Functions


 Consider a Flashlight
- L is the Function that represents the Flashlight
o L = 0 when light is off, L = 1 when light is on
- x is the Variable that represents the switch
o Switch open x = 0, switch closed x I
 X is an input Variable
- When x = 0 L = 0
- When x = 1 L = 1
 L(x) = x

Basic logic gates


 Not
 And
 Or
 Nand
 Nor
 Xor
The AND gate

Logic Gates: AND


The Output signal from an AND gate is True (on, 1)
if and only if both Input signals are True (on, 1).
The Output signal from an AND gate is False (off, 0),
otherwise.
The NOT gate (or inverter)

Logic Gates: NOT

The Output signal from a NOT gate is True (on, 1) if


and only if the Input signal is False.
The Output signal from a NOT gate is False (off, 0)
if and only if the Input signal is True
XOR, NOR, NAND GATE
The NOR gate
The Exclusive OR gate
Binary to Hexadecimal Conversion

Why are we using HEXADECIMAL VALUES for computer addressing?


The main reason why we use hexadecimal numbers is because it provides a more human-friendly
representation and is much easier to express binary number representations in hex than it is in any
other base number system.
OR Gate
Current flows if either switch is closed
— Logic notation A + B = C
COMP. SERVICING REVIEWER
What logic gate is the image shown below?

NOR

What Logic Gate refers to IC NUMBER "7402"


NOR

Solve the given circuit and convert to hexadecimal

07

B+C
A*(B+C)

No. A B C D B OR C A AND (B OR C)
1 0 0 0 0 0 0
2 0 0 1 0 1 0
3 0 1 0 0 1 0
4 0 1 1 0 1 0
5 1 0 0 0 0 0
6 1 0 1 1 1 1
7 1 1 0 1 1 1
8 1 1 1 1 1 1

8 4 2 1 8 4 2 1
0 0 0 0 0 1 1 1
0 7
0 7

What Logic Gate refers to IC NUMBER "7432"


OR

Solve the given circuit and convert to hexadecimal

D1

A+ B
B*C

( A+ B )+(B*C)
No. A B C D A NOR B B AND C ((A NOR B) OR (B AND C))
1 0 0 0 1 1 0 1
2 0 0 1 1 1 0 1
3 0 1 0 0 0 0 0
4 0 1 1 1 0 1 1
5 1 0 0 0 0 0 0
6 1 0 1 0 0 0 0
7 1 1 0 0 0 0 0
8 1 1 1 1 0 1 1

8 4 2 1 8 4 2 1
1 1 0 1 0 0 0 1
13 1
D 1

What Logic Gate refers to IC NUMBER "7400"


NOT

What Logic Gate refers to IC NUMBER "7408"


AND

Solve the given circuit and convert to hexadecimal

22
A+ B
C
( A+ B )+B+C

No. A B C D A NAND B NOT C ((A NAND B2) AND B AND (NOT C))
1 0 0 0 0 1 1 0
2 0 0 1 0 1 0 0
3 0 1 0 1 1 1 1
4 0 1 1 0 1 0 0
5 1 0 0 0 1 1 0
6 1 0 1 0 1 0 0
7 1 0 0 0 1 1 1
8 1 1 1 0 0 0 0

8 4 2 1 8 4 2 1
0 0 1 0 0 0 1 0
2 2
2 2

What logic gate is the image shown below?

AND

What logic gate is the image shown below?


NOT

What logic gate is the image shown below?

OR

What logic gate is the image shown below?


XOR

What logic gate is the image shown below?

NAND

You might also like