SAIMEDHA

MAKE ENGINEER - MAKE INDIA

KOTI HYDERABAD
BOOLEAN ALGEBRA -2
01. SOP canonical form of function F = X + YZ will be Option: 4
Sol: F =  x,y,z     0, 2, 4,5, 6 
1) m 2  m 3 2)  1, 4,5, 6,7 
3) M 0  M 3
yz
x
4) XYZ + XYZ + XYZ + XYZ yz yz yz yz
Option: 2
x 1 1
Sol: F = X + YZ
x 1 1 1
x yz
yz yz yz yz F=Z +XY
x 1 04. The simplified form of the function

x 1 1 1 1 F  A,B,C,D    m 1,5, 6, 7,11,12,13,15  is

1) ACD  ABC  ABC  ACD  BD

(b)  1, 4,5,6, 7  2) ACD  ABC  ABC  ACD  BD
02. Simplify the following Boolean function:
3) ACD  ABC  ABC  ACD
f  A,B,C   ABC + ABC + ABC + ABC + ABC
4) ACD  ABC  ABC  ACD
1) ABC + ABC + AB 2) ABC + AC + AB Option: 3
3) AB + BC + AC 4) ABC + AC + AB Sol: F  A,B,C,D    m 1,5, 6, 7,11,12,13,15 
Option: 3
Sol: f  A,B,C   ABC + ABC + ABC + ABC + ABC CD
AB CD CD CD CD
 ABC + ABC + ABC + ABC

BC AB 1
A
BC BC BC BC AB 1 1 1
A 1 AB 1 1 1
A 1 1 1 AB 1

f(A,B,C)=BC+AC+AB
F = ACD + ABC + ABC  ACD
05. Which code is used to map the digital dates in
03 For the given Boolean function K-map for simplification?
F =  x,y,z     0, 2, 4,5, 6  simplified output will 1) Binary code 2) Exceed-3 code
be - 3) ASCII code 4) Gray code
1) F = z  xy ' 2) F = z  x ' y Option: 4

3) F = z ' x ' y 4) F = z ' xy '

SAIMEDHA PAGE NO: 1

Sol: Gray code belongs to a class of codes called
minimum change code in which the only one bit F=  w,x,y,z 
code group changes when going from one step to yz
WX wx wx wx wx
the next. This is an unweighted code which means
1 1 1 1
that there are no specific weights assigned to the yz
bit. 1 1 1 1
yz
06. The number of product terms in the minimized sum-
yz
of-product expression obtainied through the
following K = map is (where, "d" denotes don't
care states) yz 1 1 1

1 0 0 1
0 d 0 0 F  y  wz  xz
08. The Boolean expression for the shaded area in
0 0 d 1 the Venn diagram is
1 0 0 1

X Y
1) 2 2) 3 3) 4 4) 5
Option: 1

00 01 11 10
00 1 0 0 1 Z

01 0 d 0 0 1) X  Y  Z 2) XYZ + XYZ
11 0 0 d 1 3) X+ Y+Z 4) XYZ + XY
Sol:
10 Option: 4
1 0 0 1
XY

X Y
The number of product term is two , one quad
and one pair
07. Simplify the Boolean expression:
Sol:
F   w, x, y, z     0,1, 2, 4,5, 6,8,9,12,13,14  XYZ

1) w + x + y + z 2) y ' w ' z ' xz ' Z

3) y  w ' z ' xz 4) x  z ' w ' y  x '
Boolean expression for shaded area
Option: 2
= XY + XYZ
Sol: F   w, x, y, z     0,1, 2, 4,5, 6,8,9,12,13,14  09. The function shown in the figure when simplified
will yield a result with

SAIMEDHA PAGE NO: 2

 So, dependent on all the variaible.
AB
11. The Boolean function
CD 00 01 11 10
00 1 0 1 0 XYZ+XYZ  XYZ  XYZ can be
equivalently represented as
01 0 1 0 0
11 1 0 1 0  
1) X+Y+Z X+Y  Z  X+Y+Z  X+Y+Z
10
    
0 1 0 1
2) X+Y+Z X+Y  Z X+Y+Z X+Y+Z

1) 2 terms 2) 4 terms  
3) X+Y+Z X+Y  Z X+Y+Z X+Y+Z   
3) 7 terms 4) 16 terms
Option: 3  
4) X+Y+Z  X + Y + Z 
Option: 3
AB
Sol: F = XYZ+XYZ  XYZ  XYZ
CD 00 01 11 10
This is the sum of product form and it will be equal
00 1 0 1 0 to the product of sum.
01 0 1 0 0
  
