Unit I: Introduction to Digital Electronics & Number Systems

1. What is the primary advantage of digital signals over analog signals?

 A) Less bandwidth usage

 B) Easier to process and store

 C) Higher data rate

 D) Greater compatibility with older systems

Solution:
Answer: B) Easier to process and store
Explanation: Digital signals are easier to process, store, and transmit without significant loss
of quality, making them advantageous over analog signals.

2. Which number system is base-8?

 A) Binary

 B) Decimal

 C) Octal

 D) Hexadecimal
Solution:
Answer: C) Octal
Explanation: Octal is a base-8 number system, using digits 0-7.

3. What is the binary equivalent of decimal 25?

 A) 11010

 B) 10101

 C) 11001

 D) 10011
Solution:
Answer: C) 11001
Explanation: Decimal 25 is equivalent to binary 11001. This is calculated by successive
division by 2.

4. Convert the hexadecimal number "3F" to binary.

 A) 00111111

 B) 110011

 C) 111101
  D) 111111
Solution:
Answer: A) 00111111
Explanation: Hexadecimal '3F' can be converted to binary by converting '3' (0011) and 'F'
(1111) individually.

5. What is the result of binary addition: 1011 + 1101?

 A) 11000

 B) 10100

 C) 10000

 D) 10010
Solution:
Answer: A) 11000
Explanation: Binary addition follows the same principles as decimal addition, and the sum of
1011 and 1101 results in 11000.

6. Which of the following is used in the 1's complement method of binary subtraction?

 A) Adding binary numbers directly

 B) Taking the complement of the subtrahend

 C) XOR operation

 D) NAND operation
Solution:
Answer: B) Taking the complement of the subtrahend
Explanation: In the 1's complement method, the subtrahend is complemented, and then the
numbers are added.

Unit II: Codes & Parity

7. The BCD (Binary Coded Decimal) code for the decimal number "9" is:

 A) 1001

 B) 1111

 C) 1010

 D) 0110
Solution:
Answer: A) 1001
Explanation: In BCD, each decimal digit is represented by its binary equivalent. For 9, the
binary representation is 1001.
8. Which of the following is a weighted code?

 A) Gray Code

 B) ASCII

 C) BCD

 D) Excess-3
Solution:
Answer: C) BCD
Explanation: BCD is a weighted code because the position of each bit has a fixed weight (1,
2, 4, 8).

9. How many parity bits are required to detect a single-bit error in a 7-bit message using Hamming
Code?

 A) 2

 B) 3

 C) 4

 D) 5
Solution:
Answer: B) 3
Explanation: Hamming code requires a certain number of parity bits to detect and correct
errors. For a 7-bit message, 3 parity bits are needed.

10. Which of the following is an example of an alpha-numeric code?

 A) Excess-3

 B) ASCII

 C) BCD

 D) Gray Code
Solution:
Answer: B) ASCII
Explanation: ASCII is an alpha-numeric code used to represent characters (letters, numbers,
and symbols).

11. Which code is used to detect errors in data transmission?

 A) ASCII

 B) Parity bit

 C) EBCDIC
  D) Unicode
Solution:
Answer: B) Parity bit
Explanation: A parity bit is used to detect errors in digital data transmission by adding a bit
to maintain even or odd parity.

Unit III: Logic Gates & Boolean Algebra

12. Which gate is considered a universal gate?

 A) AND

 B) OR

 C) NAND

 D) XOR
Solution:
Answer: C) NAND
Explanation: The NAND gate is considered a universal gate because it can be used to create
any other logic gate.

13. What is the output of a NOR gate if both inputs are 1?

 A) 0

 B) 1

 C) Undefined

 D) Depends on the input

Solution:
Answer: A) 0
Explanation: The output of a NOR gate is 1 only if both inputs are 0. If both inputs are 1, the
output is 0.

14. Which of the following is an identity in Boolean Algebra?

 A) A + 0 = A

 B) A + 1 = A

 C) A + A' = A

 D) A * 1 = 0
Solution:
Answer: A) A + 0 = A
Explanation: According to Boolean algebra rules, adding 0 to a variable results in the variable
itself.
15. Which of the following expressions represents De Morgan's Theorem?

 A) A + B = A'B'

 B) (AB)' = A' + B'

 C) (A + B)' = A + B

 D) A * B = A + B
