Multiple Choice Questions (Digital Logic)

1. An arbitrary number system has a radix of 32 with 0 to 9 and A to V as its independent

digits, 0 being the first and V being the 32 nd digit. Determine the equivalent of decimal
number 128 in this arbitrary number system.
a. 40 b. 41
c. 42 d. 43
2. Find the octal equivalent of hexadecimal number 13.34
a. 23.15 b. 23.55
c. 25.15 d. 25.55
3. Decimal 43 in hexadecimal and BCD number system is , respectively,
a. B2, 01000011 b. 2B, 01000011
c. 2B, 00110100 d. B2, 01000100
4. Find the decimal equivalent of a binary number 10001110, which has been represented
in 2’s complement form.
a. -114 b. +114
c. +142 d. None of these
5. Find the decimal equivalent of 00001110 represented in 2’s complement form.
a. 13 b. 14
c. 15 d. 16
6. Decimal 45.15 when converted into 9’s complement will become
a. 54.84 b. 45.48
c. 48.54 d. 45.84
7. What is the 2’s complement representation of -17?
a. 101111 b. 110111
c. 101110 d. 101011
8. The range of signed decimal numbers that can be represented by six-bit 1’s complement
number is
a. -31 to +31 b. -63 to +63
c. -64 to +63 d. -32 to +31
9. 11001, 1001 and 111001 correspond to the 2’s complement representation of which one
of the following sets of number?
a. 25, 9 and 57, respectively b. -7, -7 and -7, respectively
 c. -6, -6 and -6, respectively d. -25, -9 and -57, respectively
10. X = 01110 and Y = 11001 are two five-bit binary numbers represented in two’s
complement format. The sum of X and Y represented in two’s complement format using
6 bits is
a. 100111 b. 001000
c. 000111 d. 101001
11. The two numbers represented in signed 2’s complement form are P = 11101101 and Q =
11100110. If Q is subtracted from P, the value obtained in signed 2’s complement form is
a. 100000111 b. 00000111
c. 11111001 d. 111111001
12. Decimal number 5436 when converted into 9’s complement will become
a. 4356 b. 4653
c. 4563 d. 4655
13. Decimal 1932 when converted into 10’s complement will become
a. 8868 b. 8068
c. 8608 d. 8806
14. Octal coding involves grouping the bits in
a. 5’s b. 7’s
c. 4’s d. 3’s
15. The number of levels in a digital signal is
a. one b. two
c. four d. ten
16. A device that converts from decimal to binary numbered is called
a. decoder b. encoder
c. CPU d. converter
17. For an n-variable Boolean function, the maximum number of prime implicants is
a. 2(n-1) b. n/2
c. 2n d. 2(n-1)
18. Binary arithmetic operations are
a. Addition and subtraction b. multiplication and division
c. both (a) and (b) d. none of the above
19. According to algebra of logic (A+A̅) equals
a. 0 b. 1
c. A d. A + A̅
20. How many truth table can be made from one function table?
a. One b. Two
c. Three d. Any number
21. Truth table can only be used for ……….
a. Asynchronous b. synchronous
c. combinational d. digital
22. Which of the following binary relations is invalid?
a. 1+1 = 10 b. 0×0 = 0
c. 1×1 = 1 d. 0+1 = 1
23. Boolean algebra is essential based on
a. signals b. truth
c. logic d. symbols
24. According to Boolean 1+A+B+C is equal to
a. A + B + C b. AB + BC
c. 1 + ABC d. 1
25. The cumulative addition of the four binary bits (1+1+1+1) gives
a. 100 b. 111
c. 1001 d. 1111
26. Which of the following relation is invalid according to Boolean algebra?
a. 0+X = X b. 1+X = 1
c. X+X = X d. X+X = 0
27. Identify the simplified Boolean expression for the Karnaugh map shown in the figure.
C

1 1 1
1 1 1 B
A 1 1

D
 a. (A̅C̅ + A̅D̅ + ABC) b. (A̅C̅ + A̅D̅ + AB)