F= X+Y+Z . X+Y  Z . X+Y+Z . X+Y+Z  
Sol: 11 1 0 1 0
12. Simplify the Boolean function
10 0 1 0 1
F  w, x, y , z    1,3,7,11,15 
And the don't care conditions:
 No minterm is grouped with other minterm
d  w, x, y, z     0, 2,5 
 All '7' minterms will present in the simplified
SOP form. 1) F  zw  zy ' 2) F '  zw ' yz
10. Consider the following function of four variables:
3) F '  z ' wy ' 4) F  z ' w  zy '
F   A, B, C, D    1, 2, 6, 7,8,9,10,11,12,13
Option: 2
1) Independent of one varaible
Sol: F  w, x, y , z    1,3,7,11,15 
2) Independent of two variables
3) Independent of three varaibles d  w, x, y, z     0, 2,5 
4) Dependent on all the variable
Option: 4 yz
wx 00 01 11 10
AB 0 1 3 2
AB AB AB 00  
CD AB 1 1
5 7
1 1 01
1 6
CD 0 4 12 8
 1
12 13 15 14
CD 1 1 1 11
1 5 13 9 1
Sol: 8 11 10
CD 1 1 10 9
3 7 15 11 1

1 1 1
CD 2 6 14 10
13. The minimal sum of products form of
f = AB C D + ABC+ABC  BCD is
Y = AB  AC + ABC + CDB  CDB

SAIMEDHA PAGE NO: 3

 1) A+C  BD 2) AC + CD Sol: =ABCD + ABCD  ABCD  ABCD  ABCD
3) AC + BD 4) AB + CD  ABCDE  ABCDE
Option: 2 =ABCD + ABCD  ABCD  ABCD
 ABCDE  ABCDE
CD
CD
AB CD CD CD    
=ABC D+D +ABC D  D  ABCDE  ABCDE

AB 1 1 =ABC +ABC  ABCDE  ABCDE

AB 1 1  
=AB C+C +ABCDE  ABCDE
Sol:
AB
1 =AB +ABCDE  ABCDE

AB 1 
=AB 1+CDE  CDE 
=AB 1
Hence, f = AC+ C D = AB
16. The simplification in minimal sum of product (SOP)
14. If f  A,B,C    1, 2,3, 4,5,6, 7  and there are of Y = F(A, B, C, D)
no 'don't care' entries then f'(A, B, C) is equal to
  m  0, 2,3, 6, 7    d 8,10,11,15   using
1)  A  B  C  2) A + B + C K-map is:

3) A.B.C 4) A.B.C 1) Y = AC + BD 2) Y = AC + BD
Option: 2 3) Y = AC + BD 4) Y = AC + BD
Sol: f =  m 1, 2,3, 4,5, 6,7  Option: 4

BC F  ABCD
A BC BC BC BC AB
AB AB AB
0 1 3 2
1 0 
A 1 CD 4
1 1 0 12 8
4 5 7 6 0 0 0 0
A CD 1 5 13 9
1 1 1 1
Sol:  
CD 1 1
3 7 15 11
f=A+B+C 1 1 0 
CD 3 6 14 10
15. Consider the following expression:
A.B.C.D + A.B.C.D  A.B.C.D
  0, 2,3, 6, 7   8,10,11,15
m d
+ A.B.C.D  A.B.C.D
Y = AC + BD
+ A.B.C.D.E  A.B.C.D.E 17. The minterms for AB + ACD are:
The simplification of this by using theorems of 1) ABCD+ABCD+ ABCD  ABCD  ABCD
boolean algebra will be
1) A + B 2) A  B 2) ABCD+ABCD+ ABCD  ABCD  ABCD

3)  A  B A.B 4) A.B 3) ABCD+ABCD+ ABCD  ABCD  ABCD

Option: 4

SAIMEDHA PAGE NO: 4

 4) ABCD+ABCD+ ABCD  ABCD  ABCD =AB  ABC

  
Option: 2
=B A  A A  C
Sol: Y = AB + ACD

=B1 A  C 
y =  ABCD
AB AB AB AB
SOP = AB  BC
CD 1 19. Simplified form of the logic expression
0 4 12 8
CD 1 5
1
13 9
 A+B  C  +  A+B  C  =  A+B  C is
CD 1 1 1) AB  C 2) A+BC
3 7 15 11
1 3) A 4) AB+C
CD 2 6 14 10
Option: 2

