CLASS -XII(COMPUTER)

BOOLEAN ALGEBRA
• IMPORTANT DEFINITIONS
 The decision results into either YES(TRUE) or NO (FALSE) is called a Binary Decision.
 Truth table is a table which represents all the possible values of logical variables/ statements
along with all the possible results of the given combinations of values

• The sentences which can be determined to be true or false are called logical statements or truth
functions and the results TRUE or FALSE are called truth values.

The truth values are depicted by logical constants TRUE or FALSE or 1 and 0 (1 means TRUE
and 0 means FALSE).

The variables which can store these truth values are called logical variables or binary valued
variables as these can store only TRUE or FALSE.

• PRINCIPLE OF DUALITY(very important)

This states that starting with a Boolean relation another Boolean relation can be derived by:

 Changing each OR sign(+) to an AND sign (.)

 Changing each AND sign (.) to an OR sign (+)
 Replacing each 0 by 1 and each 1 by 0
 The derived relation using duality principle is called dual of original expression.
e.g. Find duality of following expressions(solved)
a) A . (B + C ) + 1 =1 ANS) A+ (B . C ) . 0 =0
b) X’ +(Y’ . 1) .Z= 1 ANS) X’ . (Y’ + 0) + Z= 0

➢ Find the dual/duality of following( Unsolved)

a) (A’+1) .(A’+B’).0=0
b) (A’+0 )+(B’ +1)=0
c) 1+A’+B’=C’+0

Basic Laws/ Theorems of Boolean Algebra

➢ Properties of 0 and 1(Very Important)

 0.0=0  A+0=A
 1+1=1  A .1=A
 0+0=0
 A+1=1
 1.1=1
 1.0=0.1=0  A .0=0
 1+0=0+1=1
1
1) Commutative Law :
Definition: The order of application of two separate terms is not important.
a) A + B = B + A b) A . B = B . A

A B A+B B+A A B A.B B.A

0 0 0 0 0 0 0 0
0 1 1 1 0 1 0 0
1 0 1 1 1 0 0 0
1 1 1 1 1 1 1 1

2) Complementary Law
When a variable is added to its complement results in 1 & the variable is multiplied with
its complement results in 0.
a) A + A’ = 1 b) A . A’ = 0

A A’ A+A’ A A’ A . A’
0 1 1 0 1 0
0 1 1 0 1 0
1 0 1 1 0 0
1 0 1 1 0 0

3)Idempotent Law
This law states that when a variable is either added or multiplied with same variable will
result in the same variable.
a) A + A= A b) A . A =A

A A A+ A A A A.A
0 0 0 0 0 0
1 1 1 1 1 1

4) Involution Law
This law states that double complement of any variable results in the same variable.
a) ( A’ )’ = A

A A’ ( A’ )’
0 1 0
1 0 1

2
Algebraic prove of Involution law :
( A’ )’ = ( A’ )’ + 0
= ( A’ )’ + A . A’
= [ ( A’ )’ + A] .[ ( A’ )’ + A’] (by distributing law)
= [ ( A’ )’ + A] . 1
= [ ( A’ )’ + A ]. [ A’ + A ]
= A +[ ( A’ )’ . A’]
= A+0
= A (Proved)

5) Identity Law
This law states that when zero(0) is added to a variable or the variable is multiplied with
one(1) will result in the same variable.
a) A + 0= A b) A . 1 =A

A A+0 A A.1
0 0 0 0
1 1 1 1

6) Absorption Law (Redundance Law)

This law enables a reduction in a complicated expression to a simpler one by absorbing
like terms.
a) A + AB= A b) A . (A+B) =A

A B A.B A+AB A B A+B A.(A+B)

0 0 0 0 0 0 0 0
0 1 0 0 0 1 1 0
1 0 0 1 1 0 1 1
1 1 1 1 1 1 1 1
 Absorption Law (Algebraic method)
Case 1: A+AB =A
LHS :
A+AB
= A( 1+B) [ Take A Common]
=A.1 [ 1+ B =1]
= A (RHS) [Identity Law]

Case 2: A. (A + B ) =A
LHS :
A.(A+B)
= A . A +A. B
= A + A. B [ A.A=A , Idempotent Law ]
= A ( 1 + B) [ Take A Common]
=A.1 [ 1+ B =1]
= A (RHS) [Identity Law]

