Adobe Scan 28-Jul-2024
Adobe Scan 28-Jul-2024
82
10
(a) AB C D+ A CD
(b) AB CD+A CD+ABC X. X
(c) BC D +CD+ A BC (a) Excess-3 code (6) Gray code
(c) BCD code
(d)Hamming code
(d)B C D +CD+ BC
Digital Circuits
5.83
minimum Boolean expression for the
The
13. circuit is given 19. Boolean expression for shaded area is
B
(a)AB + AC + BC (6) A + BC C
A
(6)|
(c
A
(a) AB + BC
(6) ABC+AB C
(c) ABC+A BC+A BC
(d) ABC+ AB
15. Complement of the Boolean expression 21. In the circuit shown in figure, value of input p
goes from 0 ’ 1and that of goes from 1 ’ 0.
AB.(BC+Ac) is Which output forms shown in figure represents
(a)(A + B)+ (B+ C). (A + C) the output under a statichazard conditions ?
(b)( B)+ (BC + A C) pO
Q
(c) ( + B).(B+ C). (A + C)
(a)
(d)(A +B).(B + C). (A +C)
16. The logicfunctionf= (x. )+x. v) 1S the Same as
(6)
(a)f= (x + y) (x+ y) (6) f= y+ xy
(c)
(e)f=(x.y). (xy) (d) none of these
17. The minimal product-of-sums function described
by the K-map given in the figure is, don't care (d)
L
22. The maximized expression for the
00 01 11 10 K-map is (X: don't care) given
AF
1 1 0 00 11 10
1 00 1 1
(c) A+ C (d) AC
18, Boolean expression 11 1 1 X
XYZ +
can be XÝZ+XY7,+XÝZ
+ XYZ 10 1 X
(a) xZ+simplified
to
(6) XZ + YZ+ YZ (a)C B + BD + CD (b) AB + CB + BC
XZ+ YZ
(c) XY + (d) xY+ YZ +XZ
(c)CB + AC + BC (d) CB+ CD +CB
YZ+ XZ
5.84
be I's 27. It is desired to generate the
Digital Circuits
23. In figure shown below, r, r, x, will
complement of A, A, A, if
A
Boolean functions:
f = abc + abe + bc
fol owing three
f= abc + ab + abc
A,
f,= abe + abc + c
by using an OR gate array as shown
where P, and P, are product terms in in figure,
one or more
of the variable a, a, b, b, c andc
P,
(a)Y= 0 (b) Y = 1 P
P.
(c) Y= A= A.= A,d) Y=A, =A, =A, P,
24. The circuit of a gate in the resistor transistor
logic (RTL) family shown in the given figure is Ps
a/an
F,
The terms P,, P,, P, P, and P, are
(a) ab, ac, b, bc, ab
(b) ab, bc, ac, ab be
(c) ac,ab, bc, ab, bc
(d)all of these
(a) AND gate (6) OR gate 28. The circuit shown in the figure converts
(c) NAND gate (d) NOR gate
MSB
25. K-map for a Boolean function is shown in the
figure. The function would be
yz
00 01 11 10
00
01 1
1
1
1
1
D
11
MSB
10
(a) BCD to binary code
(a)(r +)(w+ y) (6) (x + z) (w + y) (6) Binary to excess
(c) ( +Z) (w + ) (d) none of these (c) Excess-3 to Gray Code
26. For the K-map shown in figure, the minimized (d) Gray to Binary code
function in SOP form is 29. The switching circuit given in the figure can be
YZ expressed in binary logic notation as
00 01 11 10 L
00 1 1 1
01
WX 11 B
10 1
O 0V
X
BO V=-5V
-5V
(a) (6) yz
0 ( 0
0 1
D
0
E
1 1|1 (a)(A + B)C + DE (6) AB +C(D + E)
(c) (A + B) C + D + E (d) (AB + C) . DE
(c) (d)
36. The figure given below shows the circuit of which
0 one of the following is
1|0 1 1
00 +VpD
10 10
R
Voi C
32. For a binary half-subtractor having two inputs
Aand B, correct set of logical expression for the
outputs D (=Aminimum B) and X(=borrow) are
Vino
(a)D= AB + AB, X= AB
(a) Bi-stable multi-vibrator
(b)D = A B+ AB,X= AB (6) Schmitt trigger
(c) D= AB+ AB,X = AB (c) Mon0-stable multi-vibrator
(d) Astable multi-vibrator
(d)D = AB + AB.X=AB 37. A full-adder can be implemented with half
33. The circuit shown in the given figure is alan adders and OR gates. A4-bit parallel full adder
without any initial carry requires
(a) 8 half-adders,4-OR gates
(6)8 half-adders, 3-0R gates
(c) 7 half-adders, 4-0R gates
(d) 7 half-adders, 3-0R gates
38, Afour-variable switching function has minterms
and m,. If literals in these minterms are
complemented,
numbers are
then corresponding minterm
(a)m, and m, (6) m, and m,
(a)adder (6) subtractor
(c) m, and m, (d) m, and m,
parity generator (d) comparator
5.86
the figure below,
S9. For the gate network shownisinredundant?
43. The output of the circuit willbe Digital Clrcuts
which of the following gate
Co
(a)A B+BC+CA
(6)A + B +C (a)NOR (b) OR
(c) AB + BC + CA (c) NAND (d) EX-OR
45. The input pulses to the different stages of the
(d) AB + BC + CA
41. Consider the following expressions circuits shown in the following figure must
be of
1. Y=f(A, B, C, D) =E (1, 2, 4, 7,8, 11, 13, 14)
2. Y=fA,B, C, D)= E(3, 5,7,10, 11, 12, 13, 14)
3. Y=fA, B,C, D) = n (0, 3, 5, 6, 9, 10, 12, 15) T. 0.
Bo
(a) F=A + B (6) F = AB (a)AB (b) A + B
(c) F = A + B (d) F = AB (c) A + B (d) A + B
DigitalCircuits 6.87
47. The half adder circuit, in the given figure has used to
inputs AB= 11. The logic level of P and
51. The circuit given in the figure is to be
will be Qoutputs implement the function
A
Z= f(A, B) = + B.
J?
what values should be selected for I and
J
Truth Table
A BQ.1J
0 (a)modulo - 3 ripple counter
1
(6) modulo - 5 ripple counter
1 1
(c) modulo -7 ripple counter
(d)modulo -7 synchronous counter
X 55. The characteristic equation of the T-FF is given
by
(a) AB
(b) A (a)Q = TQ+ TÍ (6) Q = TQ + QT
(c) B (c) Q= TQ (d) Q= TQ
(d)AB