Professional Documents
Culture Documents
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) 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) 𝑌 = 𝐴𝐷 + 𝐴𝐵𝐶 + 𝐴𝐵 𝐷
(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) 𝑋𝑍
202. Boolean expression for the output of logic circuit given below is