3
 7) Associative Law
This law allows the removal of brackets from an expression and regrouping of the
variables.
a) A + (B + C) = (A + B) + C = A + B + C b) A .(B.C) = (A.B).C = A . B . C

a) A + (B + C) = (A + B) + C

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

0 0 0 0 0 0 0
0 0 1 0 1 1 1
0 1 0 1 1 1 1
0 1 1 1 1 1 1
1 0 0 1 0 1 1
1 0 1 1 1 1 1
1 1 0 1 1 1 1
1 1 1 1 1 1 1

8) Distributive Law (Very Very Important)

This law permits the multiplying or factoring out of an expression.
a) A(B + C) = A.B + A.C (OR Distributive Law )
b) A + (B.C) = (A + B). (A + C) (AND Distributive Law)

Case a) A(B + C) = A.B + A.C

A B C A.B A.C B+C A.(B+C) A.B+A.C

0 0 0 0 0 0 0 0
0 0 1 0 0 1 0 0
0 1 0 0 0 1 0 0
0 1 1 0 0 1 0 0
1 0 0 0 0 0 0 0
1 0 1 0 1 1 1 1
1 1 0 1 0 1 1 1
1 1 1 1 1 1 1 1

4
Case b) A + (B.C) = (A + B). (A + C)
A B C B.C A+B A+C A+(B.C) (A+B).(A+C)
0 0 0 0 0 0 0 0
0 0 1 0 0 1 0 0
0 1 0 0 1 0 0 0
0 1 1 1 1 1 1 1
1 0 0 0 1 1 1 1
1 0 1 0 1 1 1 1
1 1 0 0 1 1 1 1
1 1 1 1 1 1 1 1

 Distributive Law (Algebraic method)

A + (B.C) = (A + B).(A + C)
RHS:
=(A + B).(A + C)
=A.A + A.C + B.A +B.C
= A + A.C + B. A + B.C [ A.A =A , Idempotent Law]
= A ( 1+ C + B) + B.C [ Take A common]
= A . 1 + B.C [ 1+C+B= 1+B =1]
= A+ BC (LHS) [ A. 1= A , Identity Law]
9) Modified form of Distributive law (Special Law)
a) A + A’.B = A + B b) A . ( A’ + B ) = A . B
Case 1) A + A’.B = A + B (Algebraic method)

LHS :
= A + A’.B
= (A+ A’) (A+ B) [ Distributive Law ]
= 1.(A+B) [Complementary Law ]
= A+B (RHS)
Case 2 ) A . ( A’ + B ) = A . B (Algebraic method)

LHS :
= A . ( A’ + B )
= A .A’ + A.B
= 0 + A.B [Complementary Law ]
=A.B (RHS)

5
a) A + A’.B = A + B

A B A’ A’.B A + A’.B A+B

0 0 1 0 0 0
0 1 1 1 1 1
1 0 0 0 1 1
1 1 0 0 1 1
b) A . ( A’ + B ) = A . B
A B A’ A’+B A .( A’+B) A.B
0 0 1 1 0 0
0 1 1 1 0 0
1 0 0 0 0 0
1 1 0 1 1 1
***DeMorgan’s Theorms/Laws
one of the most powerful identities used in Boolean algebra is DeMorgan’s Theorm/Law

 X+Y = X .Y

 X .Y = X+Y

X Y X’ Y’ X’.Y’ (X+Y)’
0 0 1 1 1 1
0 1 1 0 0 0
1 0 0 1 0 0
1 1 0 0 0 0

X Y X’ Y’ X’+Y’ (X .Y)’
0 0 1 1 1 1
0 1 1 0 1 1
1 0 0 1 1 1
1 1 0 0 0 0

a) (X+Y)’ = X’.Y’ (Algebraic method)

