You are on page 1of 19

1.

By adding inverters to the inputs and output of a AND gate we can obtain ……………
(a) OR (b) AND
(c) NOT (d) X-OR
2. How many NAND gates are needed to realize OR gate --------------
(a) 1 (b) 2
(c) 3 (d) 4
3. In Binary to Gray code conversion which type of Logic gate is used
(a) OR Gate (b) X-OR gate
(c) X-NOR Gate (d) NAND Gate
4. An 8-bit register may provide storage for two's-complement codes within which decimal range?
(a) +128 to –128 (b) –128 to +127
(c) +128 to –127 (d) +127 to -127
5. Decimal Number of (4C8.2)16 is given by
(a) 1004.125 (b) 1224.125
(c) 1220.145 (d) 1222.125
6. (1010)2 – (1011)2 is
(a) 0011 (b) 1000
(c) 0001 (d) 0000
7. XS – 3 Code for (428)10 is
(a) 101101010111 (c) 010110110111
(c) 011110110101 (d) 011101011011
8. Gray code also known as
(a) Unit distance code (b) Binary Code
(c) Weighted Code (d) BCD Code
9. Which sum of the following 8 bit numbers is equivalent to Hexadecimal (2A)16?
(a) 0001 0000 and 0000 1000 (b) 0001 1000 and 0000 1100
(c) 0001 1100 and 0000 1110 (d) 0010 1000 and 0011 1011
10. An 8 bit microprocessor uses 2‟s complement when expressed in hexadecimal form, is
equivalent to F9?
(a) 0000 0111 (b) 1111 1111
(b) 1111 1101 (d) 1110 0001
11. The bubbled NOR gate is equal to
(a) AND Gate (b) OR Gate
(c) NOR Gate (d) NAND Gate
12. An 8-bit microprocessor uses 2‟s complement representations. The decimal number – 48 in sign
magnitude form can represented as
(a) 1001 1001 (b) 1110 1110
(c) 1101 0000 (d) 0010 0101
13. When signed numbers are used in binary arithmetic, then which one of the following notations
would have unique representation for zero?
(a) Sign magnitude (b) 1‟ complement
(c) 9‟s complement (d) 2‟ complement
14. If all the inputs and output of OR gate is complemented than it is equivalent to
(a) NAND gate (b) X-OR gate
(C) AND Gate (d) NOR Gate
15. Which one of the following statement is correct? For a 4- input NOR gate, when only two inputs
are to be used, the best option for the used input is to
(a) Connect them to ground (b) Connect them to Supply
(c) Keep them to open (d) Connect them to used inputs
16. 8‟s complement of (7777)8 is
(a) (0000)8 (b) (1000)8
(c) (1111)8 (d) (0001)8
17. Which of the following statement is not correct?
(a) 𝑋 + 𝑋𝑌 = 𝑋 (b) 𝑋 𝑋 + 𝑌 = 𝑋𝑌
(c) 𝑋 + 𝑋𝑌 = 𝑋 (d) 𝑍𝑋 + 𝑍𝑋𝑌 = 𝑍𝑌 + 𝑍𝑋
18. Number of NAND gates require to realize the function 𝑓 = 𝑋 + 𝑌 . (𝑍 + 𝑊)
(a) 3 (b) 4
(c) 2 (d) 6
19. The number of parity bits to be added to an 8-bit word for constructing Hamming code for
detection and correcting of single error is
(a) 1 (b) 2
(c) 0 (d) 4
20. Perform Hex Addition (C2)16 + (3E)16
(a) (100)16 (b) (CE)16
(c) (2E)16 (d) (23)16
21. Simplified expression for the given expression Y=∑m (1,3,7,11,15) + d(0,2,5)
(a) Y = CD (b) 𝑌 = 𝐴𝐵
(c) Y= CD + 𝐴𝐵 (d) 𝑌 = 𝐶𝐷 + 𝐴𝐵
22. If the input to the digital circuit shown below, consisting of a cascade of 20 Ex-OR gates is X.
Then the output Y is equal to

(a) 0 (b) 1
(c) 𝑋 (d) X
23. The Boolean expression for Y in the given logic diagram will be

