LOGIC FUNCTIONS AND MINIMIZATION-01

1 Which one of the following expressions does NOT 6 What is the minimum number of gates required to
represent exclusive NOR of x and y? implement the Boolean function (AB+C)if we have to
use only 2-input NOR gates?
(a) xy+x'y' (b) x  y  (c) x   y (d) x   y 
(a) 2 (b) 3 (c)4 (d) 5
2 What is the minimal form of the Karnaugh map shown 7 In the Karnaugh map shown below, X denotes a don't
below? Assume that X denotes a don’t care term. care term. What is the minimal form of the function
represented by the Karnaugh map?

(a) b'd' (b)b'd' + b'c' (A) b d  a d (B) a  b  b  d  a  b  d

(c) b'd' + a'b'c'd' (d)b'd' + b'c' + c'd'
(C) b  d  a  b  d (D) a  b  b  d  a d
3 Which one of the following circuits is NOT equivalent to
a 2-input XNOR (exclusive NOR) gate? 8 Given f1, f3 and f in canonical sum of products form (in
decimal) for the circuit
(A)

(B)

f1   m ( 4, 5, 6, 7,8) f3   m (1, 6, 15 )

f   m (1, 6, 8, 15 ) then f2 is

(C) (A)  m(4, 6) (B)  m(4, 8)