c. (A̅C̅ + A̅D̅ + BC) d. (A̅C̅ + A̅D̅ + AC)
28. (A̅B + CD) is a simplified version of the Boolean expression ABCD + A̅B̅CD + A̅B only if
there were a ‘don’t care’ entry. What is it?
a. ABD b. BCD
c. ABC d. AB̅CD
29. Given that the Boolean function represented by notation ∑0, 2 is the same as the
Boolean function represented by the notation ∏ A, B. What is the value of B
a. 2 b. 3
c. 4 d. 5
30. The expanded form of the Boolean function: ABCD +A̅B̅CD + A̅B contains how many
minterms?
a. 2 b. 4
c. 6 d. 8
31. In the Karnaugh map for an eight-variable Boolean function, a certain group corresponds
to a term having two literals. It should be a group of
a. 64 b. 32
c. 128 d. 16
32. The complement of the complement of Boolean function A̅B + AB̅ will be
a. A.B + A̅.B̅ b. A̅.B
c. A̅.B + A.B̅ d. None of these
33. A + A.B̅ + A.B̅.C + A.B̅.C.D̅ simplifies to
a. 1 b. 0
c. A + B d. A
34. A̅.B + A.B̅ is equal to
a. (A + B).(A̅ + B̅) b. A.B + A̅.B̅
c. (A̅ + B).(A + B̅) d. None of these
35. The equality ( A+ B+C ) = A̅.B̅.C̅ is better known as
a. Involution Law b. Absorption Law
c. De Morgan’s Law d. Complementation Law
36. If f(A, B, C) = ∑ 1, 2, 3, 4, 5, 6, 7 and there are no ‘don’t care’ entries, then f’ (A, B, C)
would equal
a. A̅ + B̅ + C̅ b. A + B + C
c. A.B.C d. A̅.B̅.C̅
37. Simplify the Boolean function: A.B + A̅.B + A.B̅ + A̅.B̅
a. 1 b. 2
c. 3 d. 4
38. How many numerical entries the Boolean expression (AB + BC + AC) have in sigma
notation?
a. 2 b. 3
c. 4 d. 5
39. What will be the maximum number of terms in a five variable minterm Boolean
expression?
a. 32 b. 33
c. 34 d. 35
40. How many terms will appear in an equivalent ∏-nomenclature of the Boolean function
∑1, 4, 7?
a. 2 b. 3
c. 4 d. 5
41. The number of distinct Boolean expression of four variable is
a. 16 b. 256
c. 1024 d. 65536
42. While obtaining minimal sum-of-products expression,
b. All don’t cares are ignored
c. b. all don’t cares are treated as logic 1s
d. all don’t cares are treated as logic 0s
e. only such don’t cares that aid minimization are treated as logic 1s
43. The number of product terms in the minimized sum-of-product expression obtained
through the following K-map is (where d denotes ‘don’t care’ states)

1 0 0 1
0 d 0 0
0 0 d 1
1 0 0 1
 f. 2 b. 3
c. 4 d. 5
44. The boolean function Y = AB + CD is to be realized using only two-input NAND gates. The
minimum number of gates required is
a. 2 b. 3
c. 4 d. 5
45. The boolean expression Y = A̅B̅C̅D + A̅BCD̅ + AB̅C̅D + ABC̅D̅ can be minimized to
a. Y = A̅B̅C̅D + A̅BC̅ +AC̅D b. Y = A̅B̅C̅D + BCD̅ + AB̅C̅D
c. Y = A̅BCD̅ + B̅C̅D +AB̅C̅D d. Y = A̅BCD̅ + B̅C̅D +ABC̅D̅
46. An example of a sum-of-products expression is
a. A + B(C + D) b. A̅B + AC̅ + AB̅C
c. (A̅ + B̅ + C)(A + B̅ + C) d. both answers (b) and (c)
47. An example of a standard SOP expression is
a. A̅B + AB̅C + ABD̅ b. AB̅ + A̅B + AB
c. AB̅C + AC̅D d. AB̅CD̅ + A̅B + A̅
48. A 3-variable Karnaugh map has
a. Eight cells b. sixteen cells
c. three cells d. four cells
49. In a 4-variable Karnaugh map, a 2-variable product term is produced by
a. A 2-cell group of 1s b. a 4-cell group of 1s
c. an 8-cell group if 1s d. a 4-cell group of 0s
50. On a Karnaugh map, a grouping the 0s produces
a. A product-of-sums expression b. a “don’t care” condition
c. a sum-of-products expression d. AND-OR logic
51. A 5-variable Karnaugh map has
a. Sisteen cells b. sixty-four cells
c. thirty-two cells d. all of the above
52. In canonical SOP form, the number of minterms in logical expression, A + B’C is:
a. 4 b. 5
c. 6 d. 7
 53. For the SOP expression AB̅C + A̅BC + ABC̅, how many 1s are in the truth table’s output