(a) Y = RS (b) 𝑌 = 𝑅𝑆
(c) Y = R + S (d) 𝑌 = 𝑅 + 𝑆
24. If A and B are Boolean Variables, which one of the following is the equivalent of 𝐴 ⊕ 𝐵 ⊕ 𝐴𝐵
(a) 𝐴 + 𝐵 (b) A + B
(c) 0 (d) 1
25. Simplified expression for the given expression Y=∏M (0,1,2,3,5,7)
(a) Y = AC (b) 𝑌 = 𝐴𝐶
(c) 𝑌 = 𝐴𝐶 (d) 𝑌 = 𝐴𝐶
26. In positive logic
(a) A HIGH = 1, a LOW = 0 (b) A LOW = 1, a HIGH = 0
(c) Only HIGH = 1 are present (d) Only LOW = 0 are present
27. The parallel transmission of digital data
(a) is much slower than the serial transmission of data.
(b) Requires only one signal line between sender and receiver.
(c) Requires as many signal lines between sender and receiver as there are data bits.
(d) is less expensive than the serial method of data transmission.
28. Convert the fractional binary number 0001.0010 to decimal.
(a) 1.40 (b) 1.125
(c) 1.20 (d) 1.120
29. Perform the following hex subtraction: (ACE)16 – (999)16 =
(a) 23516 (b) 13516
(c) 03516 (d) 33516
30. Excess-3 code is known as
(a) Weighted code (b) Cyclic redundancy code
(c) Self-complementing code (d) Algebraic code.
31. Find (177)8 + 1, in decimal –
(a) 128 (b) 200
(c) 178 (d) 179
32. The decimal number -34 is expressed in the 2‟s complement form as
(a) 01011110 (b) 10100010
(c) 11011110 (d) 01011101
33. How many Ex-OR gates are required to convert (10110)2 to gray code
(a) 2 (b) 5
(c) 3 (d) 4
34. OR operation can be produced with
(a) Two NOR Gates (b) Three NAND Gates
(c) Four NAND Gates (d) Both answers (a) and (b)
35. The output of a logic gate is 1 when all its inputs are at logic 0. the gate is either
(a) a NAND or an EX-OR (b) an OR or an EX-NOR
(c) an AND or an EX-OR (d) a NOR or an EX-NOR
36. In Boolean algebra if
𝐹 = 𝐴 + 𝐵 𝐴 + 𝐶 , then F is equivalent to –
(a) 𝐴𝐵 + 𝐴𝐶 (b) 𝐴𝐵 + 𝐴𝐵
(c) 𝐴𝐶 + 𝐴𝐵 (d) 𝐴𝐴 + 𝐴𝐵
37. The simplified form of the Boolean expression 𝑌 = 𝐴𝐵𝐶 + 𝐷 (𝐴𝐷 + 𝐵 𝐶 ) can be written as
(a) 𝐴𝐷 + 𝐵 𝐶 𝐷 (b) 𝐴𝐷 + 𝐵𝐶 𝐷
(c) 𝐴 + 𝐷 (𝐵𝐶 + 𝐷) (d) 𝐴 + 𝐷 + 𝐵𝐶𝐷
38. What are the pin numbers of the outputs of the gates in a 7432 IC
(a) 3, 6, 10, 13 (b) 1, 4, 10, 13
(c ) 3, 6, 8, 11 (d) 1, 4, 8, 11
39. How many only NOR gates are required to implement EX-OR gate?
(a) 6 (b) 3
(c) 4 (d) 5
40. Obtain 16‟s Complement of (FFFF)16 is
(a) (0001)16 (b) (0000)16
(c) (1515)16 (d) (1000)16
41. The Octal equivalent of the HEX number AB.CD is –
(a) 253.314 (b) 253.632
(c) 526.314 (d) 526.632
42. A four variable switching function has minterms 𝑚6 and 𝑚9 . If the literals in these minterms are
complemented, the corresponding minterm numbers are –
(a) 𝑚3 𝑎𝑛𝑑 𝑚6 (b) 𝑚9 𝑎𝑛𝑑 𝑚6
(c) 𝑚2 𝑎𝑛𝑑 𝑚0 (d) 𝑚6 𝑎𝑛𝑑 𝑚9
43. If the information bits is given by 10111,the number of parity Bits in hamming code is
(a) 5 (b) 4
(c) 3 (d) 2
44. The circuit whose output is depend on input present at that instant of time is known as
(a) Sequential Circuit (b) Bushless Circuit
(c) Present circuit (d) Combinational Circuit
45. Which of the following expressions correctly represents the relation between P, Q, R and M?

(a) 𝑀 = (𝑃 + 𝑄) ⊕ 𝑅 (b) 𝑀 = (𝑃. 𝑄) ⊕ 𝑅


(c) 𝑀 = (𝑃 + 𝑄) ⊕ 𝑅 (d) 𝑀 = (𝑃 ⊕ 𝑄) ⊕ 𝑅
46. (17)𝑋 + (24)𝑋 = (40)𝑋 calculate the base x
(a) 8 (b) 11
(c) 16 (d) 9
47. Simplify the following expression
Y = ∏M (0, 2, 3, 5, 7)
(a) 𝑌 = 𝐴 + 𝐶 𝐴 + 𝐶 (𝐵 + 𝐴)
(b) 𝑌 = 𝐴 + 𝐶 𝐴 + 𝐶 (𝐵 + 𝐶 )
(c) 𝑌 = 𝐴 + 𝐶 𝐴 + 𝐶
(d) 𝑌 = 𝐴 + 𝐶 (𝐵 + 𝐶 )
48. For the circuit shown below, the output F is given by