Solution:
Answer: B) (AB)' = A' + B'
Explanation: De Morgan's Theorem states that the complement of a product is equal to the
sum of the complements, and vice versa.

16. How many cells are there in a 3-variable Karnaugh map (K-map)?

 A) 4

 B) 6

 C) 8

 D) 16
Solution:
Answer: C) 8
Explanation: A K-map for three variables (A, B, C) has 2^3 = 8 cells.

17. What is the minimal SOP (Sum of Products) expression for the Boolean function F(A, B) = AB +
A'B?

 A) A + B

 B) A XOR B

 C) AB + A'B'

 D) A' + B'
Solution:
Answer: B) A XOR B
Explanation: The function AB + A'B represents an XOR gate, which outputs true when the
inputs differ.

18. In a K-map, how are adjacent cells related?

 A) They differ by two variables

 B) They differ by one variable

 C) They are always equal

 D) They have the same variables

Solution:
 Answer: B) They differ by one variable
Explanation: Adjacent cells in a K-map represent minterms that differ by only one variable.

Unit I: Introduction to Digital Electronics & Number Systems

19. What is the 2's complement of the binary number 10110?

 A) 11010

 B) 01010

 C) 01110

 D) 10010
Solution:
Answer: D) 10010
Explanation: To find the 2's complement, first invert the digits (01001) and then add 1,
resulting in 10010.

20. The binary equivalent of the octal number 67 is:

 A) 110111

 B) 111001

 C) 101111

 D) 110110
Solution:
Answer: A) 110111
Explanation: Octal 6 is 110 in binary, and octal 7 is 111, so octal 67 is binary 110111.

21. What is the decimal equivalent of the binary number 1101?

 A) 11

 B) 12

 C) 13

 D) 14
Solution:
Answer: C) 13
Explanation: 1101 in binary is equal to 1×23+1×22+0×21+1×20=8+4+0+1=131 \times 2^3 +
1 \times 2^2 + 0 \times 2^1 + 1 \times 2^0 = 8 + 4 + 0 + 1 =
131×23+1×22+0×21+1×20=8+4+0+1=13.

22. Which method is used to represent negative numbers in binary?

 A) Sign-magnitude
  B) 2's complement

 C) 1's complement

 D) All of the above

Solution:
Answer: D) All of the above
Explanation: Negative numbers can be represented using the sign-magnitude method, 1's
complement, or 2's complement.

23. In floating-point representation, what is the part called that represents the position of the
decimal point?

 A) Mantissa

 B) Exponent

 C) Fraction

 D) Base
Solution:
Answer: B) Exponent
Explanation: In floating-point representation, the exponent shifts the decimal point to its
correct position.

24. Convert the decimal number 156 to hexadecimal.

 A) 9B

 B) 8C

 C) 9C

 D) 97
Solution:
Answer: C) 9C
Explanation: Decimal 156 is equivalent to hexadecimal 9C (156 ÷ 16 = 9 remainder 12, where
12 is C in hexadecimal).

Unit II: Codes & Parity

25. Which of the following is a non-weighted code?

 A) Excess-3

 B) BCD

 C) Gray Code

 D) Decimal
Solution:
 Answer: C) Gray Code
Explanation: Gray code is a non-weighted code, as each digit does not have a fixed positional
value.

26. What is the Hamming distance between the binary numbers 101010 and 111110?

 A) 1

 B) 2

 C) 3

 D) 4
Solution:
Answer: C) 3
Explanation: The Hamming distance is the number of positions at which the corresponding
bits differ. In this case, 3 bits are different (positions 2, 4, and 5).

27. Which parity bit will make the number 101110 have even parity?

 A) 0

 B) 1

 C) 2

 D) None
Solution:
Answer: A) 0
Explanation: The binary number 101110 has four 1's, which is even. Therefore, no parity bit
is needed to make it even; adding 0 maintains even parity.

28. ASCII code uses how many bits to represent each character?

 A) 7

 B) 8

 C) 16

 D) 32
Solution:
Answer: A) 7
Explanation: ASCII uses 7 bits to represent each character, though it is often stored in 8-bit
bytes with an extra bit for parity or as padding.