Proof: Let us assume that P = X +Y
Where P, X ,Y are logical variables Then, according to complementation law
P + P’ = 1 and P . P’ =0
Case 1:
(X+ Y) + X’ .Y’ =1
(X+ Y) + X’ .Y’ = ((X+ Y) + X’ ) . (( X+ Y) + Y’ ) ( Distributive law (X + YZ=(X+ Y). (X+Z))
= ( X+ X’ + Y ) . ( X+ Y + Y’ )
= ( 1+ Y ) .( X + 1)
6
 = 1.1 = 1(proved)
Case 2:
(X+ Y) .(X’ .Y’) =0
(X+ Y) . X’ .Y’ = X’.Y’ . (X+ Y)
= (X’ .Y’. X )+(X’ .Y’ . Y) ( Distributive law X ( Y+Z)=X.Y+ X.Z )
= (X . X’. Y )+( X. Y . Y’)
= 0.Y+X.0
= 0 + 0 = 0 (proved)

b) (X .Y)’ = X‘+Y’ (Algebraic method)

Proof: Let us assume that P = X .Y
Where P, X ,Y are logical variables Then, according to complementation law
P + P’ = 1 and P . P’ =0
Case 1:
( X .Y) +( X’+Y’)=1
(X’+ Y’) + X .Y = (X’+ Y’ + X ) . (X’+ Y’ + Y ) ( Distributive law (X + YZ=(X+ Y). (X+Z))
= (X+ X’ + Y’ ) . (X’+ Y + Y’ )
= (1+ Y’ ) . ( X’ + 1)
= 1. 1
= 1 (R.H.S)
Case 2:
( X .Y ) . ( X’+Y’)=0
( X .Y) . (X’ +Y’ ) = (X. Y . X’ ) + ( X. Y . Y’ ) ( Distributive law (X + YZ=(X+ Y). (X+Z))
= ( X. X’ .Y ) + ( X . Y . Y’ )
= ( 0. Y ) +( X . 0)
=0+0
= 0 (R.H.S)

************
Note : Write above definitions in your School Boolean Algebra copy properly and neatly.

7
 Assignment -1
Q 1) Find complements (F’) of following by using DeMorgan’s Laws

a) A’ +(B’+C’)+(A’C’) Ans) A .(B .C).(A+C)

b) (A’+C’+B’).(A’+B+C’).D’ Ans) (A .C .B)+(A.B’.C)+D
c) (A’+B’)+(A’B’) Ans) (A . B ). (A +B)
d) X’.Y’+Y’Z’+X’ Ans) (X +Y).( Y+Z) .X
e) P’Q’R+P’Q’+PR’S Ans) (P+Q +R’) .(P +Q) .(P’ +R +S’)
f) A+(B'C+ABC) Ans) A .((B + C’) .(A’+B’+C’))
g) A'B'+AB(C+D) Ans) (A+B) .(A’+B’)+(C’.D’)

Note : Solve & Write answers of above questions in your Boolean algebra copy
Ans) a) A’ +(B’+C’)+(A’C’)
[ A’ +(B’+C’)+(A’C’) ]’
= A’’ . (B’+C’)’ . (A’C’)’
= A . (B’’. C’’) . (A’’ + C’’)
= A . (B . C ) . (A + C) (Ans)

Q 2) Verify the Following Algebraically:

a) X’Y +XY’ = (X’+Y’)(X+Y) (solved)

b) A+A’B =A+B
c) X+YZ=(X+Y)(X+Z)
d) X’Y+Z=(X’+Y’+Z)(X’+Y+Z)(X+Y+Z) (solved)
e) X+Y’Z=(X+Y’+Z’)(X+Y’+Z)(X+Y+Z)
f) X’Y+X’Y’+ZX’=X’
g) X.Y+Y’Z+YZ=X.Y+Z
h) A’B’C+A’BC+AB’C+ABC=C

Note : Solve & Write answers of above questions in your Boolean algebra copy

Ans) a) X’Y +XY’ = (X’+Y’)(X+Y)

RHS :
(X’+Y’)(X+Y)
= X’.(X+Y) + Y’(X+Y) (expression is expanded)
= X’.X + X’.Y +Y’.X+Y’.Y
= 0 +X’.Y+X.Y’+0 ( By using Complementary Law )
=X’Y+XY’ (LHS) proved