column
b. 1 b. 2
c. 3 d. 4
54. A truth table for the SOP expression ABC̅ + AB̅C + A̅B̅C has how many input
combinations?
a. 1 b. 4
c. 3 d. 8
55. In the sum of products function f(X, Y, Z) = ∑(2, 3, 4, 5), the prime implicates are
a. X̅Y, XY̅ b. X̅Y, XY̅Z̅, XY̅Z
c. X̅YZ̅, X̅YZ, XY̅ d. X̅YZ̅, X̅YZ, XY̅Z̅, XY̅Z
56. For an n-variable Boolean function, the maximum number of prime implicants is
a. 2(n-1) b. n/2
c. 2n d. 2(n-1)
57. A function Boolean variable X, Y and Z is 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)?
a. (X̅ + Y̅ + Z̅).(X̅ + Y + Z).(X + Y̅ + Z̅)
b. b. (X + Y + Z).(X + Y̅ + Z̅).(X̅ + Y + Z)
c. (X̅ + Y̅ + Z).(X̅ + Y + Z̅).(X + Y̅ + Z).(X + Y + Z̅).(X + Y + Z)
d. (X + Y + Z̅).(X̅ + Y + Z).(X̅ + Y + Z̅).(X̅ + Y̅ + Z).(X̅ + Y̅ + Z̅)
58. Following is the K-map of a Boolean function of five variables P, Q, R, S and X. The
minimum sum-of-product (SOP) expression for the function is

PQ PQ
RS 00 01 11 10 RS 00 01 11 10

0 0 0 00 1 1 0
0 0
01 1 0 0 1 01 0 0 0 0
1 11 0
0 0 1 0 0 0
11
0 0
10 0 0 0 10 1 1 0

X=0 X=1

a. P̅Q̅SX̅ + PQ̅SX̅ + QR̅S̅X + QRS̅X b. Q̅SX̅ + QS̅X

 c. Q̅SX + QS̅X̅ d. Q̅S + QS̅
59. Which one of the following gives the simplified sum of products expression for the
Boolean function F = m0 + m2 + m3 + m5, where m0, m2, m3 and m5 are minterms
corresponding to the inputs A, B and C with A as the MSB and C as the LSB?
a. A̅B + A̅B̅C̅ + AB̅C b. A̅C̅ + A̅B + AB̅C
c. A̅C̅ + AB̅ + AB̅C d. A̅BC + A̅C̅ + AB̅C
60. According to one of the theorems of Boolean algebra, a NAND gate is equivalent to a
bubbled OR gate and a NOR gate is equivalent to a bubbled AND gate. Name the
theorem.
a. Involution theorem b. Absorption law
c. Complementation theorem d. De Morgan’s theorem
61. Output of logic gates in a combinational circuit depends on
a. Number of inputs b. logic levels of input
c. used feedback d. none of these
62. A logic gate is an electronic circuit which
a. Makes logic decisions
b. Allows electron flow only in one direction
c. Works on binary algebra
d. Alternates between 0 and 1 values
63. In positive logic, logic state 1 corresponds to
a. Positive voltage b. higher voltage level
c. zero voltage d. lower voltage level
64. In negative logic, the logic state 1 corresponds to
a. Negative voltage b. zero voltage
c. more negative voltage d. lower voltage level
65. An AND gate is a ………. Circuit.
a. analog b. memory
c. sequential d. combinational
66. A combination of AND function and NOT function results in
a. OR gate b. EX-OR gate
c. NAND gate d. NOR gate
67. Which gate is formed by adding an inverter at the output of an OR gate?
b. NOR b. XOR
 c. NOT d. NAND