29. In Unicode, how many bits are used to represent each character?

 A) 7
  B) 8

 C) 16

 D) 32
Solution:
Answer: C) 16
Explanation: Unicode uses 16 bits to represent each character, allowing it to represent a
wide range of characters beyond ASCII.

30. What is the purpose of the parity bit in data transmission?

 A) To increase speed

 B) To increase storage capacity

 C) To detect errors

 D) To compress data
Solution:
Answer: C) To detect errors
Explanation: A parity bit is used to detect errors by ensuring that the total number of 1's in
the data is either even or odd.

Unit III: Logic Gates & Boolean Algebra

31. What is the output of an XOR gate if both inputs are 1?

 A) 0

 B) 1

 C) Undefined

 D) Depends on the input

Solution:
Answer: A) 0
Explanation: An XOR gate outputs 1 only if the inputs differ; if both inputs are 1, the output
is 0.

32. The Boolean expression for an AND gate is:

 A) A + B

 B) A * B

 C) A XOR B

 D) A' + B'
Solution:
Answer: B) A * B
 Explanation: The Boolean expression for an AND gate is A * B, representing the logical AND
operation.

33. Which of the following is a correct representation of De Morgan's Theorem?

 A) A + B = A'B'

 B) (A + B)' = A' + B'

 C) AB' = A + B

 D) (AB)' = A + B
Solution:
Answer: B) (A + B)' = A' + B'
Explanation: De Morgan's Theorem shows the complement of a sum is the product of
complements.

34. What is the minimal SOP (Sum of Products) expression for the Boolean function F(A, B, C) =
ABC + A'B'C + AB'C'?

 A) AB + AC

 B) A'B + BC'

 C) AB + BC

 D) A XOR B XOR C
Solution:
Answer: A) AB + AC
Explanation: Simplifying the function using Boolean algebra results in the minimal
expression AB + AC.

35. How many variables are involved in a 4-variable Karnaugh map (K-map)?

 A) 2

 B) 3

 C) 4

 D) 5
Solution:
Answer: C) 4
Explanation: A 4-variable K-map includes four variables and contains 16 cells (2^4 = 16).

36. What is the purpose of using a Karnaugh map (K-map)?

 A) To implement circuits

 B) To simplify Boolean expressions

  C) To calculate binary numbers

 D) To detect errors in codes

Solution:
Answer: B) To simplify Boolean expressions
Explanation: A K-map is used to simplify Boolean expressions by visually grouping adjacent
cells that differ by one variable.

37. What is the result of simplifying the Boolean expression A + A'B?

 A) A + B

 B) A

 C) B

 D) A'
Solution:
Answer: A) A + B
Explanation: Simplifying using Boolean identities gives the result A + B.

38. In Boolean algebra, the operation A+A′A + A'A+A′ results in:

 A) A

 B) 0

 C) 1

 D) A'
Solution:
Answer: C) 1
Explanation: A+A′A + A'A+A′ is always equal to 1, according to Boolean algebra rules.

39. Which of the following gates is represented by the Boolean expression A ′B ′+ABA'B' + ABA ′B ′
+AB?

 A) AND

 B) OR

 C) XOR

 D) XNOR
Solution:
Answer: D) XNOR
Explanation: The Boolean expression A′B′+ABA'B' + ABA′B′+AB represents an XNOR gate,
which outputs 1 when both inputs are equal.
40. How many possible outputs can a 3-input logic gate produce?

 A) 2

 B) 4

 C) 8

 D) 16
Solution:
Answer: C) 8
Explanation: A 3-input logic gate can produce 23=82^3 = 823=8 different output
combinations, as each input can be either 0 or 1.

These are an additional 22 questions, taking the total to

4o

You said:

i want 100 mcqs

ChatGPT said:

ChatGPT

I will continue from the previous questions, covering Unit I, Unit II, and Unit III topics in full to reach
a total of 100 MCQs with answers and solutions.

Unit I: Introduction to Digital Electronics & Number Systems (Continued)

41. What is the binary equivalent of the decimal number 45?

 A) 101010

 B) 110101

 C) 100101

 D) 101101
Solution:
Answer: D) 101101
Explanation: Convert decimal 45 to binary by dividing by 2 and writing remainders: 45 =
101101.

