Practice Questions:

Question 1: Write the Boolean expression that describes mathematically the behavior of logic
circuit shown in the figure. Use a truth table to determine what input conditions produce a logic 1
output.

Truth table :

Produce logic 1 output when A=0 B=0 C=0 , A=1 B=0 C=0 , A=1 B=1 C=0
Question 3:
Minimize the following expressions using Boolean rules.

i) A.B.C + A’B + A.B.C’

ii) AB + A’ C + B C
iii) (A + B) (A’ + C) (B + C)

Solution:
i) A.B.C + A’B + A.B.C’
A.B.C + A.B.C’ + A’B (Using commutative law)
A.B(C+C’) + A’B A.B is common using distributive law
A.B.1 + A’B as c+c’ = 1
A.B + A’B
B(A+A’)
B.1 =B

ii) AB + A’ C + B C
AB + A’ C + 1.B C
AB + A’ C + (A+A’).B C as a+a’ = 1
AB + A’C + ABC + A’BC distributive law
AB + ABC + A’C + A’BC
AB(1+C) + A’C(1+B) taking common using distributive law
AB + A’C

iii) (A + B) (A’ + C) (B + C)
(A + B) (A’B + C) using absorption law
AA’B + AC + A’BB + BC
0 + AC + A’B + BC
AC + A’B + BC
Question 4.
Prove that a’bc + ab’c + abc’ + abc = a.b + b.c + a.c

Method 1:
L.H.S. a’bc + ab’c + abc’ + abc
a’bc + ab’c + ab(c’ +c)
a’bc + ab’c + ab.1
a’bc + ab’c + ab
a’bc + a(b’c + b)
a’bc + a(c + b) Absorption law
a’bc + ac + ab Distributive law
(a’b + a)c + ab taking common
(a+b)c + ab Absorption law
ac + bc + ab (R.H.S)

Method 2:
L.H.S. a’bc + ab’c + abc’ + abc
a’bc + ab’c + abc’ + abc + abc + abc as a+a = 1 (Idempotance law)
a’bc + abc + ab’c + abc + abc’ + abc
bc(a’+a) + ac(b’+b) + ab(c’+c) taking common
bc.1 + ac.1 + ab.1
bc + ac + ab (R.H.S.)

Method 3:
R.H.S. a.b + b.c + a.c
a.b.1 + 1.b.c + a.1.c Property of 1
a.b(c+c’) + (a+a’)b.c + a.(b+b’).c as x+x’ = 1
abc + abc’ + abc + a’bc + abc + ab’c distributive law
abc + abc’ + a’bc + ab’c (removing common as x+x = x)
(L.H.S)