(a) F = X (b) F = 0
(c) F = 1 (d) 𝐹 = 𝑋
49. If Y=A‟B‟C+A‟BC+AB‟C‟+AB‟C. Then Y‟ can be expressed as
(a) (A+B‟)(A+C‟) (b) (A‟+B)(A+C)
(c) (A‟+B)(A+C‟) (d) (A‟+B‟)(A+C‟)
50. Obtain the minimal SOP expression for Y = ∑m (0,1,2,4,6,9,11,12,13)
(a) Y = AD + ABC + ABD
(b) 𝑌 = 𝐴𝐷 + 𝐴𝐵 𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵 𝐷
(c) 𝑌 = 𝐴𝐷 + 𝐴𝐵 𝐶 + 𝐴𝐵𝐶
(d) 𝑌 = 𝐴𝐷 + 𝐴𝐵𝐶 + 𝐴𝐵 𝐷

51. Convert octal number (756.603) to hexadecimal number


(a) 1EC.E18 (b) 1EE.C18
(c) 81C.1EE (d) 9CE.C18
52. Convert the hexadecimal number (B9F.AE) to octal number
(a) 5341.7365 (b) 4752.563
(c) 5637.534 (d) 5347.563
53. A group of 8 bits is known as
(a) Nibble (b) Octal number
(c) Bit (d) Byte
54. What is the general formula for largest decimal number where n is number of bits?
a. 2𝑛
b. 2𝑛 −1
c. 2𝑛 −1 − 1
d. 2𝑛 − 1
55. Express – 39 in sign magnitude 2's complement form
(a) 11011001
(b) 10100111
(c) 11011000
(d) 01011001
56. Express – 11 in sign magnitude 1's complement form
a. 11110100
b. 10001011
c. 11110101
d. 01110100
57. For the 2's complement signed numbers, the range of values for 8 bit numbers is
(a) +128 to -127
(b) +127 to -127
(c) + 8 to -8
(d) +127 to -128
58. Find the decimal values of the signed binary number 10101010 expressed in 1‟s complement
form
(a) - 170
(b) + 85
(c) + 170
(d) – 85
59. Find the decimal values of the signed binary number 11101010 expressed in 2's complement
form
(a) - 22
(b) - 234
(c) + 22
(d) + 234
60. Perform the (3𝐹𝐶5)16 + (7𝐹𝐴𝐸)16
a. (𝐴𝐵71)16
b. (𝐵𝐶59)16
c. (𝐵𝐹73)16
d. (12𝐴𝐵)16
61. Perform Hex Addition (C2)16 + (3E)16
(a) (100)16 (b) (CE)16
(c) (2E)16 (d) (23)16
62. Perform the subtraction of binary numbers 11010 - 10000
(a) 01000
(b) 01100
(c) 01010
(d) 11100
63. Subtract octal number 536 from 345
(a) 171
(b) 191
(c) 271
(d) 291
64. In a digital computer binary subtraction is performed
(a) in the same way as we perform subtraction in decimal number system
(b) using 2's complement method
(c) using 9's complement
(d) using 8's complement
65. When signed numbers are used in binary arithmetic, then which one of the following notations
would have unique representation for zero?
(a) 8's complement (b) 10‟s complement
(c) 15‟s complement (d) 2‟ complement
66. Gray code also known as
(a) Sequential Code
(b) 8421 Code
(c) Weighted Code
(d) Unit Distance Code
67. Excess-3 code is known as
(a) Weighted code
(b) 8421 Code
(c) Self-complementing code
(d) Cyclic Code
68. Convert gray code 11011 to binary code
(a) 01001
(b) 10111
(c) 10010
(d) 00011
69. The code whose succeeding code is one binary number is greater than the preceding code is
called
(a) Cyclic Code
(b) Self Complementing Code
(c) Reflecting code
(d) Sequential Code
70. Convert binary code 1110111 to gray code
(a) 1001100
(b) 0011001
(c) 0010010
(d) 1111000
71. Which of the following codes is known as 8421 Code?
(a) Gray Code
(b) XS - 3 Code
(c) Binary Codes
(d) BCD Codes
72. The number of parity bits to be added to an 4-bit word for constructing Hamming code for
detection and correcting of single error is
(a) 2
(b) 4
(c) 3
(d) 0
73. The number of parity bits to be added to an 8-bit word for constructing Hamming code for
detection and correcting of single error is
(a) 2
(b) 1
(c) 3
(d) 4
74. Parity check bit coding is used for
a) Error correction
b) Error detection
c) Error correction and detection
d) None of the above
75. Hamming code can correct how many bit error?
(a) Single bit
(b) Two bits
(c) It cannot correct the error
(d) it can correct an infinite number of errors
76. The output of logic gate is 0 when all its inputs are at logic 0. The gate is either
(a) an AND or a NOR
(b) a NAND or and X - OR
(c) an OR or an X - OR
(d) an OR or an X – NOR
77. The output of logic gate is 0 when all its inputs are at logic 1. The gate is either
(a) a NAND or an AND
(b) a NAND or an X - OR
(c) an OR or an X - NOR
(d) an X - OR or an X – NOR
78. What is the minimum number of NAND gates required to realize an X - OR gate?
(a) 3
(b) 4
(c) 5
(d) 6
79. A bubbled OR gate is equivalent to a
(a) AND Gate
(b) NAND Gate
(c) NOR Gate
(d) X - OR Gate
80. Which of the following expressions is incorrect?
a. 𝐴 + 𝐴𝐵 = 𝐴 + 𝐵
b. 𝐴 + 𝐴𝐵 = 𝐵
c. 𝐴 + 𝐵 𝐴 + 𝐶 = 𝐴 + 𝐵𝐶
d. 𝐴 + 𝐵 𝐴 + 𝐵 = 𝐴
81. 1 ⊕ 𝐴 is equal to
a. 1
b. A
c. 𝐴
d. 1+A
82. Which of the following expressions is in the sum-of-products (SOP) form?
a. (A + B)(C + D)
b. ABCD
c. ABC+D
d. AB + CD
83. A four variable switching function has minterms 𝑚6 and 𝑚9 . If the literals in these minterms are
complemented, the corresponding minterm numbers are –
a. 𝑚3 𝑎𝑛𝑑 𝑚6
b. 𝑚9 𝑎𝑛𝑑 𝑚6
c. 𝑚2 𝑎𝑛𝑑 𝑚0
d. 𝑚6 𝑎𝑛𝑑 𝑚9
84. A karnaugh map for an expression having 'don't care terms' the don't cares treated as
a. 0
b. 1
c. inputs
d. 1 or 0
85. A Karnaugh map with 4 variables has
a. 2 Cells
b. 4 Cells
c. 8 Cells
d. 16 Cells
86. In K-maps the values of inputs follow which type of a standard sequence?
a. Binary code sequence
b. Gray code Sequence
c. Xs- 3 Code Sequence
d. BCD code Sequence
87. The binary number designations of the rows and columns of the K-map are in
a. Binary code
b. BCD code
c. Gray code
d. XS-3 code
88. An n – variable K – Map can have
a. n2
b. 2n2
c. 2n
d. 2n
89. Simplified expression for the given expression Y=∏M (0, 1,2,3,5,7)
(a) Y = AC (b) 𝑌 = 𝐴𝐶
(c) 𝑌 = 𝐴𝐶 (d) 𝑌 = 𝐴𝐶
90. The other Canonical form of Y = ∑m (0, 1, 5, 7) is
a. ∏M (2, 3, 4, 6)
b. ∏M (0, 1, 5, 7)
c. ∏M (0, 3, 4, 7)
d. ∏M (2, 1, 5, 6)
91. How many inputs and outputs does a full adder have ?
a. two inputs, two outputs
b. two inputs, one output
c. three inputs, two outputs
d. two inputs, three outputs
92. A logic circuit that accepts several data inputs and allows only one of them at a time to get
through to the output is called
a. Multiplexer
b. Demultiplexer
c. Parity Checker
d. Transmitter
93. One that is not outcome of magnitude comparator is
(a) a > b (b) a - b
(c) a < b (d) a = b
94. Which logic circuit compares the magnitudes of two binary numbers?
a. multiplexer
b. Encoder
c. Parity Checker
d. Magnitude Comparator
95. One application of a digital multiplexer is to facilitate:
a. Data generation
b. Serial-to-Parallel conversion
c. Parity checking
d. Data selector
96. A Demultiplexer is also Known as
a. Encoder
b. Decoder
c. Data Selector
d. Data Distributor
97. In 1:8 Demultiplexer, how many select inputs are present?
a. 2
b. 8
c. 1
d. 3
98. BCD to seven segment is a
a. encoder
b. decoder
c. comparator
d. carry look ahead
99. A circuit that converts n inputs to 2n outputs is called
a. Encoder
b. Decoder
c. Comparator
d. Parity Checker
100. 𝐴 ⊙ 𝐵 is equivalent to
a. NAND Gate
b. EX-NOR Gate
c. NOR Gate
d. Ex – OR Gate
101. What is the Full Form of CMOS?
a. Complete Metal Oxide Semiconductor
b. Complementary Metal of Semiconductor
c. Complementary Metal Oxide Semiconductor
d. Complete Metal Oxide Silicon
102. What is the Full Form of TTL?
a. Triple Transistor Logic
b. Tristate Transistor Logic
c. Transistor Transistor Logic
d. Transistor Tristate Logic
103. As compared to TTL, CMOS logic has
a. Higher speed of operation
b. Higher power dissipation
c. Smaller physical size
d. All the above
104. Which of the following is fastest logic family?
(a) TTL (b) ECL
(c) DTL (d) CMOS
105. As compared to TTL, CMOS logic has
a. Higher speed of operation
b. Higher power dissipation
c. Smaller physical size
d. All the above
106. Which logic family has the highest power dissipation per gate?
a. ECL
b. TTL
c. CMOS
d. PMOS
107. TTL uses
a. Multi emitter transistor
b. Multi collector transistor
c. Multi base transistor
d. Multi emitter or multi collector transistor
108. The IC's used in calculators and watches are of
a. ECL
b. MOS
c. TTL
d. CMOS
109. The recommended fan out for TTL is
a. 25
b. 15
c. 20
d. 10
110. Recommended fan - out for ECL is
a. 10
b. 5
c. 25
d. 15
111. The parameters which are not specified for the digital IC's
a. Propagation Delay
b. Noise Margin
c. Bandwidth
d. Gate Dissipation
112. The 'Noise Margin' of a TTL gate is given by
a. 0.4 V
b. 0.6 V
c. 0.8 V
d. 0.2 V
113. Which of the following has least propagation delay?
a. ECL
b. TTL
c. CMOS
d. CTL
114. Which of the following has low noise margins?
a. RTL (b) TTL
b. DTL (d) ECL
115. Which of the following logic families has the highest noise margin?
a. CMOS
b. TTL
c. DTL
d. ECL
116. The most widely used bipolar technology for digital IC‟s is
a. DTL
b. TTL
c. ECL
d. CMOS
117. Which of the following is D to A conversion technique?
(a) Successive approximation
(b) Weighted Resistor Technique
(c) Counter Type Converter
(d) Integrator Type Converter
118. Which types of gates are used in ECL logic family?
a. OR/NOR
b. NAND/NOR
c. AND/NAND
d. Ex- OR/OR
119. Among the following the slowest ADC is
a. Parallel – Comparator (flash type)
b. Successive Approximation Type
c. Integrating Type
d. Counting Type
120. In TTL which type of Gates are used
a. OR Gate
b. NAND Gate
c. XOR Gate
d. NOR Gate
121. Which of the following is A to D conversion technique?
a. Successive approximation
b. Binary Weighted Resistor Technique
c. R - 2R Ladder Technique
d. None of Above
122. For the high speed applications, DACs use
a. Parallel form of conversion
b. Serial form of conversion
c. Successive approximation form of conversion
d. Feed forward form of conversion
123. CMOS logic consists of
a. Only n- channel MOS devices
b. Only p – channel MOS devices
c. Equal number of n – channel and p – channel MOS devices
d. None of these
124. In a logic circuit has a fan out of 4, then the circuit
a. Has 4 inputs
b. Has 4 outputs
c. Can drive maximum of 4 inputs
d. Gives output 4 times the input
125. The ability of the logic circuit to tolerate the noise without causing any unwanted changes in
the output is known as
(a) Power Dissipation (b) Propagation Delay
(c) Noise Immunity (d) Figure of Merit
126. HTL is preferred in the industrial environment because
(a) Low power dissipation (b) High speed
(c) Low noise margin (d) Highest noise Margin
127. A 4 – bit DAC has an output voltage range 0 – 5 V. Calculate its resolution
a. 0.1V
b. 0.5 V
c. 0.33 V
d. 0.50 V mV
128. A 3 bit comparator type ADC is required for the conversion application. How many
comparators required?
a. 4
b. 6
c. 8
d. 7
129. Calculate the analog output voltage of a DAC whose output voltage range is 0 to 5V, for the
1010 digital inputs
a. 6.05 V
b. 3.125 V
c. 4 V
d. 4.625 V
130. Calculate the analog output voltage of a DAC whose output voltage range is 0 to 5V, for the
1101 digital inputs
a. 6 V
b. 3.75 V
c. 4.5 V
d. 4.0625 V
131. Which of the following is minimum error code?
[a] Octal code [b] Grey code
[c] Binary code [d] Excess 3 code
132. The systematic reduction of logic circuits is accomplished by:
[a] Symbolic reduction [b] Using Boolean algebra
[c] TTL logic [d] using a truth table
133. -24 is 2‟s complement form is
(a) 11101000 (b) 01001000
(c) 01111111 (d) 00111111
134. (FF)16 when converted to 8421 BCD is
(a) 0000 0101 0101
(b) 0010 0101 0101
(c) 1111 0101 0101
(d) 1000 0101 0101
135. Number of Ex-OR gates are required to convert (111010)2 to Gary code
(a) 4 (b) 5
(c) 6 (d) 7
136. The range of signed decimal number that can be represented by 6-bit 1‟s complement number
is
(a) -31 to +31 (b) -63 to +63
(c) -64 to +63 (d) -32 to 31
137. Compute the result of (DF)16 + (AC)16
(a) (18)16 (b) (1812)16
(c) (B18)16 (d) (18B)16
138. Number of NAND gates required to implement X-NOR Gate
(a) 4 (b) 5
(c) 6 (d) 7
139. Add (37)8 + (25)8
(a) (62)8 (b) (26)8
(c) (46)8 (d) (64)8
140. Hamming code can detect how many bit error?
(a) Single bit (b) double bit
(c) It cannot detect error (d) it can detect infinite number of errors
141. Convert (0101 0011)BCD into XS-3 Code
(a) 0011 0101 (b) 1000 0110
(c) 0110 1000 (d) 1000 0101
142. The code whose succeeding code is one binary number is greater than the preceding code is
called
(a) Weighted Code
(b) Non- Weighted Code
(c) Reflecting code
(d) Sequential Code
143. What is the equivalent expression for the Y = ∑m (1,4,7)
(a) ∏M (0, 2, 3, 5, 6)
(b) ∏M (1, 4, 7)
(c) ∑m (0, 2, 3, 5, 6)
(d) ∏M (0, 2, 3, 1, 7)
144. XS- 3 Code is also known as
(a) Weighted Code
(b) Alphanumeric Code
(c) Self Complementing Code
(d) All of Above
145. NAND. gates are preferred over others because these
(a) Have lower fabrication area
(b) can be used to make any logical circuit
(c) Consume least electronic power
(d) provides maximum density in a chip.
146. Convert (673)8 to ( )16
(a) (1BB)16 (b) (11111)16
(c) (1B11)16 (d) (111B)16
147. Perform the subtraction using 1‟s complement (0011.1001)2 – (0001.1110)2
(a) (0001.0001)2 (b) (1011.0001)2
(c) (0001.1011)2 (d) (0001.1010)2
148. In K-maps the values of inputs follow which type of a standard sequence?
(a) Binary code sequence
(b) Gray code Sequence
(c) Xs- 3 Code Sequence
(d) BCD code Sequence
149. . An AND gate will function as OR if
(a) all the inputs to the gates are “1”
(b) All the inputs are „0‟
(c) either of the inputs is “1”
(d) All the inputs and outputs are complemented.
150. (1011)2*(101)2=
(a) 55 (b) 45
(c) 35 (d) 25
151. Determine the value of base „x‟ if (211)𝑥 = (152)8
(a) 8 (b) 5
(c) 16 (d) 7
152. The output of the circuit shown in figure is equal to