42. In the 2’s complement method, what is the 2’s complement of 1001?

 A) 0110

 B) 1101

 C) 0111
  D) 1001
Solution:
Answer: C) 0111
Explanation: To find the 2’s complement, first take the 1's complement (invert digits), and
then add 1, resulting in 0111.

43. What is the hexadecimal equivalent of binary 11110010?

 A) F2

 B) E2

 C) F3

 D) E3
Solution:
Answer: A) F2
Explanation: Convert each 4-bit block: 1111 = F, 0010 = 2. Thus, 11110010 = F2.

44. What is the sum of 1010 and 1101 in binary?

 A) 10111

 B) 10011

 C) 11111

 D) 11011
Solution:
Answer: B) 10011
Explanation: Add 1010 and 1101: 1010 + 1101 = 10011 (with a carry).

45. What is the decimal equivalent of the hexadecimal number "1A"?

 A) 16

 B) 18

 C) 26

 D) 24
Solution:
Answer: C) 26
Explanation: Hexadecimal "1A" = 1×16+A(10)=26 1 \times 16 + A(10) = 261×16+A(10)=26.

46. Which of the following number systems is NOT positional?

 A) Decimal

 B) Binary
  C) Roman Numerals

 D) Hexadecimal
Solution:
Answer: C) Roman Numerals
Explanation: Roman numerals are non-positional, meaning the value of a symbol doesn’t
depend on its position.

47. Which of the following is NOT a valid binary number?

 A) 1011

 B) 10002

 C) 11010

 D) 1111
Solution:
Answer: B) 10002
Explanation: The number 10002 contains a digit (2) that is not valid in the binary number
system, which only uses 0s and 1s.

48. In 1’s complement subtraction, what do you add to the subtrahend?

 A) Its binary inverse

 B) Its 2’s complement

 C) 1

 D) Its 1’s complement

Solution:
Answer: D) Its 1’s complement
Explanation: In 1’s complement subtraction, you add the 1’s complement of the subtrahend
and check for any carry.

49. What is the octal equivalent of the binary number 111100?

 A) 74

 B) 76

 C) 77

 D) 75
Solution:
Answer: A) 74
Explanation: Convert binary to octal by grouping bits: 111100 = 111 (7) 100 (4), so 74 in
octal.
50. What is the result of multiplying binary numbers 101 and 110?

 A) 11110

 B) 10010

 C) 111000

 D) 11010
Solution:
Answer: A) 11110
Explanation: Perform binary multiplication: 101 * 110 = 11110.

Unit II: Codes & Parity (Continued)

51. In BCD (Binary Coded Decimal), how is the decimal number 7 represented?

 A) 0001

 B) 0011

 C) 0111

 D) 1001
Solution:
Answer: C) 0111
Explanation: In BCD, decimal 7 is represented as 0111.

52. Which of the following codes is self-complementary?

 A) BCD

 B) Excess-3

 C) Gray Code

 D) ASCII
Solution:
Answer: B) Excess-3
Explanation: Excess-3 is self-complementary because it is derived from adding 3 to the BCD
representation of a number.

53. In the Hamming Code, how is a single-bit error detected?

 A) Using parity bits

 B) Using redundant data

 C) By recalculating the data

 D) By comparing multiple copies of data

Solution:
 Answer: A) Using parity bits
Explanation: Hamming codes use multiple parity bits to detect and correct single-bit errors.

54. How many bits are used in the ASCII code to represent each character?

 A) 6

 B) 7

 C) 8

 D) 9
Solution:
Answer: B) 7
Explanation: ASCII uses 7 bits to represent each character, although it is often extended to 8
bits for storage purposes.

55. What is the binary equivalent of the BCD number 1010 0001?

 A) 1101

 B) 1011

 C) 11001

 D) 10100001
Solution:
Answer: D) 10100001
Explanation: The binary equivalent of BCD 1010 0001 is the same as the given number.

56. Which of the following is a non-weighted code?

 A) BCD

 B) Excess-3

 C) Gray Code

 D) ASCII
Solution:
Answer: C) Gray Code
Explanation: Gray code is a non-weighted code since its values are not based on positional
weights.

57. In even parity, which of the following binary numbers would have an even parity bit?

 A) 1101

 B) 1010
  C) 1111

 D) 0101