Y =ABC D+ABCD+ ABCD  ABCD  ABCD Sol:  A+B  C  +  A+B  C  =  A+B  C

18. A 3 - variable truth table has a high output for the
inputs: 010, 011 and 110. The Boolean expression  
Y  A+B  C +(A.A+AB+AC+A.B  B.B+B.C
for sum of product (SOP) can be written as:
 AC  B C  C C)
1) AB+BC 2) AB+BC
 
Y  A+B  C +(A+AB+AC+AB  BC+AC  BC)
3) AB+BC 4) AB+BC
Option: 1   
Y  A+B  C + A(1+B+C+B  C)  BC  BC 
 
Y  A+B  C (A+BC  BC)
ABC
 
Y  A+ABC A+BC  B C 
0 000

 A+ABC  AB C  AB  BC  0  AC  BC  0 
1 001
2 010
 
 A 1+BC  B C  B  C  BC  BC
ABC
=A+B C + BC = A + BC
3 011 ABC 20. When the Boolean function
4 100 F  x1 , x2 , x3     0,1, 2, 3     4,5,6,7  is
Sol:
5 101 minimized, what does one get?
1) 1 2) 0 3) x1 4) x3
6 110 ABC
Option: 1
7 111
Sol: F  x1 , x2 , x3     0,1, 2, 3     4,5,6,7 

Sum of product (SOP) =ABC  ABC+ABC


=AB C  C  ABC 

SAIMEDHA PAGE NO: 5

 2) 2 3 1 4
X1X 2
3) 3 2 4 1
X3 X1 X 2 X1X 2 X1X 2 X1 X 2
4) 2 3 4 1
0 2 6 4
X3 1   Option: 2
1
Sol: (a) ab + bc + ca+ abc

1 3 7 5
X3 1 
1
bc 00 01 11 10
Where x don't care From K-map we get a

F   x1 , x2 , x3   1 0 1
21. BY inspecting the Karnaugh map plot of the 1 1 1 1
switching function
F   x1 , x2 , x3    1,3, 6,7  one can say that F = ab + bc + ca + abc inverse function of A
the redundant prime implicant is
bc 00 01 11 10
1) x 1 x3 2) x2 x3 3) x1 x2 4) x3 a
Option: 2 0 1 1
1
Sol: F   x1 , x2 , x3    1,3, 6,7 
1 1
X1X 2
X3 X1 X 2 X1X 2 X1X 2 X1 X 2 F  ab  bc  ca
0 2 6 4
X3 bc 00 01 11 10
1 a
1 3 7 5
X3 1 1
1 1
(b)
0 1 1 1
From K-map the common pair is redundant 1 1 1 1
prime impliment = x2x3
22. Match List -I (Boolean logic function) with List -
II (Inverse of function) and select the correct F  ab  ab  c
answer using the code given below the lists: inverse function of B
List - I
A. ab  bc  ca  abc bc 00 01 11 10
a
B. ab  ab
0 1
C. a+ bc

  
D. a  b  c  a  b  c a  b  c   1 1
List - II
F = abc+ abc

1. a b  c  2. ab  bc  c a

F= a b +ab c 
3.  a  b  c 4. abc  abc  abc
= a  b c
Codes:
A B C D
1) 3 2 1 4

SAIMEDHA PAGE NO: 6

 (c) Option: 4
bc 00 01 11 10
a Sol: With reference to K-map
(i) Minimization using karnaugh map may not
0 1 provide unique solution
(ii) Redundant grouping in karnaugh map may
1 1 1 1 1 result in non minimized solution
24. What is the Boolean expression for the truth
F = a + bc table shown below?
inverse function of C
A 0 0 0 0 1 1 1 1
bc 00 01 11 10 B 0 0 1 1 0 0 1 1
a
C 0 1 0 1 0 1 0 1
0 1 1 1 f 0 0 0 1 0 0 1 0

1
1) B  A  C  A  C   
2) B A  C  A  C 
F  ab  ac 3) B  A  C  A  C   4) B  A  C  A  C  

 a bc  Option: 1
(d) Sol: For f = 1
bc 00 01 11 10
a  f =ABC
0 AB AB AB AB
0
C 0 2 1 6 4
1 0 0
C 1
1 3 7 5

 
F  a  b  c a  b  c a  b  c {for max   f=A BC+A BC
term} inverse function of D -
f = ABC+ABC
bc
a 00 01 11 10