(a) 0 (b) 1
(c) 𝐴𝐵 + 𝐴𝐵 (d) B
153. 𝑋 + 𝑌 𝑋. 𝑍 + 𝑍 . 𝑌 + 𝑋. 𝑍 When simplified, becomes –
(a) XYZ (b) X+Y+Z
(c) XY = YZ + ZX (d) 0
154. Find the equivalent term 𝑓 = 𝑋𝑌𝑍𝑊
(a) 𝑓 = 𝑋𝑌𝑍𝑊
(b) 𝑓 = 𝑋 + 𝑌 + 𝑍 + 𝑊
(c) 𝑓 = 𝑋𝑌𝑍𝑊
(d) 𝑋 + 𝑌 + 𝑍 + 𝑊
155. Minimize the given logical expression
Y = ∑m (1, 5, 6, 12, 13, 14) + d(2, 4)
(a) 𝑌 = 𝐴𝐶 D+ 𝐶 𝐵 + 𝐵𝐷 (b) 𝑌 = 𝐴𝐶 + 𝐶 + 𝐵𝐷
(c) 𝑌 = 𝐶 𝐷 + 𝐶 𝐵 + 𝐷 (d) 𝑌 = 𝐴𝐶
156. Convert (0.59C)16 to equivalent decimal number
(a) 0.3558 (b) 0.350585
(c) 0.3668 (d) 0.360685
157. The binary number 110011 is to be converted to gray code. The number of gates and type
required are –
(a) 6, AND gate (b) 6, XNOR Gate
(c) 6, XOR gate (d) 5, XOR gate
158. A 4 – bit BCD for numeral 9 can be decoded most economically by the logic operation
(a) ABCD (b) 𝐴𝐵 𝐶𝐷
(c) 𝐴𝐵 𝐶 𝐷 (d) 𝐴𝐵𝐶 𝐷
159. Range of 1‟s complement for a 4-bit number is
(a) +8 to -8 (b) +7 to -8
(c) + 8 to -7 (d) +7 to -7
160. A 4-bit microprocessor uses 2‟s complement representations. The decimal number – 8 in sign
magnitude form can represented as
(a) (1000)2 (b) (0111)2
(c) (0101)2 (d) (1111)2
161. A combinational circuit
(a) Always contain memory element
(b) never contains memory element
(c) may sometimes contain memory element
(d) Contain memory element
162. Subtract (161)8 – (243)8
(a) (534)8 (b) (82)8
(c) (62)8 (d) (715)8
163. Multiplication of (1001)2 by (1000)2 is equivalent to
(a) (10011000)2 (b) (1001000)2
(c) (0001001)2 (d) (10001001)2
164. Which code is also known as self complementing code?
(a) Gray code (b) Binary code
(c) XS- 3 Code (d) BCD Code
165. 10‟s complement of (9999)10 is given by
(a) 0001 (b) 0000
(c) 1000 (d) 1111
166. Obtain the XS – 3 code for (428)10
(a) 1011 0101 0111
(b) 0111 1011 0101
(c) 1011 0111 0101
(d) 0111 0101 1011
167. A binary with n digits all of which are unity has the value
(a) 𝑛2 − 1 (b) 2𝑛
(c) 2𝑛 −1 (d) 2𝑛 − 1
168. The parity bit is added for which purposes?
(a) Error Correction
(b) Coding
(c) Indexing
(d) Controlling
169. Represent the (4096)10 in gray code
a. (1000000000000)2
b. (1100000000000)2
c. (1000000000001)2
d. (1100000000011)2
170. Which one of the following is non – valid BCD Code?
(a) 0111 1001 (b) 0101 1011
(c) 0100 1000 (d) 0100 1001
171. The output of an Ex – OR Gate with A and B inputs will be
(a) 𝐴𝐵 + 𝐴𝐵 (b) 𝐴 + 𝐵 (𝐴 + 𝐵)
(c) (𝐴 + 𝐵)𝐴𝐵 (d) 𝐴 + 𝐵 + 𝐴𝐵
172. The POS form of expression is suitable for circuit using
(a) XOR (b) NAND
(c) AND (d) NOR
173. The reason for using Gray Code in K-Map is
(a) Gary code is efficient than binary codes
(b) Gray code provides cell values that differ in only one bit in adjacent cells
(c) No other code is available
(d) any other code can also be used
174. Which of the following statement is not correct?
(a) 𝑋 + 𝑋𝑌 = 𝑋 (b) 𝑋 𝑋 + 𝑌 = 𝑋𝑌
(c) 𝑋 + 𝑋𝑌 = 𝑋 (d) 𝑍𝑋 + 𝑍𝑋𝑌 = 𝑍𝑌 + 𝑍𝑋
175. The other Canonical form of Y = ∑m (0, 1, 5, 7) is
(a) ∏M (2, 3, 4, 6)
(b) ∏M (0, 1, 5, 7)
(c) ∏M (0, 3, 4, 7)
(d) ∏M (2, 1, 5, 6)
176. The Boolean expression 𝑌𝑍 + 𝑋𝑍 + 𝑋𝑍 is logically equivalent to
(a) 𝑌𝑍 + 𝑋 (b) 𝑌𝑍𝑋 + 𝑌𝑍𝑋
(c) YZ + XZ +XY (d) 𝑋𝑍

