Boolean Algebra MCQs (201-300)

  1. The Idempotent Law states that:
    a) A + A = A
    b) A·A = 0
    c) A + 0 = 0
    d) A·1 = 1
    Answer: a) A + A = A

  2. The Complement Law states that:
    a) A + A’ = 1
    b) A + 1 = 0
    c) A·A’ = 1
    d) A·0 = A
    Answer: a) A + A’ = 1

  3. The Null Law of Boolean algebra states that:
    a) A + 0 = A
    b) A·0 = 0
    c) Both (a) and (b)
    d) A + 1 = A
    Answer: c) Both (a) and (b)

  4. The Identity Law states:
    a) A + 0 = A and A·1 = A
    b) A + 1 = 1 and A·0 = 0
    c) A + A’ = 1
    d) A·A’ = 0
    Answer: a) A + 0 = A and A·1 = A

  5. The Complementarity Law is represented as:
    a) A + A’ = 1 and A·A’ = 0
    b) A + 0 = 1
    c) A + A = A
    d) A·A = 1
    Answer: a) A + A’ = 1 and A·A’ = 0

  6. The Commutative Law of addition states:
    a) A + B = B + A
    b) A·B = B·A
    c) A + AB = A
    d) A + 1 = 1
    Answer: a) A + B = B + A

  7. The Associative Law of multiplication is:
    a) (A·B)·C = A·(B·C)
    b) A·(B + C) = AB + AC
    c) A + (B·C) = (A + B)(A + C)
    d) A·B + C = A + C·B
    Answer: a) (A·B)·C = A·(B·C)

  8. The Distributive Law is expressed as:
    a) A·(B + C) = A·B + A·C
    b) A + (B·C) = (A + B)(A + C)
    c) Both (a) and (b)
    d) None
    Answer: c) Both (a) and (b)

  9. The Absorption Law is:
    a) A + AB = A
    b) A(A + B) = A
    c) Both (a) and (b)
    d) None
    Answer: c) Both (a) and (b)

  10. The Involution Law states:
    a) (A’)’ = A
    b) A” = A’
    c) A + A = 1
    d) (A + B)’ = A’B’
    Answer: a) (A’)’ = A

  11. The Consensus Theorem is:
    a) AB + A’C + BC = AB + A’C
    b) AB + AC + A’B = AB + AC
    c) A + A’B = A + B
    d) AB’ + A’C + B’C = AB + C
    Answer: a) AB + A’C + BC = AB + A’C

  12. According to De Morgan’s first theorem:
    a) (A + B)’ = A’·B’
    b) (A·B)’ = A’ + B’
    c) (A + B)’ = A + B
    d) A’ + B’ = A + B
    Answer: a) (A + B)’ = A’·B’

  13. According to De Morgan’s second theorem:
    a) (A·B)’ = A’ + B’
    b) (A + B)’ = A’·B’
    c) (A·B)’ = A·B
    d) A + B’ = A·B’
    Answer: a) (A·B)’ = A’ + B’

  14. Which law is used to simplify A + AB’?
    a) Absorption
    b) Distributive
    c) De Morgan
    d) Complement
    Answer: a) Absorption

  15. Which theorem allows combining terms that differ in only one literal?
    a) Combining theorem
    b) Consensus theorem
    c) Adjacency theorem
    d) Shannon’s expansion
    Answer: a) Combining theorem

  16. According to Boolean algebra, A + A’B = ?
    a) A + B
    b) A’ + B
    c) A·B
    d) A
    Answer: a) A + B

  17. Simplify A + A’·B’:
    a) A + B’
    b) A’ + B
    c) A·B
    d) A’·B’
    Answer: a) A + B’

  18. Simplify (A + B)(A’ + B):
    a) B
    b) A
    c) A + B
    d) A·B
    Answer: a) B

  19. Simplify A’B + A·B:
    a) B
    b) A
    c) A + B
    d) AB
    Answer: a) B

  20. Simplify (A + B’)(A + C):
    a) A + B’C
    b) AB + AC
    c) A·B’
    d) B’ + C
    Answer: a) A + B’C

  1. Don’t-care conditions are included in a K-map to:
    a) Simplify expressions
    b) Create redundancy
    c) Increase complexity
    d) Remove essential terms
    Answer: a) Simplify expressions

  2. Don’t-care conditions are represented by:
    a) X
    b) D
    c) 2
    d) 9
    Answer: a) X

  3. In a K-map, a don’t-care can be treated as:
    a) 1 or 0 whichever simplifies
    b) Always 1
    c) Always 0
    d) Ignored
    Answer: a) 1 or 0 whichever simplifies

  4. If a don’t-care term helps form a larger group:
    a) Include it
    b) Exclude it
    c) Treat as 0
    d) Treat as undefined
    Answer: a) Include it

  5. Incomplete specifications in Boolean functions lead to:
    a) Don’t-care terms
    b) Redundant loops
    c) Complex expressions
    d) Constant outputs
    Answer: a) Don’t-care terms

  6. A K-map containing only don’t-cares simplifies to:
    a) 1
    b) 0
    c) Undefined
    d) X
    Answer: a) 1

  7. In SOP simplification, a don’t-care is combined with:
    a) 1-cells
    b) 0-cells
    c) Both
    d) None
    Answer: a) 1-cells

  8. In POS simplification, a don’t-care is combined with:
    a) 0-cells
    b) 1-cells
    c) Both
    d) None
    Answer: a) 0-cells

  9. A don’t-care term that is not grouped is treated as:
    a) 0
    b) 1
    c) Don’t influence output
    d) Removed
    Answer: a) 0

  10. Don’t-cares are especially useful in:
    a) Digital design with unused combinations
    b) Arithmetic circuits
    c) Full adders
    d) Shift registers
    Answer: a) Digital design with unused combinations

  1. Any Boolean function can be implemented using only:
    a) NAND or NOR gates
    b) AND or OR gates
    c) XOR gates
    d) NOT gates
    Answer: a) NAND or NOR gates

  2. NAND equivalent of AND gate is:
    a) (A·B)”
    b) (A + B)”
    c) (A + B)’
    d) (A·B)’
    Answer: a) (A·B)”

  3. NOR equivalent of OR gate is:
    a) (A + B)”
    b) (A·B)”
    c) (A·B)’
    d) (A + B)’
    Answer: a) (A + B)”

  4. NAND gate followed by a NOT gate gives:
    a) AND gate
    b) OR gate
    c) XOR gate
    d) NOR gate
    Answer: a) AND gate

  5. NOR gate followed by NOT gives:
    a) OR gate
    b) AND gate
    c) XOR gate
    d) XNOR gate
    Answer: a) OR gate

  6. Which of the following is NOT a universal gate?
    a) NOR
    b) NAND
    c) XOR
    d) None
    Answer: c) XOR

  7. The symbol of NAND gate is same as:
    a) AND with bubble on output
    b) OR with bubble on output
    c) AND with two inputs
    d) NOT followed by OR
    Answer: a) AND with bubble on output

  8. The symbol of NOR gate is same as:
    a) OR with bubble on output
    b) AND with bubble on output
    c) XOR
    d) NOT gate
    Answer: a) OR with bubble on output

  9. XOR function can be realized using:
    a) Four NAND gates
    b) Two NOR gates
    c) Three AND gates
    d) One OR gate
    Answer: a) Four NAND gates

  10. XNOR function can be realized using:
    a) Five NAND gates
    b) Four NOR gates
    c) XOR + NOT gate
    d) AND + OR gate
    Answer: c) XOR + NOT gate

  1. Simplify AB + A’C + BC:
    a) AB + A’C
    b) A + C
    c) A’C + B
    d) AB + C
    Answer: a) AB + A’C

  2. Simplify AB + A’C + A’B’:
    a) A’ + C
    b) A’ + B
    c) AB + A’C
    d) A + B’C
    Answer: a) A’ + C

  3. Simplify A’B’C + A’BC + AB’C + ABC:
    a) C
    b) A + B
    c) B + C
    d) A + C
    Answer: c) B + C

  4. Simplify AB + A’C + BC’:
    a) AB + A’C
    b) A’C + B
    c) A + C’
    d) A + C
    Answer: b) A’C + B

  5. Simplify (A + B)(A’ + B’)(A’ + C):
    a) AB’ + A’C
    b) A’ + BC
    c) A + B’C
    d) A’B’ + C
    Answer: a) AB’ + A’C

  6. Simplify (A + B)(A + B’)(A’ + C):
    a) AB + A’C
    b) A + BC
    c) A’ + B’C
    d) A’C + AB’
    Answer: b) A + BC

  7. Simplify (A + B)(A + C)(B + C):
    a) A + BC
    b) AB + AC
    c) A·B·C
    d) A’ + B’C
    Answer: a) A + BC

  8. Simplify A’B + A’B’C + AB’C:
    a) A’B + AB’C
    b) A’ + C
    c) B + C
    d) A + C
    Answer: a) A’B + AB’C

  9. Simplify AB’C’ + A’B + B’C:
    a) A’ + C
    b) B’ + C
    c) A + B’C
    d) A + B’
    Answer: c) A + B’C

  10. Simplify AB’C + A’B’C’ + AB’C’:
    a) A + B’
    b) B’C + A’
    c) A’ + C’
    d) A + C
    Answer: b) B’C + A’

    1. Each maxterm represents:
      a) A 0 output condition
      b) A 1 output condition
      c) A don’t-care
      d) A minterm
      Answer: a) A 0 output condition

    2. How many minterms are there for 3 variables?
      a) 6
      b) 8
      c) 4
      d) 2
      Answer: b) 8

    3. The canonical SOP form is obtained by:
      a) Writing the function as sum of all minterms where F = 1
      b) Writing the function as product of all maxterms where F = 1
      c) Writing the product of all variables
      d) Combining all don’t-cares
      Answer: a) Writing the function as sum of all minterms where F = 1

    4. The canonical POS form is obtained by:
      a) Product of all maxterms where F = 0
      b) Sum of all minterms where F = 1
      c) XOR of variables
      d) Product of all don’t-cares
      Answer: a) Product of all maxterms where F = 0

    5. The dual of (A + B)(A + C) is:
      a) A·(B + C)
      b) (A·B) + (A·C)
      c) (A + B + C)
      d) A·B·C
      Answer: b) (A·B) + (A·C)

    6. The dual of a Boolean expression is obtained by:
      a) Interchanging + and ·
      b) Interchanging 1 and 0
      c) Interchanging + with · and 1 with 0
      d) Complementing all variables
      Answer: c) Interchanging + with · and 1 with 0

    7. The complement of (A + B)(A + C) is:
      a) A’·B’ + A’·C’
      b) (A·B)’ + (A·C)’
      c) A’B’C’
      d) A’ + B’C’
      Answer: a) A’·B’ + A’·C’

    1. In a 3-variable K-map, the total number of cells is:
      a) 6
      b) 8
      c) 4
      d) 10
      Answer: b) 8

    2. The number of possible groupings of 2 adjacent 1’s in a 3-variable K-map is:
      a) 6
      b) 8
      c) 4
      d) 3
      Answer: c) 4

    3. A 4-variable K-map has how many cells?
      a) 8
      b) 12
      c) 16
      d) 32
      Answer: c) 16

    4. In K-map simplification, a group of 8 cells represents:
      a) 3 variables eliminated
      b) 2 variables eliminated
      c) 1 variable eliminated
      d) No simplification
      Answer: a) 3 variables eliminated

    5. Two adjacent 1s in K-map differ in:
      a) Only one variable
      b) Two variables
      c) Three variables
      d) Four variables
      Answer: a) Only one variable

    6. Grouping 1s in K-map results in:
      a) Simpler expressions
      b) More complex functions
      c) Redundant logic
      d) Extra minterms
      Answer: a) Simpler expressions

    7. In K-map simplification, larger groups lead to:
      a) More simplified expressions
      b) More variables
      c) Redundant terms
      d) Extra outputs
      Answer: a) More simplified expressions

    8. Overlapping groups in K-map are:
      a) Allowed and often necessary
      b) Not allowed
      c) Only used for POS
      d) Considered an error
      Answer: a) Allowed and often necessary

    9. A K-map grouping of 4 adjacent 1s represents:
      a) 2 variable term
      b) 3 variable term
      c) 1 variable term
      d) 4 variable term
      Answer: a) 2 variable term

    10. The number of adjacent cells for each cell in a 4-variable K-map is:
      a) 4
      b) 3
      c) 2
      d) 1
      Answer: a) 4

    1. A half adder can be built using:
      a) XOR and AND gates
      b) AND and OR gates
      c) NOR and NAND gates
      d) Two XOR gates
      Answer: a) XOR and AND gates

    2. The sum output of a half adder is:
      a) A XOR B
      b) A AND B
      c) A OR B
      d) A NOR B
      Answer: a) A XOR B

    3. The carry output of a half adder is:
      a) A·B
      b) A + B
      c) A XOR B
      d) A XNOR B
      Answer: a) A·B

    4. A full adder can be implemented using:
      a) Two half adders and one OR gate
      b) Two XOR gates
      c) One AND gate
      d) Two NOR gates
      Answer: a) Two half adders and one OR gate

    5. The Boolean expression for XOR is:
      a) A’B + AB’
      b) AB + A’B’
      c) A + B
      d) AB’
      Answer: a) A’B + AB’

    6. The Boolean expression for XNOR is:
      a) AB + A’B’
      b) A’B + AB’
      c) A + B’
      d) (A + B)’
      Answer: a) AB + A’B’

    7. The XOR gate gives a HIGH output when:
      a) Inputs are different
      b) Inputs are same
      c) One input is 0
      d) Both are 1
      Answer: a) Inputs are different

    8. The XNOR gate gives a HIGH output when:
      a) Inputs are same
      b) Inputs are different
      c) One input is 1
      d) One input is 0
      Answer: a) Inputs are same

    9. A logic circuit that detects equality is:
      a) XNOR gate
      b) XOR gate
      c) OR gate
      d) NAND gate
      Answer: a) XNOR gate

    10. A logic circuit that detects inequality is:
      a) XOR gate
      b) XNOR gate
      c) NOR gate
      d) AND gate
      Answer: a) XOR gate

    1. The output of (A + B)(A’ + C) simplifies to:
      a) AB + A’C
      b) AC + B
      c) B + C
      d) A + C
      Answer: a) AB + A’C

    2. Simplify AB + A’B’:
      a) A XNOR B
      b) A XOR B
      c) A + B
      d) A·B
      Answer: a) A XNOR B

    3. Simplify (A + B’)(A’ + B):
      a) A XOR B
      b) A XNOR B
      c) A + B
      d) A·B
      Answer: b) A XNOR B

    4. Simplify A’B + AB’:
      a) A XOR B
      b) A XNOR B
      c) A + B
      d) A·B
      Answer: a) A XOR B

    5. Simplify (A + B)(A’ + C’):
      a) AB + A’C’
      b) A + B
      c) A’ + C
      d) B + C’
      Answer: a) AB + A’C’

    6. Simplify (A + B)(A + B’)(A’ + C):
      a) A + BC
      b) A’ + C
      c) AB’ + A’C
      d) A + B
      Answer: c) AB’ + A’C

    7. Simplify (A + B)(A’ + B’)(A’ + C’):
      a) AB’ + A’C’
      b) A’ + BC
      c) A + C’
      d) A’ + B’C
      Answer: a) AB’ + A’C’

    8. Simplify A’B + AB + A’B’:
      a) B + A’
      b) A + B’
      c) A’ + B
      d) A + B
      Answer: a) B + A’

    9. Simplify (A’ + B’)(A + C):
      a) A’B’ + AC
      b) A’ + C
      c) A + B
      d) B + C
      Answer: a) A’B’ + AC

    10. Simplify A’B + A’C + BC:
      a) A’ + BC
      b) B + C
      c) AB + A’C
      d) A + C
      Answer: a) A’ + BC

    1. How many Boolean functions can be formed with 3 variables?
      a) 8
      b) 256
      c) 16
      d) 64
      Answer: b) 256

    2. The truth table of a 2-input XOR gate has how many 1s?
      a) 2
      b) 3
      c) 4
      d) 1
      Answer: a) 2

    3. The truth table of a 2-input XNOR gate has how many 1s?
      a) 2
      b) 1
      c) 3
      d) 4
      Answer: a) 2

    4. The complement of 1 is:
      a) 0
      b) 1
      c) X
      d) Undefined
      Answer: a) 0

    5. The complement of 0 is:
      a) 1
      b) 0
      c) Undefined
      d) X
      Answer: a) 1

    6. The binary equivalent of logical true is:
      a) 1
      b) 0
      c) -1
      d) X
      Answer: a) 1

    7. The binary equivalent of logical false is:
      a) 0
      b) 1
      c) -1
      d) Undefined
      Answer: a) 0

    8. A Boolean variable can take how many values?
      a) 2
      b) 4
      c) 8
      d) 16
      Answer: a) 2

    9. In Boolean algebra, the complement of a complement equals:
      a) The original variable
      b) 0
      c) 1
      d) Undefined
      Answer: a) The original variable

    10. In Boolean algebra, A + A’B = ?
      a) A + B
      b) A’ + B
      c) A·B
      d) A + A’
      Answer: a) A + B

Leave a Comment

Your email address will not be published. Required fields are marked *

You cannot copy content of this page

Scroll to Top