f = B AC+AC 
0 1 f = B  A+C  A  C  
1 1 1 25. What is the minimized logic expression
corresponding to the given Karnaugh Map?
F  abc  a bc  a b c
yz
23. Consider the following statements: wx 00 01 11 10
1. Minimization using Karanaugh map any not 00 1
prodice unique solution
2. Redundant grouping in Karnaugh map may 01 1 1 1
result in non-minimized solution. 11 1 1 1
3. Don't care states if used in Karnaugh map for 10 1
minimization, the minimal solution is not
obtained. 1) xz
Which of the statements given above are
correct? 2) wx y  wyz  w yz  wxy
1) 1, 2 and 3 2) 2 and 3 only
3) 1 and 3 only 4) 1 and 2 only

SAIMEDHA PAGE NO: 7

 3) wx y  wyz  w yz  wx y 27. The minimized expression for the given K map
(x : don't care) is
4) xz  wyz  wx y  wxy  w yz
Option: 2 AB
00 01 11 10
CD
00 0 0 1 1
yz
wx
yz yz
01
yz
11
yz
10 01 0   1
00
w x 00 1 11   1 
wx 01 1 1 1 10 1 0 1 1
Sol:
wx 11 1 1 1
1) A  BC 2) B+AC
w x 10 1
3) C + AB 4) ABC
Option: 1
F = wx y  wyz  w yz  wxy
26. A, B and C are three Booolean variables. Which AB
one of the following Boolean expressions cannot AB AB AB AB
CD
be minimized any futher? Sol:
CD 0 0 1 1
1) Z  A.B.C  A.B.C  A.B.C  A.B.C
CD 0   1
2) Z  A.B.C  A.B.C  A.B.C  A.B.C
3) Z  A.B.C  A.B.C  A.B.C  A.B.C
CD   1 
4) Z  A.B.C  A.B.C  A.B.C  A.B.C CD 1 0 1 1
Option: 3
28. For the Karnaugh map shown int he given figure,
Sol: (a) Z=ABC+ABC+ABC+ABC the minimum Boolean function is


Z=BC A+A +AB C  C    x
yz 0 1
Z = BC + AB
00 1 1
(b) Z =A.BC + ABC  ABC+ABC
01 1

Z =AC B+B + ABC  ABC  11 1 1
Z =AC + ABC  ABC 10 1 1
Z =AC + C AB  AB  
1) x ' y ' z ' yz 2) xz ' z  zy '
Z =AC + C  A  B 
3) xy  z  y ' z 4) x ' z  z ' yz
(c) Z =A.BC+ AB C  ABC + ABC Option: 4
this Boolean expression can not minimized.
(d) ABC+ ABC  ABC + ABC

  
BC A+A  C AB + AB 
BC+ C  A  B 

SAIMEDHA PAGE NO: 8

 yz
yz
x yz yz yz A
B

0 1 3 2
Sol: x 1 1 1 1
4 6 C
x 5 7
1 1 1
1) AB + BC + CA
F  YZ  Z  X Z 2) ABC  ABC  ABC
29. How many minterms (exclusing redundant terms)
does the minimal switching function 3) ABC  ABC
f  v, w, x, y, z   x  yz originally have? 4) ABC  ABC
1) 16 2) 20 3) 24 4) 32 Option: 2
Option: 2
shaded ABC
Sol: f  v, w, x, y, z   x  yz


 x yz vv  
B
A
  
 x  y z v  x  yz v  Sol:

shaded C
v BCA
wx ABC shaded
yz wx wx wx wx

yz 1 1 Y  ABC  AC B  BC A
31. The minimized expression for the given k - map
yz 1 1 1 1 is (X: don't care)
yz +
1 1
yz 1 1

v
wx
yz wx wx wx wx

yz 1 1
yz 1 1 1 1
yz 1 1 1) CB  BD  CD 2) AB  CB  BC
yz 1 1 3) C B  AC  BC 4) C B  BD  CB
Option: 4
Minterm = 10 + 10 = 20
30. The Boolean expression for the shaded area in
the given Venn diagram is

SAIMEDHA PAGE NO: 9

 CD
B
AB A B AB AB A B A

CD 1 1
CD 1 X C
Sol:
CD 1 X 1 X
1) A B + B C 2) ABC  ABC
CD 1 X X
3) ABC  ABC 4) None of the above
Option: 3
Y  CB  BD  C B
32. The simplified Boolean expression from the shaded area I
Karnaugh map given in the figure is

B
A

Sol:

C shaded area II

 For shaded area I  A  1, B  1, C  0

 Shaded are II  A  0, B  1, C  1
then total shaded are a = ABC  ABC

1) AC  AD  ABC 34. What is Boolean expression for getting network

that will have output 0 only when X = 1, Y = 1,
2) AB  AD  ABC Z = 1; X = 0, Y = 0, X = 0; X = 1, Y = 0, Z =
0?
3) AC  ACD  ABC  BCD
1) XYZ+XYZ+XYZ
4) AB  CD  AD
Option: 1 
2)  XYZ  + X  Y+Z + X+Y+Z   
CD  
3) X  Y+Z  X+Y+Z  X+Y+Z  
AB CD CD CD CD 4) XYZ+XYZ+XYZ
AB 1 1 1 Option: 3

AB 1 1 1
Sol:
AB 1 1
AB

Y  AC  AD  ABC
33. The expression for shaded area shown below is:

SAIMEDHA PAGE NO: 10

 groups which cover atleast one minterm that can
X Y Z Output (P) not be covered by any other prime implicants
36. The minimized form of the logical expression
0 0 0 0
0 0 1 1  ABC+ABC+ABC+ABC is
0 1 0 1 1) AC  BC+AB 2) AC  BC+AB
0 1 1 1
3) AC  BC+AB 4) AC  BC+AB
1 0 0 0
Option: 1
Sol: 1 0 1 1
Sol: ABC  ABC+ABC+ABC
1 1 0 1
1 1 1 0 AB
C A B AB AB A B
C 1 1 1
YZ
X Y Z YZ YZ Y Z C 1
X 0
0 F=AC+AB+BC
X 0
37. If the functions W,X,Y and Z are as follows

 
P= X+Y+Z X+Y+Z X+Y+Z   W=R+PQ+RS

35. The K-map for a Boolean function is shown in X=PQRS+PQRS+PQRS

figure. The number of essential prime implicants
for this fucntion is Y=RS+PR+PQ  PQ

CD Z=R+S+PQ+PQR  PQS
AB 00 01 11 10 Then
00 1 1 0 1 1) W=Z,X=Z 2) W=Z, X=Y
01 0 0 0 1 3) W=Z, X=Y 4) W=Y=Z
11 1 0 0 0 Option: 1
10 1 0 0 1 Sol:- (i) W=R+PQ+RS

1) 4 2) 5 3) 6 4) 8 
W= R+R  R+S +PQ 
Option: 1
W=R+S+PQ ......(i)
Sol: Essential prime implicatnts = 4
(ii) X=PQRS+PQRS+PQRS
AB
CD A B AB AB A B X=PQRS+QRS+ P+P  
CD 1 1 0 1
X=PQRS+QRS
CD 0 0 0 1
CD 1 0 0 0
X=RS+ PQ+Q  
CD 1 0 0 1 
X=RS P+Q Q+Q  
Essential Prim implicants (EPI)  These are those

SAIMEDHA PAGE NO: 11

X=RSP+RSQ .......(ii ) Z=R+S+PQ ......  iv 

(iii) Y=RS +PR+PQ+PQ In the above solution we see that

W=Z
 
Y=RS + PR PQ PQ   X=Z
38. The boolean expression
Y=RS +  P+R   P+Q  P+Q 
Y=ABCD+ABCD+ABCD+ABCD can be
minimized to

Y=RS + P+R P+Q  P+Q    1) Y=ABCD+ABC+ACD

Y=RS + PP  PR  PQ+RQ  P+Q   2) Y=ABCD+BCD+ABCD

Y=RS +(PP  PPR  PPQ+PRQ+PQ 3) Y=ABCD+BCD+ABCD

4) Y=ABCD+BCD+ABCD
 PRQ+PQQ+RQQ)
Option: 4
Y=RS +PQR+PQ+P RQ+PQ+RQ
Sol: ABCD+ABCD+ABCD+ABCD
Y=RS +QR+ P  P  1 +PQ 
AB
Y=RS +QR+PQ ......(iii) CD A B AB AB A B
(iv) Z=R+S +PQ+PQR+PQS CD 1

=R+S +PQ+QS+PQR CD 1 1
CD

=R+S +P Q+S +PQR  A+AB=A+B  
CD 1

=R+S +P Q+S .PQR 
Y=ABCD+BCD+ABCD

=R+S + P+QS  P+Q+R   39. If X = 1 in the logic equation
=R+S +PQ+PR+PQS+QSR
   
 X  Z Y  Z  X Y  X  Z  X  Y   1,
  