Solution:
Answer: B) 1010
Explanation: The binary number 1010 has an even number of 1’s, so its parity bit would
ensure even parity.

58. What does EBCDIC stand for?

 A) Extended Binary Coded Decimal Interchange Code

 B) Electronic Binary Coded Digital Information Code

 C) Enhanced Binary Code for Decimal Information Code

 D) Extended Binary Code for Digital Information Conversion

Solution:
Answer: A) Extended Binary Coded Decimal Interchange Code
Explanation: EBCDIC stands for Extended Binary Coded Decimal Interchange Code, a
character encoding system used mainly on IBM mainframes.

59. What is the minimum Hamming distance for a code to detect 2-bit errors?

 A) 1

 B) 2

 C) 3

 D) 4
Solution:
Answer: D) 4
Explanation: A minimum Hamming distance of 4 is required to detect and correct 2-bit
errors.

60. Which code is primarily used to represent alphabets and special characters in computing?

 A) Gray Code

 B) Excess-3

 C) ASCII

 D) BCD
Solution:
Answer: C) ASCII
Explanation: ASCII is a widely used code for representing alphabets, numbers, and special
characters in computers.
Unit III: Logic Gates & Boolean Algebra (Continued)

61. Which gate will have a high output when any one of its inputs is high?

 A) AND

 B) OR

 C) NAND

 D) NOR
Solution:
Answer: B) OR
Explanation: The OR gate outputs 1 when any of its inputs is 1.

62. What is the Boolean equation for a NOR gate?

 A) A + B = 1

 B) (A + B)' = Q

 C) (A + B)' = A'B'

 D) A * B = 1
Solution:
Answer: B) (A + B)' = Q
Explanation: A NOR gate’s Boolean equation is the complement of the OR operation:
Q=(A+B)′Q = (A + B)'Q=(A+B)′.

63. If A = 1, B = 0, what is the output of A⋅BA \cdot BA⋅B?

 A) 0

 B) 1

 C) Undefined

 D) None
Solution:
Answer: A) 0
Explanation: The AND operation requires both inputs to be 1 to produce a 1; otherwise, the
output is 0.

64. Which gate is known as the universal gate?

 A) AND

 B) OR

 C) NAND
  D) XOR
Solution:
Answer: C) NAND
Explanation: NAND is a universal gate because it can be used to implement any Boolean
function, including all basic gates.

65. What is the minimum number of NAND gates required to make an OR gate?

 A) 2

 B) 3

 C) 4

 D) 5
Solution:
Answer: B) 3
Explanation: Using De Morgan's Theorem, an OR gate can be made with 3 NAND gates.

66. What is the value of A⋅A′A \cdot A'A⋅A′?

 A) 0

 B) 1

 C) A

 D) A'
Solution:
Answer: A) 0
Explanation: According to Boolean algebra, A⋅A′A \cdot A'A⋅A′ is always 0.

67. Simplify the Boolean expression AB+A′BAB + A'BAB+A′B.

 A) B

 B) A

 C) 1

 D) 0
Solution:
Answer: A) B
Explanation: Using Boolean algebra, the expression simplifies to B.

**68. Which gate has the truth table shown below?

ABY

0 01

0 10

1 00

1 10

 A) NOR

 B) NAND

 C) OR

 D) AND
Solution:
Answer: A) NOR
Explanation: This truth table represents a NOR gate, where the output is only 1 if both inputs
are 0.

69. What is the complement of A+BA + BA+B?

 A) A'B'

 B) A' + B'

 C) AB

 D) None
Solution:
Answer: A) A'B'
Explanation: The complement of A+BA + BA+B is A′B′A'B'A′B′, according to De Morgan's law.

70. What does the symbol ⋅\cdot⋅ represent in Boolean algebra?

 A) OR

 B) AND

 C) NOT

 D) XOR
Solution:

Explanation: In Boolean algebra, ⋅\cdot⋅ represents the AND operation.

Answer: B) AND

Additional Questions to Reach 100

71. Which Boolean law states that A+0=AA + 0 = AA+0=A?

 A) Identity Law

 B) Null Law

 C) Idempotent Law

 D) Complement Law
Solution:
Answer: A) Identity Law
Explanation: The Identity Law states that adding 0 to any variable leaves the variable
unchanged.