(C)  m(6, 8) (D)  m(4, 6, 8)
9 If P, Q, R are Boolean variables, then (P + Q')(PQ' +
PR)(P'R' + Q') simplifies
(a) PQ' (b) PR'
(c) PQ' + R (d) PR'' + Q
(D)
10 Consider the following Boolean function of four variables:
f(w,x,y,z) =  (1,3,4,6,9,11,12,14) The function is:
(a) independent of one variables.
4 The simplified SOP (Sum Of Product) form of the
boolean expression (b) independent of two variables.
(c) independent of three variables.
(P + Q' + R') . (P + Q' + R) . (P + Q + R') is
(d) dependent on all the variables.
(a) (P'.Q + R') (b) (P + Q'.R')
(c) (P'.Q + R) (d) (P.Q + R) 11 Let f(w, x, y, z) =  (0, 4, 5, 7, 8, 9, 13, 15). Which of the
following expressions are NOT equivalent to f?
5 The minterm expansion of f(P, Q, R) = PQ + QR' + PR' is
(a) x'y'z' + w'xy' + wy'z + xz
(a) m2 + m4 + m6 + m7 (b) m0 + m1 + m3 + m5
(b) w'y'z' + wx'y' + xz
(c) m0 + m1 + m6 + m7 (d) m2 + m3 + m4 + m5
(c) w'y'z' + wx'y' + xyz + xy'z
(d) x'y'z' + wx'y' + w'y

18, Zone-II, M.P. Nagar, Bhopal  : 0755-4295319

12 Define the connective * for the Boolean variables X and (c) g 2 (h3 , h2, h1, h0 )   (2, 4, 5, 6, 7,12,13, 15 )
X  Y  XY  X Y  Let Z  X  Y
(d) g3 (h3, h2 , h1, h0 )   (0, 1, 6, 7,10,11, 12,13)
Consider the following expressions P, Q and R.
P: X = Y  Z 18 Consider the following circuit. Which one of the
Q: Y = X  Z following is TRUE?
R: X  Y  Z = 1
Which of the following is TRUE?
(a) Only P and Q are valid (b)Only Q and R are valid.
(c) Only P and R are valid. (d)All P, Q, R are valid.
13 Consider the following Boolean expression for F:
F(P, Q, R, S) = PQ + P'QR + P'QR'S
(a) f is independent of X (b)f is independent of Y
The minimal sum-of-products form of F is (c) f is independent of Z (d) None of X, Y, Z is redundant
(a) PQ + QR + QS (b) P + Q + R + S
19 The switching expression corresponding to f(A, B, C, D)
(c) P' + Q' + R' + S' (a) P'R + P'R'S + P
=  (1, 4, 5, 9, 11, 12) is
14 Consider the following minterm expression for F :
(a) BC'D' + A'C'D + AB'D (b) ABC' + ACD + B'C'D
F(P,Q,R,S) = sum (0,2,5,7,8,10,13,15). The minterms
(2, 7, 8 and 13) are 'do not care' terms. The minimal (c) ACD' + A'BC' + AC'D' (d) A'BD + ACD' + BCD'
sum-of-products form for F is : 20 The Boolean function x'y' + xy + x'y is equivalent to
(a) x' + y' (b) x + y (c) x + y' (d) x' + y
(a) QS  QS (b) Q . S  QS
21 W hich are the essential prime implicants of the
(c) QRS  QRS  QRS  QRS following Boolean function? f(a, b, c) = a'c + ac' + b'c
(a) a'c and ac' (b) a'c and b'c
(d) PQS  PQS  PQS  PQ S (c) a'c only (d) ac' and bc'
15 Let X denote the Exclusive OR (XOR) operation. Let ‘1’ 22 The literal count of a boolean expression is the sum of
and ‘0’ denote the binary constants. Consider the the number of times each literal appears in the
following Boolean expression for F over two variables P expression. For example, the literal count of (xy + xz') is
and Q: 4. What are the minimum possible literal counts of the
product-of-sum and sum-of-product representations
F(P, Q) = ( ( 1 X P) X (P X Q) ) × ( (P X Q) X (Q X 0) respectively of the function given by the following
The equivalent expression for F is Karnaugh map ? Here, X denotes "don't care"
(a) P + Q (b) (P + Q)' (c)P × Q (d) (P × Q)'
16 Consider a Boolean function f (w, x, y, z). suppose that
exactly one of its inputs is allowed to change at a time.
If the function happens to be true for two input vectors
i1 = (w1, x1, y1, z1) and i2 = (w2, x2, y2, z2) we would like
the function to remain true as the input changes from i1
to i2 (i1 and i2 differ in exactly one bit position), without
becoming false momentarily.

Let f (w, x, y, z) =  (5,7,11,12,13,15). Which of the (a) (11, 9) (b) (9, 13) (c)(9, 10) (d) (11, 11)
following cube covers of f will ensure that the required
23 Consider the following circuit composed of XOR gates
property is satisfied?
and non-inverting buffers.
(a) w'xz, wxy', xy'z, xyz,wyz (b)wxy,w'xz,wyz
(c) wx(yz)', xz, wx'yz (d) wzy, wyz, wxz, w'xz, xy'z, xyz
17 Consider numbers represented in 4-bit gray code. Let
h3h2h1h0 be the gray code representation of a number n
and let g3g2g1g0 be the gray code of (n + 1) (modulo 16)
value of the number. Which one of the following functions The non-inverting buffers have delays d1 = 2 ns and d2
is correct? = 4 ns as shown in the figure. Both XOR gates and all
wires have zero delay. Assume that all gate inputs,
(a) g0 (h3 , h2, h1, h0 )   (1, 2, 3, 6,10,13,14,15 )
outputs and wires are stable at logic level 0 at time 0. If
the following waveform is applied at input A, how many
(b) g1(h3 , h2, h1, h0 )   ( 4, 9, 3,10,11,12,13, 14, 15 ) transition(s) (change of logic levels) occur(s) at B during
the interval from 0 to 10 ns ?
18, Zone-II, M.P. Nagar, Bhopal  : 0755-4295319
 27 Given the following Karnaugh map, which one of the
following represents the minimal Sum-Of-Products of
the map?

(a) 1 (b) 2
(c) 3 (d) 4
24 Minimum sum of product expression for f(w, x, y, z) shown
in Karnaugh-map below is
wx 10
00 01 11
yz

00 0 1 1 0

01 x 0 0 1

11 x 0 0 1 (a) xy + y'z (b) wx'y' + xy + xz

(c) w'x + y'z + xy (d) xz + y
10 0 1 1 x
28 The simultaneous equations on the Boolean variables
x, y, z and w,
(a) xz + y'z (b) xz' + zx' x y  z 1
(c) x'y + zx' (d) None of these xy  0
25 Consider the following logic circuit whose inputs and xz  w  1
function and output is f. xy  z w  0
have the following solution for x, y, z and w, respectively.
(a) 0 1 0 0 (b) 1 1 0 1
(c) 1 0 1 1 (d) 1 0 0 0
29 Which function does NOT implement the Karnaugh map
given below?

Given that
f1(dx, y, z) =  (0, 1, 3, 5),
f2(dx, y, z) =  (6, 7) and
f(dx, y, z) =  (1, 4, 5),
f3 is :

(a)  (1, 4, 5) (b)  (6, 7)

(c)  (0, 1, 3, 5) (d) None of these
(a) (w  x ) y (b) xy  yw
26 Let f(A, B) = A' + B. Simplified expression for function
f(f(x + y, y)z) is : (c) (w  x ) (w  y )( x  y ) (d) None of the above
(a) x' + z (b) xyz
(c) xy' + z (d) None of these 30 Consider the operations f(X, Y, Z) = X'YZ + XY' + Y'Z' and
g(X', Y, Z) = X'YZ + X'YZ' + XY Which one of the following
is correct?
(a) Both {f} and {g} are functionally complete
(b) Only {f} is functionally complete
(c) Only {g} is functionally complete
(d) Neither {f} nor {g} is functionally complete

18, Zone-II, M.P. Nagar, Bhopal  : 0755-4295319

 LOGIC FUNCTIONS AND MINIMIZATION-01
1. (d) 2. (b) 3. (d) 4. (b) 5. (a) 6. (b) 7. (a) 8. (c) 9. (a) 10. (b)
11. (d) 12. (d) 13. (a) 14. (b) 15. (d) 16. (a) 17. (c) 18. (d) 19. (a) 20. (d)
21. (a) 22. (c) 23. (d) 24. (b) 25. (a) 26. (c) 27. (a) 28. (c) 29. (d) 30. (b)

18, Zone-II, M.P. Nagar, Bhopal  : 0755-4295319