Ans) d) X’Y+Z=(X’+Y’+Z)(X’+Y+Z)(X+Y+Z)
RHS :
(X’+Y’+Z)(X’+Y+Z)(X+Y+Z)
= (X’+Y’+Z). (Y+Z+X’). (Y+Z+X) (by using Commutative Law)
=(X’+Y’+Z). ( Y+Z+X’.X) (by using distributing law)
=(X’+Y’+Z). ( Y+Z+0) ( by using complementary Law )
=( Z+ X’+Y’). ( Z + Y)
= ( Z+ (X’+Y’). Y) (by using distributing law)
= Z+ X’.Y+Y’.Y
=X’.Y+Z (LHS) proved

8
Q 3) Simplify following Boolean expressions algebraically by using boolean laws
a) P'Q+PQ'+P'Q' (solved)
b) A'BC+A'B'C+A'B'C'
c) A'B'CD+A'B'C'D'+A'B'C'D (solved)
d) (A.B'+A.B)(A+B)
e) (A+A'B)(A+B)
f) AB+BC+C'B
g) A.B.C+A.B'.C+A.C'
h) A'B'C+A'BC'+A'B'C'+A'BC

Note : Solve & Write answers of above questions in your Boolean algebra copy

Ans) a) P'Q+PQ'+P'Q'
= P’ Q + (P+P’).Q’
= P’. Q + 1. Q’
= Q’ + Q.P’
= Q’+P’ (Ans)

Ans) c) A'B'CD+A'B'C'D'+A'B'C'D
= A'B'CD+(A'B'C').(D'+D)
= A'B'CD+(A'B'C') .1
= A'B'CD+A'B'C'
= A'B'(C' + CD)
= A'B'(C' + D)
=A'B'C' + A'B'D (Ans)

********
2c) X+YZ=(X+Y)(X+Z)(check the prove of distributing law) 2f) X’Y+X’Y’+ZX’=X’
LHS : X’Y+X’Y’+ZX’
2e) X+Y’Z=(X+Y’+Z’)(X+Y’+Z)(X+Y+Z) =X’.(Y+Y’+Z)
RHS: (X+Y’+Z’)(X+Y’+Z)(X+Y+Z) = X’.(1+Z) (By using Complementary Law)
= ((X+Y’)+Z’.Z) .(X+Y+Z) (By using distributing law) = X’.1 (Because 1+Z=1)
= (X+Y’) .(X+Y+Z) = X’ (RHS)
= X+Y’(Y+Z) (By using distributing law)
2h) A’B’C+A’BC+AB’C+ABC=C
= X+Y.Y’ +Y’.Z =X+Y’Z (LHS)
LHS: A’B’C+A’BC+AB’C+ABC
= A’B’C + AB’C + A’BC + ABC (rearranged)
2g) X.Y+Y’Z+YZ=X.Y+Z
= B’C(A’+A) +BC(A’+A)
LHS : X.Y+Y’Z+YZ
=B’C.1+BC.1(By using Complementary Law)
= X.Y +Z.(Y’+Y)
= B’C +BC
= X.Y +Z .1 (By using Complementary Law)
= C(B’+B) =C .1 =C (RHS)
= X.Y+Z (RHS)

9
3b) A'BC+A'B'C+A'B'C' 3d)(A.B'+A.B)(A+B)
= A’.(BC+B’C+B’C’) = (A.(B’+B)) .(A+B)
= A’.(C(B+B’)+B’C’) = (A. 1). (A+B)
= A’.(C.1+C’B’) = A.(A+B)
=A’.(C+B’) (ANS) =A.A+A.B= A+AB
= A.(1+B)=A.1=A (ANS)
3e) (A+A'B)(A+B)
3f) AB+BC+C'B
=A.A+A.B+A’.B.A+A’.B.B
= B.(A+C+C’)
= A+A.B+0+A’.B
=B.(A+1)
= A+AB+A’B
=B.1 =B(ANS)
= A+B(A+A’)
= A+B (ANS)

3g) A.B.C+A.B'.C+A.C' 3h) A'B'C+A'BC'+A'B'C'+A'BC

=AC.(B+B’)+AC’ = A'B'C+ A'B'C'+ A'BC'+A'BC
= AC. 1 +AC’ = A'B'(C+ C') +A’B(C’+C)
=AC+AC’ = A’B’.1+A’B.1
= A(C+C’) = A’B’+A’B =A’(B’+B)=A’.1=A’(ANS)
=A.1= A(ANS)

10