72. Which of the following combinations is a valid representation of the De Morgan's theorem?

 A) (AB)′=A′+B′(AB)' = A' + B'(AB)′=A′+B′

 B) (A+B)′=A+B(A + B)' = A + B(A+B)′=A+B

 C) A′B′=(A+B)′A'B' = (A + B)'A′B′=(A+B)′

 D) None of the above

Solution:
Answer: A) (AB)′=A′+B′(AB)' = A' + B'(AB)′=A′+B′
Explanation: According to De Morgan's law, the complement of a product is the sum of the
complements.

73. How many cells are there in a Karnaugh map (K-map) for a 3-variable function?

 A) 6

 B) 8

 C) 4

 D) 16
Solution:
Answer: B) 8
Explanation: A 3-variable K-map has 23=82^3 = 823=8 cells.

74. In a K-map, adjacent cells differ by how many bits?

 A) 1

 B) 2

 C) 3

 D) 4
Solution:
 Answer: A) 1
Explanation: Adjacent cells in a K-map differ by only 1 bit.

75. Simplify the Boolean expression A⋅1A \cdot 1A⋅1.

 A) 1

 B) 0

 C) A

 D) None
Solution:
Answer: C) A
Explanation: The result of multiplying any variable by 1 is the variable itself.

76. What is the output of an XNOR gate if both inputs are 1?

 A) 0

 B) 1

 C) Undefined

 D) None
Solution:
Answer: B) 1
Explanation: An XNOR gate outputs 1 when both inputs are the same.

77. What is the function of an XOR gate?

 A) It outputs 1 only when inputs are different.

 B) It outputs 1 only when inputs are the same.

 C) It always outputs 1.

 D) It always outputs 0.
Solution:
Answer: A) It outputs 1 only when inputs are different.
Explanation: The XOR gate outputs 1 when the inputs are different from each other.

78. What is the result of applying De Morgan's Theorem to A⋅BA \cdot BA⋅B?

 A) A′+B′A' + B'A′+B′

 B) (A′+B′)(A' + B')(A′+B′)

 C) (A⋅B)′(A \cdot B)'(A⋅B)′

  D) A⋅B′A \cdot B'A⋅B′
Solution:
Answer: A) A′+B′A' + B'A′+B′
Explanation: Applying De Morgan's Theorem to A⋅BA \cdot BA⋅B gives A′+B′A' + B'A′+B′.

79. A logic circuit that performs the addition of two bits is called:

 A) Full Adder

 B) Half Adder

 C) Multiplier

 D) Decoder
Solution:
Answer: B) Half Adder
Explanation: A half adder is a logic circuit that adds two single-bit binary numbers.

80. How many inputs does a full adder have?

 A) 2

 B) 3

 C) 4

 D) 1
Solution:
Answer: B) 3
Explanation: A full adder has three inputs: two data inputs and a carry input.

81. In a full adder, what is the output when both data inputs and the carry input are 1?

 A) 0

 B) 1

 C) 2

 D) 3
Solution:
Answer: B) 1
Explanation: In a full adder, the sum output is 1 and the carry output is 1 when both inputs
and carry are 1.

82. What is the output of an AND gate if both inputs are 0?

 A) 1

 B) 0
  C) Undefined

 D) None
Solution:
Answer: B) 0
Explanation: The AND gate outputs 1 only if both inputs are 1; otherwise, it outputs 0.

83. How many rows would a truth table have for a 4-input gate?

 A) 4

 B) 8

 C) 16

 D) 32
Solution:
Answer: C) 16
Explanation: A truth table for a 4-input gate would have 24=162^4 = 1624=16 rows.

84. How many OR gates are required to implement the Boolean function A+B+CA + B + CA+B+C?

 A) 1

 B) 2

 C) 3

 D) 4
Solution:
Answer: B) 2
Explanation: Two OR gates are required: one to OR A and B, and another to OR the result
with C.

85. What is the minimal form of the Boolean expression AB+A′CAB + A'CAB+A′C?

 A) B

 B) A

 C) A + C

 D) None
Solution:
Answer: D) None
Explanation: AB+A′CAB + A'CAB+A′C cannot be simplified further and is already in its
minimal form.