=R+PR+PQ+S+PQS+QSR then
 
=R 1  P +PQ+S 1+PQ+QR   1) Y = Z 2) Y  Z 3) Z = 1 4) Z = 0
Option: 4
Z=R+PQ+S ......(iv)

Z=R+PQ+S
   
Sol:  X  Z Y  Z  X Y  X  Z  X  Y   1 
if X = 1

 P+S PQ      
1  Z Y  Z  X Y  1  Z 1  Y   1 
 

=RS P+Q 
   
1  Z Y  Z  X Y  0  Z  1
  
Z =PRS+QRS
From equation (i) & (iv) W=Z and from equation 1  ZY  Z Z  ZX Y  Z  1
  
(ii) & (iv) X=Z
  
1  YZ  ZX Y  Z  1

SAIMEDHA PAGE NO: 12

 Z 1 
because 1  YZ  ZX Y  1  1)  X  Y  Z   X  Y  Z  X  Y  Z  X  Y  Z 

Z 0 2)  X  Y  Z  X  Y  Z  X  Y  Z  X  Y  Z 
40. Consider the Boolean function,
3)  X  Y  Z   X  Y  Z  X  Y  Z  X  Y  Z 
F  w, x, y, z   wy  xy  wxyz
4)  X  Y  Z  X  Y  Z  X  Y  Z   X  Y  Z 
 wxy  xz  x y z. Which one of the following is
Option: 1
the complete set of essential prime implicants?
Sol: F  X , Y , Z   XY Z  X Y Z  XY Z  XYZ
1) w, y, xz, xz 2) w, y , xz

3) y , x y z 4) y , xz , xz XY
Z 00 01 11 10
Option: 4
0 0 1 1 1
Sol: F  w, x, y, z   wy  xy  w xyz
1 0 0 1 0
 w xy  xz  x y z

yz

F  X ,Y , Z   X  Y  Z  X  Y  Z 
yz yz yz yz
wx
 X  Y  Z  (X+Y+Z)
wx 1 0 1 1 3 1 2

1 1 1

  X Y  Z   X Y  Z  X  Y  Z 
wx 4 5 7 6
wx
12
1 13 1 15 1 14
 X Y  Z 
wx 1 8 9 1 11 1 0 In SOP- In POS-
1  High 1  Low
F  y  xz  xz 0  Low 0 High
The set of essential prime implicants is 43. Which one of the following gives the
simplifiedsum of prodcuts expression for the
y,  xz ,  x z
Boolean function F=m 0  m2  m3  m5 where
41. For an n-variable Boolean function, the maximum
number of prime implicants is m 0 , m2 , m3 and m5 are minterms corresponding
to the inputs A, B and C with A as the MSB and
1) 2  n  1 2) n/2
C as the LSB?
3) 2 n 4) 2( n1) 1) AB+ABC+ABC 2) AC+AB+ABC
Option: 2
3) AC+AB+ABC 4) ABC+AC+ABC
Sol: In a n variable Boolean function, the maximum
number of prime implicant is given by Option: 2

2n XY
Pmax   2 n 1 X Y XY XY X Y
2 Z
42. The Boolean expression Z m0 m2 m6 m4
Sol:
F  X , Y , Z   XY Z  X Y Z  XY Z  XYZ Z m1 m3 m7 m5
converted into canonical product of sum (POS)
form is
Given F=m 0  m2  m3  m5

SAIMEDHA PAGE NO: 13

 AB 3) f  A,B,C,D  =AB+AC+AD+BCD
C A B AB AB A B
4) f  A,B,C,D  =AC+AD+BCD
C 1 1
Option: 3
C 1 1

CD
Y  AC+AB+ABC
AB CD CD CD CD
44. A function F(A,B,C) defined by three Boolean
variables A, B and C when expressed as sum of AB 0 1 3 2
products is given by
AB 4 5
1 7 6
F  A.B.C.+A.B.C+A.B.C .
Sol:
where, A, B, and C are the complements of the AB 1 12 1 13 1 15
1 14
respective variables. The product of sums (POS)
form of the function F is AB 8
1 9 1 11 1 10


1) F   A+B+C  . A  B+C . A+B+C  
F = AB + AD + AC + BCD
 
2) F  A+B+C . A  B+C . A+B+C   46. The simplified form of the given expression
f   m  0,1, 2, 4,6  is
 
3) F  A+B+C . A  B+C . A+B+C  
1) A'B'+C' 2) AB+C'