68. Which of the following gates would have output 1, when one input is 1 and the other
input is 0?
a. OR b. AND
c. NAND d. Both (a) and (c)
69. The basic universal gate is integrated circuit electronics is ………. Gate.
a. OR b. NAND
c. AND d. NOR
70. What is the minimum number of NAND gates needed to perform the logic function AB?
a. 2 b. 3
c. 4 d. 5
71. An AND gate
a. Implements logic addition b. is equivalent to a series switching circuit
c. is an any-or-all gate d. is equivalent to a parallel switching circuit
72. The only function of a NOT gate is to
a. Stop a signal b. recomplement a signal
c. invert an input signal d. act as a universal gate
73. The output of a 2-input OR gate is zero only when its
a. Both inputs are 0 b. either input is 1
c. both inputs are 1 d. either input is 0
74. An XOR gate produces an output only when its two inputs are
a. high b. low
c. different d. same
75. A NOR gate is ON only when all its inputs are
a. ON b. positive
c. high d. OFF
76. For getting an output from an XNOR gate, its both inputs must be
a. high b. low
c. at the same logic level d. at the opposite logic level
77. In a certain 2-input logic gate, when A = 0, B = 0, then C = 1. It must be ……. gate
b. XOR b. AND
 c. NAND d. NOR
78. The first person who used Boolean algebra for the design of relay switching circuits was
a. Aristotle b. Boole
c. Shannon d. Ramanujam
79. Boolean algebra is essentially based on
a. symbols b. logic
c. truth d. numbers
80. Different variables used in Boolean algebra can have values of
a. 0 or 1 b. low or high
c. true or false d. ON or OFF
81. According to the algebra of logic, (A + A̅) equals
a. A b. 1
c. 0 d. AA
82. According to the Absorptive Laws of Boolean algebra, expression (A + AB) equals
a. A b. B
c. AB d. A̅
83. When we demorganize A̅ B̅, we get
a. A B b. A+ B
´B
c. A+ d. A+ B
84. The dual of the statement (A + 1) = 1 is
a. A.1 = A b. A.0 = 0
c. A + A = A d. A.A = 1
85. The expansion ABC can be simplified to
a. A̅ . B̅ . C̅ b. AB + BC + CA
c. AB + C̅ d. A̅ + B̅ + C̅
86. Saturated logic circuit have inherently
a. Short saturation delay time b. low switching speed
c. higher power dissipation d. lower noise immunity
87. Special feature of I2L logic circuit is that it
a. Uses only high-value resistors b. dissipates negligible power
 c. is a bipolar saturated logic d. is easy to fabricate
88. A+ B = Y is the Boolean expression for
b. AND gate b. NAND gate
c. NOR gate d. EX-OR gate
89. How many inputs can be supplied to a logic gate with a fan in factor of four?
a. two b. three
c. four d. eight
90. The “bubble” or small circle, on the output of the NAND gate and NOR gate represents
a. addition b. subtraction
c. product d. complementation
91. A combination of AND function and NOT function results in
a. OR gate b. inversion
c. NAND gate d. NOR gate
92. Three Boolean operators are
a. OR, NOT, AND b. OR, NOR, NAND
c. NOT, NOR, NAND d. none of the above
93. Which logic function has the output low only when both inputs are high?
a. OR b. NOR
c. NAND d. all of the above
94. Which logic gate is similar to the function of two series switches?
a. AND b. OR
c. NAND d. all of the above
95. The output of a logic gate is ‘1’ when its all input are at logic ‘0’, the gate is either
a. a NAND or an Ex-OR gate b. a NOR or an Ex-OR gate
c. an AND or an Ex-NOR gate d. a NOR or an Ex-NOR gate
96. AB = Y is the Boolean expression for
a. OR gate b. NOR gate
c. NAND gate d. Ex-OR gate
97. Output of which of the following gates is ‘0’ only if atleast one of its input is ‘1’?
a. NOR gate b. NAND gate
 c. EX-OR gate d. AND gate

98. A NOT gate has

a. Two inputs and one output b. one input and one output
c. one input and two output d. None of the above
99. Which of the following does not represent Boolean algebra operation?
a. NAND b. NOR
c. AND d. OR
100. Which of the following is not functionally a complete set?
a. NOR b. NAND
c. AND, OR d. AND, OR, NOT
101. ………. Gate represents the complimentary function.
a. NOR b. NAND
c. NOT d. None of these
102. NAND gates can be used as ………. Gates only.
a. NOT b. OR
c. AND d. All of these
103. A NOR gate can be constructed from
a. OR gate and NOT gate b. NAND gate
c. AND gate and NOT gate d. All of these
104. An OR gate has
a. Two inputs and one output b. one input and one output
c. one input and two output d. None of the above
105. Which of the following sets represent a universal logic family?
a. NAND b. XOR
c. AND d. NOT
106. What is the output state of an OR gate if the inputs are 0 and 1?
a. 0 b. 1
c. 2 d. 3