86. What does the OR operation in Boolean algebra signify?

  A) Multiplication

 B) Addition

 C) Subtraction

 D) Division
Solution:
Answer: B) Addition
Explanation: The OR operation in Boolean algebra is equivalent to addition.

87. Simplify the Boolean expression A⋅A′BA \cdot A'BA⋅A′B.

 A) A

 B) B

 C) 0

 D) None
Solution:

Explanation: A⋅A′=0A \cdot A' = 0A⋅A′=0, so A⋅A′B=0A \cdot A'B = 0A⋅A′B=0.

Answer: C) 0

88. Which Boolean law is represented by A+A=AA + A = AA+A=A?

 A) Idempotent Law

 B) Identity Law

 C) Null Law

 D) Distributive Law
Solution:
Answer: A) Idempotent Law
Explanation: The Idempotent Law states that a variable ORed with itself is equal to the
variable.

89. In Boolean algebra, what does the symbol +++ represent?

 A) OR

 B) AND

 C) NOT

 D) XOR
Solution:
Answer: A) OR
Explanation: In Boolean algebra, +++ represents the OR operation.
90. Which Boolean law is expressed as A+1=1A + 1 = 1A+1=1?

 A) Null Law

 B) Identity Law

 C) Complement Law

 D) Idempotent Law
Solution:
Answer: A) Null Law
Explanation: The Null Law states that a variable ORed with 1 is always 1.

91. What is the truth table of an AND gate if both inputs are 1?

 A) 1

 B) 0

 C) Undefined

 D) None
Solution:
Answer: A) 1
Explanation: The AND gate outputs 1 when both inputs are 1.

92. What is the Boolean equation for a NAND gate?

 A) (A+B)′=Y(A + B)' = Y(A+B)′=Y

 B) (A⋅B)′=Y(A \cdot B)' = Y(A⋅B)′=Y

 C) A⋅B=YA \cdot B = YA⋅B=Y

 D) A′+B′=YA' + B' = YA′+B′=Y

Solution:
Answer: B) (A⋅B)′=Y(A \cdot B)' = Y(A⋅B)′=Y
Explanation: The Boolean equation for a NAND gate is (A⋅B)′(A \cdot B)'(A⋅B)′.

93. What is the output of an OR gate if one input is 0 and the other input is 1?

 A) 0

 B) 1

 C) Undefined

 D) None
Solution:
Answer: B) 1
Explanation: The OR gate outputs 1 if at least one input is 1.
94. Which of the following is NOT a basic logic gate?

 A) AND

 B) XOR

 C) OR

 D) NOR
Solution:
Answer: B) XOR
Explanation: XOR is not a basic logic gate; it is derived from the basic gates.

**95. Which logic gate has the truth table shown below?

ABY

0 00

0 11

1 01

1 10

 A) XOR

 B) AND

 C) NOR

 D) OR
Solution:
Answer: A) XOR
Explanation: This truth table represents the XOR gate, which outputs 1 when the inputs are
different.

96. How many NOT gates are required to implement the Boolean function A′BA'BA′B?

 A) 1

 B) 2

 C) 3

 D) 4
Solution:
Answer: A) 1
Explanation: One NOT gate is required to complement AAA, and then an AND gate is used to
combine with BBB.
97. In Boolean algebra, which operation is used to represent the negation of a variable?

 A) OR

 B) AND

 C) NOT

 D) XOR
Solution:
Answer: C) NOT
Explanation: The NOT operation represents negation (inversion) in Boolean algebra.

98. Which Boolean law is represented by A⋅A=AA \cdot A = AA⋅A=A?

 A) Idempotent Law

 B) Identity Law

 C) Null Law

 D) Complement Law
Solution:
Answer: A) Idempotent Law
Explanation: The Idempotent Law states that a variable ANDed with itself is equal to the
variable.

99. How many output states does a 2-input NOR gate have?

 A) 1

 B) 2

 C) 3

 D) 4
Solution:
Answer: B) 2
Explanation: A 2-input NOR gate has two possible output states: 0 and 1.

100. Which of the following logic gates will output a 1 when both inputs are 0?

 A) OR

 B) NAND

 C) NOR

 D) AND
Solution:
Answer: C) NOR
Explanation: A NOR gate outputs 1 when both inputs are 0.