177. Given, (136)x + (165)x = (312)x What is the value of base x?


(a) 6 (b) 7
(c) 8 (d) 9
178. The minimum number of NAND gates required to implement
𝑌 = 𝐴𝐵 + 𝐴 + 𝐵 + 𝐶
(a) 0 (b) 7
(c) 9 (d) 1
179. Minimized the given expression Y = ∑m (3, 2, 6, 8, 10, 11, 15) + d (5, 7, 12, 13, 14)
(a) 𝐴 + 𝐵 𝐶 (b) B + AC
(c) C + A𝐷 (d) ABC
180. Y=A+A‟B can be minimized to

(a) AB (b) A‟B


(c) A‟+B (d) A+B
181. In an N bit 1‟s complement representation, positional weight of MSB is
(a) -[2N-1] (b) [2N-1]
N-1
(c) -[2 -1] (d) [2N-1-1]
182. In 2‟s complement representation, 10010110 represents
(a) 152 (b) -152
(c) -22 (d) -106
183. Parity check code is used for
(a) One bit error detection
(b) One bit error correction
(c) Two bit error detection
(d) Two bit error correction
184. (5C)16+ (D7)16 is,
(a) (199)16 (b) (193)16
(c) (139)16 (d) (133)16
185. Decimal equivalent for (46.2)8 is,
(a) 22.2 (b) 34.4
(c) 38.25 (d) 56.25
186. If 77/3=25, the base of the number system is
(a) 6 (b) 7
(c) 8 (d) 9
187. Which of the following are universal gates?
(a) NAND & NOR (b) NAND & EXOR
(c) NOR & EXOR (d) NAND, NOR & EXOR
188. (53)8 can be expressed in Gray code as,
(a) 101111 (b) 110010
(c) 111110 (d) 110101
189. Negative numbers can be represented in
(a) Signed magnitude form
(b) 1‟s compliment form
(c) 2‟s compliment form
(d) All of the above
190. Which of the following expressions correctly represents the relation between P, Q, R and M?

