Scribd
Upload
102 views13 pages

Chapter 3

This document discusses Boolean logic gates and their truth tables. It describes the NOT, AND, OR, NOR, and NAND gates. For each gate, it provides the symbol, explains the logic function, and includes the truth table and Boolean expression.

Uploaded by

Emirul_Umara
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
102 views13 pages

Chapter 3

This document discusses Boolean logic gates and their truth tables. It describes the NOT, AND, OR, NOR, and NAND gates. For each gate, it provides the symbol, explains the logic function, and includes the truth table and Boolean expression.

Uploaded by

Emirul_Umara
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 13

F1021

F1021
DIGITAL
DIGITAL SYSTEM
SYSTEM
CHAPTER 3: BOOLEAN
OPERATION
3.1 TRUTH TABLES
• A truth tables is a means for describing
how a logic circuit’s output depends on the
logic levels present at the circuit’s inputs.

• The tables lists all the possible


combinations of logic levels present at
inputs A and B, along with the
corresponding output level x.
A
B X

A B X
0 0 1
0 1 0
1 0 1
1 1 0
3.2 NOT (INVERTER) Gate
• NOT gate always has only a single
input, and its output logic level is
always opposite to the logic level of
this input.
NOT gate symbol
Input Output

A Y

Sign of Inverter

Truth Table

A Y
0 1
1 0 Boolean Expression

Y = A
3.3 AND Gate

• The AND gate is a gate which have two


input and one output.

• An AND gate output will be 1 only for the


case when all inputs are 1; for all other
cases, the output will be 0.

• The expression x = AB is read as “x equals


A AND B”.
AND gate symbol
A
Y
B

Truth Table

A B Y
0 0 0
0 1 0
Boolean Expression
1 0 0
1 1 1
Y = A.B
3.4 OR Gate
• OR gate is a circuit that has two or more inputs
and whose output is equal to the combination of
the inputs.

• The OR operation produces a result (output) of 1


whenever any input is a 1. otherwise the output is
0.

• The expression x = A + B is read as “x equals A


OR B”.
OR gate symbol

A
Y
B

Truth Table

A B Y
0 0 0
0 1 1
Boolean Expression
1 0 1
1 1 1
Y = A+B
3.5 NOR Gate
• It is the same as the OR gate symbol except
that it has a small circle on the output.

• The small circle represents the inversion


operation.

• Thus, the NOR gate operates like an OR gate


followed by an INVERTER.
NOR gate symbol

A Y
B

Truth Table

A B Y
0 0 1
0 1 0
Boolean Expression
1 0 0
1 1 0
Y = A+B
3.6 NAND Gate
• It is the same as the AND gate symbol
except for the small circle on its output.

• Once again, this small circle denotes the


inversion operation.

• Thus, the NAND operates like an AND


gate followed by an INVERTER.
NAND gate symbol

A
Y
B

Truth Table

A B Y
0 0 1
0 1 1
Boolean Expression
1 0 1
1 1 0
Y = A.B

You might also like