Scribd
Upload
3 views28 pages

UNIT 2b (Boolean Algebra)

The document discusses Boolean algebra, which uses logical operations like AND, OR and NOT to simplify Boolean expressions. It defines various laws and theorems of Boolean algebra and provides examples of simplifying Boolean expressions and drawing equivalent logic circuits.

Uploaded by

Amir Shazz
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
3 views28 pages

UNIT 2b (Boolean Algebra)

The document discusses Boolean algebra, which uses logical operations like AND, OR and NOT to simplify Boolean expressions. It defines various laws and theorems of Boolean algebra and provides examples of simplifying Boolean expressions and drawing equivalent logic circuits.

Uploaded by

Amir Shazz
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1/ 28

BOOLEAN

OPERATION
(BOOLEAN
ALGEBRA)
BOOLEAN ALGEBRA

 Afterfinding the circuit


inputs and outputs, we
can come up with either
an expression or a truth
table to describe what
the circuit does.
BOOLEAN ALGEBRA
 Normal mathematical
expressions can be simplified
using the laws of algebra.

 For
binary system, we use
BOOLEAN ALGEBRA to simplify
BOOLEANS EXPRESSIONS
BOOLEAN ALGEBRA

A
Y
B

a) X . 0 = 0 c) X . X = X
b) X . 1 = X d) X . X = 0
BOOLEAN ALGEBRA

A
Y
B

a) X + 0 = X c) X + X = X
b) X + 1 = 1 d) X + X = 1
BOOLEAN ALGEBRA

A Y

a) If i/p A = 1, o/p Y = 0
b) If i/p A = 0, o/p Y = 1
BOOLEAN ALGEBRA
LAWS OF BOOLEAN ALGEBRA
 Commutative Law
 Associative Law
 Distributive Law
 Auxiliary Law
 De Morgan’s Law
BOOLEAN ALGEBRA
COMMUTATIVE LAW
 These laws indicate that the
order in which in which we
OR(+) or AND(x) two variables
is unimportant; the result is
the same.
X+Y=Y+X
X.Y = Y.X
BOOLEAN ALGEBRA
ASSOCIATIVE LAW
 which state that we can
group the variables in an
AND(x) expression or OR(+)
expression any way we want

X.(Y.Z) = (X.Y).Z = XYZ


X + (Y + Z) = (X + Y) + Z = X + Y + Z
BOOLEAN ALGEBRA
DISTRIBUTIVE LAW
 which state that an expression
can be expended by multiplying
term by term just the same as
in ordinary algebra

(W + X)(Y + Z) = WY + XY + WZ + XZ
X.(Y + Z) = (X.Y) + (X.Z)
BOOLEAN ALGEBRA
AUXILIARY LAW
 Do not have any counterparts
in ordinary algebra

X + XY = X X (X + Y) = X
X + XY = X + Y X (X + Y) = XY
BOOLEAN ALGEBRA
DE MORGAN’S THEOREM
 useful in simplifying expression
in which product (AND) and
sum (OR) of variables is
inverted. The two theorem are:

(X+Y)=X.Y
(X.Y)=X+Y
BOOLEAN ALGEBRA
RULES OF BOOLEAN ALGEBRA

1) A + 0 = A 7) A . A = A
2) A + 1 = 1 8) A . Ᾱ = 0
3) A . 0 = 0 9) A = A
4) A . 1 = A 10) A + AB = A
5) A + A = A 11) A + ᾹB = A + B
6) A + Ᾱ = 1 12) (A +B)(A + C) = A + BC
BOOLEAN ALGEBRA
Simplify the Boolean equation below and
draw the Logic Circuit:
CIrcuit:

1. Q = AB + A ( B + C ) + B ( B + C )

2. Q = AB + ABC
BOOLEAN ALGEBRA
1. Q = AB + A ( B + C ) + B ( B + C )
Solution:
Q = ( A B + A B )+ A C +(B B )+ B C
= A B + A C + (B + B C )
= AB + AC + ( B ( 1 + C ))
= AB + AC + B
= ( A B + B )+ A C
=( B ( A + 1 ) ) + A C
= B + AC
BOOLEAN ALGEBRA
1. Q = AB + A ( B + C ) + B ( B + C )
= B + AC
LOGIC CIRCUIT:
AC
A
Q
B B + AC
C
BOOLEAN ALGEBRA
2. Q = AB + ABC
Solution:

Q = AB + ABC
= A +B + A + B + C
=( A + A )+ ( B + B ) + C
= A + B + C
= ABC DE MORGAN’S
LAW
BOOLEAN ALGEBRA
2. Q = AB + ABC = ABC
LOGIC CIRCUIT:

A ABC
B Q
ABC
C
BOOLEAN ALGEBRA
2. Q = AB + ABC = ABC
LOGIC CIRCUIT:

A
Q
B
ABC
C
BOOLEAN ALGEBRA
Simplify the Boolean equation below and
draw the Logic Circuit:
CIrcuit:

3. Q = ( X + Y )( X + Y ) + XYZ

4. Y = A B C + A B C + A B C + A B C
BOOLEAN ALGEBRA
3. Q = ( X + Y )( X + Y ) + XYZ
Solution:
Q = XX + XY + XY + YY + XYZ
= ( X + XY + XY ) + 0 + XYZ
= X (1 + Y + Y ) + XYZ
= X (1 ) + XYZ
= X + XYZ
BOOLEAN ALGEBRA
3. Q = ( X + Y )( X + Y ) + XYZ
= X + XYZ
LOGIC CIRCUIT:
X + XYZ
X Y
X XY
Y XYZ
Z
BOOLEAN ALGEBRA
3. Q = ( X + Y )( X + Y ) + XYZ
= X + XYZ
LOGIC CIRCUIT:
X + XYZ
X Y
X
Y
Z XYZ
BOOLEAN ALGEBRA
4. Y = A B C + A B C + A B C + A B C
Solution:

Y = AB C + A B C + A B C + A B C
= A B( C + C ) + A C ( B + B )
= A B( 1 ) + A C ( 1 )
= A B + AC
BOOLEAN ALGEBRA
4. Y = A B C + A B C + A B C + A B C
= A B + AC
LOGIC CIRCUIT:

A AB
B B AB + AC
A AC Y
C C
BOOLEAN ALGEBRA
Write the Boolean equation for the following
combinational circuit:

A AB
Y
B
AB + BC
C BC

Y = AB + BC
BOOLEAN ALGEBRA
Write the Boolean equation for the following
combinational circuit:

A Y
B

C
BOOLEAN ALGEBRA
Write the Boolean equation for the following
combinational circuit:
A
B 1
Y
5
2 3
C
4

You might also like