(a) 𝑀 = (𝑃 + 𝑄) ⊕ 𝑅 (b) 𝑀 = (𝑃. 𝑄) ⊕ 𝑅


(c) 𝑀 = (𝑃 + 𝑄) ⊕ 𝑅 (d) 𝑀 = (𝑃 ⊕ 𝑄) ⊕ 𝑅

191. Output of a multi input EXOR gate is 1, when


(a) Even number of inputs are 0
(b) Even number of inputs are 1
(c) Odd number of inputs are 0
(d) Odd number of inputs are 1
192. EXCESS-3 Code for (275)10 is
(a) 010110101000 (b) 010110110111
(c) 001001111000 (d) 001001011011
193. (7A53)16 - (4CE9)16 =
(a) (2D6A)16 (b) (2704)16
(c) (3204)16 (d) (370A)16
194. In Signed representation of Binary numbers, which of the following representation have
unique representation for 0 (Zero)
(a) 15‟s Complement (b) 1‟s Complement
(c) 2‟s Complement (d) 7‟s Complement
195. Which of the following is a Non sequential code?
(a) BCD (b) Excess-3
(c) Gray (d) All of these
196. Find (177)8 + 1, in decimal –
(a) 128 (b) 200
(c) 178 (d) 179

197. F=A+BC is a reduced form of


