Scribd
Upload
44 views16 pages

Boolean Laws Lesson 3

The document discusses Boolean algebra and Boolean laws that are used to simplify Boolean expressions. Some key points: - Boolean expressions are simplified using Boolean laws in order to design simpler circuits with fewer components and lower costs. - Boolean laws include identity, inverse, complement, commutative, associative, distributive, absorption, and others. These laws can be proved using truth tables or algebraically using other Boolean laws. - Boolean expressions are simplified by applying Boolean laws such as distribution, absorption, identity, and others to reduce the expression size and complexity. This allows designing circuits with fewer components.

Uploaded by

anzilshahjahan1
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
44 views16 pages

Boolean Laws Lesson 3

The document discusses Boolean algebra and Boolean laws that are used to simplify Boolean expressions. Some key points: - Boolean expressions are simplified using Boolean laws in order to design simpler circuits with fewer components and lower costs. - Boolean laws include identity, inverse, complement, commutative, associative, distributive, absorption, and others. These laws can be proved using truth tables or algebraically using other Boolean laws. - Boolean expressions are simplified by applying Boolean laws such as distribution, absorption, identity, and others to reduce the expression size and complexity. This allows designing circuits with fewer components.

Uploaded by

anzilshahjahan1
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/ 16

 Like algebra, there are rules to manipulate

Boolean expressions.

 The rules are called the Boolean Laws and they


can be used for manipulating and simplifying the
Boolean expressions.

 Boolean expressions need to be simplified in


order to design simpler circuits.

 Reason : Less components are required and


therefore less cost is incurred.
 0 +x= x
 1 +x= 1
 0 . x= 0
 1 .x= x
1 X Output
1 0 1
1 1 1
Hence proved 1 + X =1

0 X Output
0 0 0
0 1 1

Hence proved 0+x=x


 INDEMPOTENCE LAW
❑X + X = X
❑X . X = X

 INVOLUTION
❑X’’ = X

X X’ X’’
0 1 0
1 0 1

Hence proved x=x’’


 COMPLEMENTARITY LAW
❑X + X’ = 1
❑X . X’ = 0
X X’ OUTPUT
0 1 1
1 0 1
Hence Proved

 COMMUTATIVE LAW
❑X + Y = Y + X
❑X . Y = Y . X
 ASSOCIATIVE LAW
❑ X + (Y + Z) = (X + Y) + Z
❑ X(YZ) = (XY)Z

 DISTRIBUTIVE LAW
❑X(Y+Z)=XY+XZ
❑X+YZ=(X+Y)(X+Z)
❑X+X’Y=X+Y
Prove the following Distributive law using the other
Boolean laws.

X+X’Y = X+Y
(X+X’) (X+Y) distributive law (X+Y)(X+Z)
1.(X+Y) Complementarity law
X+Y = X+Y
LHS = RHS
Hence proved.
 ABSORPTION LAW
❑X + XY = X
❑X (X+Y)=X
Prove X + XY = X using a Truth table
X Y XY X+XY
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1

 Prove X+XY =X algebraically (using Boolean laws)


X(1+Y) property of 1
X(1)
X Hence proved
 Prove using Boolean Laws and/or Truth Table

(a) a + ab =a

(b) a(a + b) =a

(c) a + a'b =a+b

(d) a(a' + b) =ab


 Prove:
(a) a + ab =a
a(1+b) Property of 1
a
(b) a(a + b)
a.a +ab Factoring
a+ab Indempotence law x.x=x
a(1+b) property of 1
a(1)
(c) a + a'b =a+b
(a + a')(a + b) distributive law (X+Y)(X+Z)
1(a + b) property of 1
a+b
(d) a(a' + b)
a. a' +ab Factoring
0+ab=ab Property of 0
Prove using Boolean Laws:
1. ab + ab' = a
a(b+b’)
a(1)

2. (a + b)(a + b') = a
aa + ab’ +ab + bb’
a + ab’ +ab+0
a(1+b’) +ab
a +ab
a(1+b)
a
3. ab + ab'c = ab + ac

4. (a + b)(a + b' + c) = a + bc
Copy the solution in your notebook and mention the laws
1. ab + ab' = a
ab + ab' = a(b+b') = a.1=a

2. (a + b)(a + b') = a
(a + b)(a + b') = a.a +a.b' +a.b+b.b'
= a + a.b' +a.b + 0
= a + a.(b' +b) + 0
= a + a.1 +0
= a +a=a
3. ab + ab'c = ab + ac
ab + ab'c
a(b + b'c)
a((b+b').(b+c))
a(b+c)
ab+ac

4. (a + b)(a + b' + c) =a+bc


(a.a + a.b' + a.c + ab +b.b' +bc)
a +a.b’ +ac+ab+0+bc
a+ab+ab’+ac+bc
a+ac+ab+ab’+bc
a+ab+ab’+bc
a+ab’+bc
a+bc
 X.Y + X.Z +X.Y.Z
X.Y+ X.Y.Z+X.Z (COMMUTATIVE LAW)
XY (1+Z) +XZ
XY.1 +XZ (PROPERTY OF 1)
XY+XZ
1. abc + abc’ + a’c
2. (a + b)(a + b' + c) = a + bc
END

You might also like