. A+B+C . A  B+C  3) ABC+B'C 4) None of these
Option: 1
 
4) F  A+B+C . A  B+C . A+B+C   Sol: f =  m  0,1, 2, 4, 6 
 A+B+C  . A  B+C  From k-map
Option: 3
BC
Sol: F  A+B+C  ABC  ABC A BC BC BC BC
It can be represented in min term as: A 1 1 1
F   m  0, 2, 4  A 1 1
and max term as:
47. If the function X, Y are X = R + P'Q + R'S and Y
F   M 1,3,5, 6, 7 
= P'Q' R'S' + P Q' R'S'+PQR'S' (where represent


F  A+B+C A+B+C A+B+C    complement). Which of the following is true?
1) X =Y

 A+B+C  A+B+C  2) X=Y'

3) No direct relation between X and Y
45. The simplfied Boolean equation for the following 4) Insufficient data
logic function is:
Option: 2
f  A,B,C,D  =  m  7,9,10,11,12,13,14,15
Sol: X=R+PQ+RS
1) f  A,B,C,D  =ABC+AD+BCD
X=R+S+PQ
2) f  A,B,C,D  =AB+AD+BCD X=  P,Q,R,S

SAIMEDHA PAGE NO: 14

   1, 2,3, 4,5, 6, 7, 9,10,11,13,14,15
 
4) AC+ D+E +AE+ C+D+E  
Option: 1
RS
PQ 00 01 11 10 Sol: F  A, B, C , D, E   (0,1, 2,3,8,9,16,17,

00 1 1 1 20, 21, 25, 28, 29,30, 31)

01 1 1 1 1
A
11 1 1 1 BC D E DE DE DE
1 1 BC 1
10 1 1 1 BC
BC
Y=PQRS  PQRS+PQRS BC

Y=  PQRS    0,8,12 
1 1 1

RS
PQ 00 01 11 10 A
DE
00 1 BC D E DE DE DE
1 1
BC
01
BC 1 1
11 1
BC 1 1 1 1
10 1
BC 1 1

Y = ABC+CD+AD  ABC
Y=PRS  QRS
Y = AD+C+D+ABC  A+B+C
Y=RS  P+Q 
49. f  A, B, C , D     0,1, 4,5,8,9,12,13 t h e
So X=Y simplifed expression in POS.
48. Simplify the function represented in sum of min- 1) f = A+B+D 2) f = A+D
terms:
3) f = C 4) f = A+B
F  A, B, C , D, E   (0,1, 2,3,8,9,16,17, Option: 3
20, 21, 24, 25, 28, 29,30, 31)


1) AD+ C+D +ABC+ A+B+C  

2) ADE+ C+E D+ABCD+AEC 

3) ADB+ C+B +CDE+ B +C  D  

SAIMEDHA PAGE NO: 15

  C+D  CD
 A+B   C+D  C+D   C+D   C+D  AB CD CD CD CD
A+B 1 x
1 AB 1
0 1
1 3 12
A+B 1 1
Sol: AB 1 x
1 1 4 5 7 6
A +B Sol:
AB x 1
A +B 1 1 12 13 15 14

AB x
F=C 8 9 11 10
50. Simplify the following Boolean expression

 
Y= A.B +A.B+A.B Y=AB  CA+BCD
52. Find number of redundancy terms in the following
 
1) A  B A  B  A+B   expression

2) AB+AB+BA Y  AB+BC+A
1) 8 2) 1 3) 2 4) 4
3) AB
Option: 3
4) AB
Option: 3 BC
Sol: A.B+A.B+AB A BC BC BC BC

 A.B.AB.AB
Sol:
A 1 1
 
 A+B A+B .  A+B  A 1 1 1 1

= A+AB+BA  A+B  
From the K-map the common pair is redundancy

=A 1+B+B  A+B   term, So, here Redundancy term is 2.
53. The minimized form of the Boolean expression
=A  A+B 
F  A,B,C     0, 2,3 is
=AB 1) A+BC 2) A+BC
51. Find the expression for
3) AC+B 4) ABC+AB
Y =  m  0, 2,3, 7,14   d 1,6,9,13
Option: 1
1) AB+AC+CD
Sol: F  A,B,C  =  0, 2,3
2) AB+AC+ACD  BCD
F  A,B,C  =  m 1, 4,5,6, 7 
3) AB+AC+BCD
4) AB+AC
Option: 3

SAIMEDHA PAGE NO: 16

 p  x y z  xyz  x yz  xy z