(a) AB+BC (b) (A+B)(A+C)
(c) A‟B+AB‟C (d) (A+C).B
198. Range of 8 bit 2‟s comp. representation is
(a) -128 to +127 (b) -127 to +127
(c) -128 to +128 (d) -127 to +128
199. EXNOR gate can be represented as
(a) (A‟+B‟). (A+B) (b) (A‟+B).(A+B‟)
(c) (A+B)‟. (A+B) (d) (A+B‟).(A+B)‟
200. Minimum number of 2 input NAND gates required to implement an EXNOR gate is
(a) 3 (b) 4
(c) 5 (d) 6
201. If the input to the digital circuit shown below, consisting of a cascade of 20 Ex-OR gates is
X. Then the output Y is equal to
(a) X (b) X‟
(c) 0 (d) 1

202. Boolean expression for the output of logic circuit given below is

(a) Y= A‟B‟+AB+C‟ (b) Y= A‟+AB‟+C‟


(c) Y= A‟B+AB‟+C‟ (d) Y= AB+C‟
203. If Y=ABC+ABC‟+A‟B‟C+A‟BC. Then Y‟ can be expressed as
(a) (A+B‟).(A+C‟) (b) (A‟+B).(A+C)
(c) (A+B‟).(A‟+C) (d) (A‟+B‟).(A+C‟)
204. Given, (135)base x + (144)base x = (312)base x What is the value of base x?
(a) 6 (b) 7
(c) 8 (d) 9
205. The Boolean expression 𝐴 + 𝐵 𝐴 + 𝐵 + 𝐶 𝐴 + 𝐵 + 𝐶 When simplified, becomes –
(a) B (A + C) + ABC (b) A (B + C)
(c) 𝐴𝐵𝐶 (d) ABC
206. 𝑋 + 𝑌 𝑋. 𝑍 + 𝑍 . 𝑌 + 𝑋. 𝑍 When simplified, becomes –
(a) XYZ (b) X+Y+Z
(c) XY = YZ + ZX (d) 0
207. (4) If A and B are Boolean Variables, which one of the following is the equivalent of
𝐴 ⊕ 𝐵 ⊕ 𝐴𝐵
(a) 𝐴 + 𝐵 (b) A + B
(c) 0 (d) 1
208. Which of the following statement is correct?
(a) 𝑋 + 𝑋𝑌 = 𝑋 (b) 𝑋 𝑋 + 𝑌 = 𝑋𝑌
(c) 𝑋 + 𝑋𝑌 = 𝑋 (d) 𝑍𝑋 + 𝑍𝑋𝑌 = 𝑍𝑌 + 𝑍𝑋
209. The Boolean function 𝑋 + 𝑌 (𝑌 + 𝑍) 𝑋 + 𝑌 is equal to which one of the following
expressions?
(a) 𝑋 + 𝑌 (𝑋 + 𝑍) (b) 𝑍 + 𝑌 (𝑋 + 𝑍)
(c) (X + Y) (Y + Z) (d) 𝑋 + 𝑌 (𝑌 + 𝑍)
210. In Boolean algebra if 𝐹 = 𝐴 + 𝐵 𝐴 + 𝐶 , then –
(a) 𝐹 = 𝐴𝐵 + 𝐴𝐶 (b) 𝐹 = 𝐴𝐵 + 𝐴𝐵
(c) 𝐹 = 𝐴𝐶 + 𝐴𝐵 (d) 𝐹 = 𝐴𝐴 + 𝐴𝐵
211. The simplified form of the Boolean expression 𝑌 = 𝐴𝐵𝐶 + 𝐷 (𝐴𝐷 + 𝐵 𝐶 ) can be written as
(a) 𝐴𝐷 + 𝐵 𝐶 𝐷 (b) 𝐴𝐷 + 𝐵𝐶 𝐷
(c) 𝐴 + 𝐷 (𝐵𝐶 + 𝐷) (d) 𝐴 + 𝐷 + 𝐵𝐶𝐷
212. The Boolean expression 𝑌𝑍 + 𝑋𝑍 + 𝑋𝑍 is logically equivalent to
(a) 𝑌𝑍 + 𝑋 (b) 𝑌𝑍𝑋 + 𝑌𝑍𝑋
(c) YZ + XZ +XY (d) 𝑋𝑍
213. Find the equivalent term 𝑓 = 𝑋 + 𝑌 + 𝑍
(a) XYZ (b) 𝑋𝑌𝑍
(c) X + Y + Z (d) None of these
214. Find the equivalent term 𝑓 = 𝑋𝑌𝑍𝑊
(a) 𝑓 = 𝑋𝑌𝑍𝑊 (b) 𝑓 = 𝑋 + 𝑌 + 𝑍 + 𝑊
(c) 𝑓 = 𝑋𝑌𝑍𝑊 (d) None of these

You might also like