Scribd
Upload
41 views35 pages

4.1logic Gates Boolean Algebra and Truth Table

Digital logic uses binary digits (0s and 1s) to represent data and instructions in a computer. There are three basic logic gates: AND, OR, and NOT. The AND gate outputs 1 only if all its inputs are 1. The OR gate outputs 1 if any of its inputs are 1. The NOT gate inverts the input, outputting 0 for 1 and 1 for 0. More complex gates like NAND and NOR combine these basic gates.

Uploaded by

Jonash Miguel Lorzano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views35 pages

4.1logic Gates Boolean Algebra and Truth Table

Digital logic uses binary digits (0s and 1s) to represent data and instructions in a computer. There are three basic logic gates: AND, OR, and NOT. The AND gate outputs 1 only if all its inputs are 1. The OR gate outputs 1 if any of its inputs are 1. The NOT gate inverts the input, outputting 0 for 1 and 1 for 0. More complex gates like NAND and NOR combine these basic gates.

Uploaded by

Jonash Miguel Lorzano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 35

Digital Logic, Boolean

Algebra, Truth Table


Joseph F. Morco
https://www.electronics-tutorials.ws/boolean/bool_1.html
Digital Logic
(Binary Logic)

 In computer science, a strict set of rules


for representing the relationships and
interactions among numbers, words,
symbols and other data stored or entered in
the memory of a computer.
Digital Logic

 Theinstructions that direct a computer’s


operation are known as machine language,
and they are written as a sequence of
binary digits.
 Thesebinary digits, or bits, switch specific
groups of transistors, called gates, on or
off.
 There are three basic logic states, or
functions, for logic gates.
AND
OR
NOT
Logic Gate Operations

 Logic AND Function


 Logic OR Function
 Logic NOT Function
 Logic NAND Function
 Logic Nor Function
Logic AND Function

 Statesthat two or more events must occur


together and at the same time for an
output to occur.
 In Boolean algebra the Logic AND Function
follows the Commutative Law which allows
a change in position of either variable.
Logic AND Function (Representation)

 TheAND Function is represented in


electronics by the dot or full stop symbol
(.)
 Thusa 2-input (A B) AND Gate has an output
term represented by the Boolean
expression A.B or just AB.
Switch Representation of the AND Function
AND Function Truth Table

Switch A Switch B Output Description

0 0 0 A and B are both open,


lamp OFF
0 1 0 A is open B is closed, lamp
OFF
1 0 0 A is closed B is open, lamp
is OFF
1 1 1 A is closed and B is closed,
lamp ON
Boolean Expression (A AND B) A.B
2-Input AND Gate
Logic OR Function

 Statesthat an output action will become


TRUE if either one “OR” more events are
TRUE.
 In Boolean algebra tha Logic OR Function
follows the Commutative Law, allowing a
change in position of either variable.
Logic OR Function (Representation)

 The logic or Boolean expression given for a


logic OR gate is that for Logical Addition
which is denoted by a plus sign, (+).
 Thusa 2-input (A B) Logic OR Gate has an
output term represented by the Boolean
expression of: A + B = Q.
Switch Representation of the OR Function
OR Function Truth Table

Switch A Switch B Output Description

0 0 0 A and B are both open,


lamp OFF
0 1 1 A is open B is closed, lamp
ON
1 0 1 A is closed B is open, lamp
is ON
1 1 1 A is closed and B is closed,
lamp ON
Boolean Expression (A OR B) A+B
2-Input OR Gate
Logic NOT Function

A single input inverter that changes the


input of a logic level “1” to an output of
logic level “0” and vice versa.
Logic NOT Function

 Itsoutput state is NOT the same as its input


states with its Boolean Expression generally
denoted by a bar or overline ( ) over its
input symblol which denotes the inversion
operation,
Switch Representation of the NOT Function
NOT Function Truth Table

Switch Output

1 0

0 1

Boolean Expression Not-A or A


Inverter of NOT Gate
 InBoolean algebra the inverter Logic NOT
Function follows the Complementation Law
producing inversion.
NOT Function Equivalents
Logic NAND Function

 The Logic NAND Function output is only


false when all of its inputs are true,
otherwise the output is alwasy true.
Logic NAND Function

 TheNAND or “Not AND” function is a


combination of the two separate logical
functions, the AND function and the NOT
function in series.
 Thelogic NAND function can be expressed
by the Boolean expression of, A.B
Switch Representation of the NAND Function
NAND Function Truth Table

Switch A Switch B Output Description

0 0 1 A and B are both open,


lamp ON
0 1 1 A is open B is closed, lamp
ON
1 0 1 A is closed B is open, lamp
is ON
1 1 0 A is closed and B is closed,
lamp OFF
Boolean Expression (A AND B) A.B
2-Input NAND Gate
Logic NOR Function

 TheLogic NOR Function output is only true


when all of its inputs are false, otherwise
the output is alwayse false.
Logic NOR Function

 The NOR or “Not OR” gate is also a


combination of two separate logic
functions, NOT and OR connected together
to form a single logic function which is the
same as the OR function except that the
output is inverted.
Logic NOR Function

 Tocreate a NOR gate, the OR function and


the NOT function are connected together in
series with its operation given by the
Boolean expression as, A + B
Switch Representation of the NOT Function
NOR Function Truth Table

Switch A Switch B Output Description

0 0 1 Both A and B areopen,


lamp ON
0 1 0 A is open B is closed, lamp
OFF
1 0 0 A is closed B is open, lamp
is OFF
1 1 0 A is closed and B is closed,
lamp OFF
Boolean Expression (A OR B) A+B
2-Input NOR Gate

You might also like