BC
A BC BC BC BC This output Boolean function behave like as an EX-
NOR gate.
A 1 p  x yz

A 1 1 or p  x  y  z
1 1
55. The Boolean function
Y=A+BC F  A,B,C,D  =   0,6,8,13,14  with don't care
54. For the truth table given in figure, the minimized
Boolean expression is conditions d  A,B,C,D  =   2, 4,10  can be
simplified to
1) F=BD+CD+ABC
Input Output
2) F=BD+CD+ABCD
x y z 
3) F=ABD+CD+ABC
0 0 0 1
4) F=BD+CD+ABCD
0 0 1 0
Option: 2
0 1 0 0
Sol: f  A,B,C,D  =   0,6,8,13,14 
0 1 1 1
Don't care condition d  A,B,C,D  =   2,4,10 
1 0 0 0
1 0 1 1
CD
1 1 0 1 AB CD CD CD CD

1 1 1 0 AB 1 x
AB x 1
1) p  x y z  x y z  x y z  x y AB
1 1
2) p  x  y  z
AB 1 x
3) p  x y  z   x  y  z 

4) p  x  yz 56. The expression for the truth table given below in

Option: 2 POS form is given by:
Sol: Output

EX-NOR
x y Output
0 0 1
0 1 0
1 0 0
1 1 1

SAIMEDHA PAGE NO: 17

 implicants (PI) i.e. all possible groups formed in
k-map.
A B C F
0 0 0 1
CD
0 0 1 0 AB CD CD CD CD

0 1 0 1 AB 1
0 1 1 1
1 0 0 1
AB 1
1 0 1 1 AB 1
1 1 0 1
AB 1
1 1 1 0

1) AB'C+ABC' hence, the required number of essential prime

Implicant = 3.
2)  A+B+C' A'+B'+C' 58. How many variables do 16 squares eliminate?
3) A'B'C+ABC 1) 7 2) 4 3) 1 4) 11
Option: 2
4)  A+B'+C'  A'+B'+C'
Option: 2 AB
Sol: There are 3-variable quantities in the given CD AB AB AB AB
expression. here 8 - block k - map will be required.
CD 0 4 12 8
F  A,B,C   π 1, 7 
CD 1 5 13 9
BC Sol:
A B+C B+C BC BC CD 3 1 15 11
A 1 0 1 1 14 10
CD 2 6
A 1 1 0 1
So, 16 squared eliminate 4 variables.
59. De-Morgan's theorem states that _____

POS form = A+B+C A+B+C  
57. The number of essential prime implicates for the
1)  AB  '  A' + B'  
2) A+B '  A' * B
function 3) A ' B '  A'B' 4)  AB  '  A'+B
Y=A'B'C'D+A'BCD'+AB'C'D+ABC'D' is Option: 1
given by -
Sol: De-Morgan's theorem - The complement of the
1) 1 2) 2 3) 3 4) 4
product of all the terms is equal to the sum of the
Option: 3 complement of each terms.
Sol: In the given function there are 4 - varaible then According to De-Morgan;s theorem.
with the help of k-map.
(1) A.B.C  A  B  C  .....
prime Implicates:- A group of square or rectangle
made up of bunch of adjacent minterms which is (2) A  B  C  ...... A.B.C.....
allowed by definition of k-map are called prime

SAIMEDHA
60. A function of Boolean variables X,PAGE
Y andNO:
Z is 18
 expressed in terms of the min-terms as
F  X,Y,Z    1, 2,5, 6, 7  . Which one of the
product of sums given below is equal to the
function F  X,Y,Z  ?

 
1) X+Y+Z X+Y+Z X  Y+Z  

2)  X  Y  Z  X  Y+Z X+Y+Z  
 
3) X+Y+Z X  Y+Z X+Y+Z  
 X  Y+Z X+Y+Z 
 
4) X  Y+Z X+Y+Z X+Y+Z  
 X+Y+Z X+Y+Z
Option: 2
Sol: F   X , Y , Z    m 1, 2, 5, 6,7 

  M  0, 3, 4 

XY
Z X+Y X+Y X+Y X+Y

Z 1 1

Z 1

Product of sum -


  X Y  Z  X Y  Z  X  Y  Z 
61. The minterm function
f  A,B,C,D   1,3, 4, 6,9,11,12,14  is ___.
1) independent of 2 variables
2) independent of 1 variable
3) dependent of all 4 varaibles
4) independent of 3 varaible
Option: 1

SAIMEDHA PAGE NO: 19