Boolean Algebra MCQs (101-200)
The main advantage of using K-maps over Boolean algebra is:
a) Simplicity in visual simplification
b) More variables can be handled
c) It avoids logic gates
d) It uses binary addition
Answer: a) Simplicity in visual simplificationWhat is the minimum number of adjacent 1s that can be grouped in a K-map?
a) 1
b) 2
c) 4
d) 8
Answer: a) 1In a K-map, groups can wrap around from:
a) Left to right and top to bottom
b) Only left to right
c) Only top to bottom
d) None of these
Answer: a) Left to right and top to bottomFor a 4-variable K-map, how many possible combinations exist?
a) 16
b) 8
c) 4
d) 32
Answer: a) 16A K-map group of 4 cells represents a term with how many variables?
a) 2
b) 3
c) 1
d) 4
Answer: a) 2A group of 8 ones in a 4-variable K-map represents:
a) A term with 1 variable
b) A term with 2 variables
c) Constant 1
d) Constant 0
Answer: a) A term with 1 variableWhich grouping method yields the simplest Boolean expression?
a) Largest possible groups
b) Smallest possible groups
c) Random grouping
d) Isolated ones
Answer: a) Largest possible groupsA pair in K-map eliminates:
a) One variable
b) Two variables
c) All variables
d) No variable
Answer: a) One variableA quad in K-map eliminates:
a) Two variables
b) One variable
c) Three variables
d) None
Answer: a) Two variablesAn octet in K-map eliminates:
a) Three variables
b) Two variables
c) Four variables
d) One variable
Answer: a) Three variablesOverlapping groups in K-map are:
a) Allowed and useful for simplification
b) Not allowed
c) Always redundant
d) Incorrect
Answer: a) Allowed and useful for simplificationIn K-map, a don’t-care condition is represented by:
a) X
b) 0
c) 1
d) D
Answer: a) XDon’t-care conditions can be treated as:
a) 0 or 1 depending on simplification
b) Always 0
c) Always 1
d) Ignored completely
Answer: a) 0 or 1 depending on simplificationCombining 1s and don’t-cares in a K-map helps:
a) Simplify the function further
b) Increase complexity
c) Create redundant terms
d) None of these
Answer: a) Simplify the function furtherThe number of adjacent cells for each cell in a 3-variable K-map is:
a) 3
b) 4
c) 2
d) 8
Answer: b) 4The K-map adjacency is based on:
a) Single-bit change (Gray code)
b) Decimal order
c) Binary increase
d) Random numbering
Answer: a) Single-bit change (Gray code)Which is the simplified form of F(A, B, C) = Σ(0, 2, 6, 7)?
a) A’B’ + AC
b) A’B + AC
c) A’ + C
d) B + C
Answer: b) A’B + ACWhich is the simplified form of F(A, B, C) = Σ(1, 3, 5, 7)?
a) B + C
b) A + B
c) A + C
d) A + B’
Answer: a) B + CThe expression F(A,B,C) = Σ(1,2,3,7) simplifies to:
a) B + A’C
b) A’B + AC
c) A + BC
d) AB’ + AC
Answer: a) B + A’CThe simplified expression of F(A,B,C,D) = Σ(1,3,9,11) is:
a) A’C + BD
b) B’D + A’C
c) A + BD’
d) B’C + AD
Answer: b) B’D + A’CWhich law allows factoring out a common variable?
a) Distributive law
b) Identity law
c) Absorption law
d) Consensus theorem
Answer: a) Distributive law
Simplify A + AB + AB’:
a) A
b) A + B
c) AB
d) A + B’
Answer: a) ASimplify (A + B)(A + B’)(A’ + B):
a) A + B
b) AB
c) A·B
d) A·B’
Answer: b) ABSimplify (A + B)(A’ + C):
a) AC + A’B
b) A + BC
c) AB + A’C
d) A’ + C
Answer: b) A + BCSimplify (A + B’)(A’ + B):
a) A·B + A’·B’
b) A ⊕ B
c) A + B
d) A·B
Answer: b) A ⊕ BSimplify (A + B)(A + C)(B + C):
a) A·B + B·C + C·A
b) A·B + B·C
c) A + B·C
d) A·B·C
Answer: c) A + B·CSimplify A’B + AB’:
a) A ⊕ B
b) A·B
c) A + B
d) A·B’
Answer: a) A ⊕ BSimplify (A’ + B’)(A + C):
a) A’B’ + C
b) A + B’
c) A’ + C
d) AB + AC
Answer: a) A’B’ + CSimplify A’ + AB:
a) A’ + B
b) A + B
c) A’B + AB’
d) A’ + B’
Answer: a) A’ + BSimplify (A’ + B)(A + B):
a) B
b) A
c) A + B
d) A·B
Answer: a) BSimplify (A + B)(A’ + B’):
a) A ⊕ B’
b) A ⊕ B (XNOR)
c) A + B
d) AB
Answer: b) A ⊕ B (XNOR)Simplify (A + A’B):
a) A + B
b) A·B
c) A’ + B
d) B
Answer: a) A + BSimplify (A + B)(A’ + B’)’:
a) A + B
b) A·B
c) A
d) B
Answer: b) A·BSimplify A + (A’·B’):
a) A + B’
b) A’ + B
c) A’·B’
d) B
Answer: a) A + B’Simplify (A + B’)(A + C’):
a) A + B’C’
b) AB + AC
c) A + BC
d) B’C’
Answer: a) A + B’C’Simplify (A + B)(A + B’):
a) A
b) B
c) A + B
d) A·B
Answer: a) ASimplify A + A’·B:
a) A + B
b) A’ + B
c) B
d) A·B
Answer: a) A + BSimplify A’·B + A·B:
a) B
b) A + B
c) A’ + B’
d) A’·B’
Answer: a) BSimplify (A + B + C)(A + B’ + C):
a) A + C
b) A + B
c) B + C
d) A·C
Answer: a) A + CSimplify (A’ + B’)(A’ + C):
a) A’ + B’C
b) A’ + C’
c) A’B’ + C
d) A + B
Answer: a) A’ + B’C
How many NAND gates are required to implement an OR gate?
a) 3
b) 2
c) 4
d) 1
Answer: a) 3How many NOR gates are required to implement an AND gate?
a) 3
b) 2
c) 4
d) 1
Answer: a) 3Which logic gate performs inversion operation twice?
a) Double NOT gate (Buffer)
b) AND gate
c) OR gate
d) XOR gate
Answer: a) Double NOT gate (Buffer)XOR of A and 0 gives:
a) A
b) A’
c) 1
d) 0
Answer: a) AXOR of A and 1 gives:
a) A’
b) A
c) 0
d) 1
Answer: a) A’XNOR of A and 0 gives:
a) A’
b) A
c) 1
d) 0
Answer: a) A’XNOR of A and 1 gives:
a) A
b) A’
c) 1
d) 0
Answer: a) ANAND of A and 0 gives:
a) 1
b) 0
c) A
d) A’
Answer: a) 1NOR of A and 0 gives:
a) A’
b) A
c) 0
d) 1
Answer: a) A’NAND of A and 1 gives:
a) A’
b) A
c) 0
d) 1
Answer: a) A’The number of cells in a 5-variable K-map is:
a) 16
b) 32
c) 64
d) 8
Answer: b) 32
The number of adjacent cells for each cell in a 4-variable K-map is:
a) 2
b) 4
c) 8
d) 6
Answer: b) 4In a 4-variable K-map, the first row corresponds to which variable states?
a) AB = 00
b) AB = 01
c) AB = 10
d) AB = 11
Answer: a) AB = 00The simplified result of grouping all 16 cells in a 4-variable K-map is:
a) 1
b) 0
c) A
d) A + B
Answer: a) 1The simplified result of grouping no 1s in a K-map is:
a) 0
b) 1
c) Undefined
d) A + B
Answer: a) 0Which K-map grouping represents the expression A·B’?
a) Cells where A = 1 and B = 0
b) Cells where A = 0 and B = 1
c) Cells where both A and B = 1
d) All cells
Answer: a) Cells where A = 1 and B = 0What is the decimal equivalent of minterm A’B’C’D’?
a) 0
b) 1
c) 3
d) 15
Answer: a) 0Minterm A’B’C’D corresponds to which decimal number?
a) 1
b) 2
c) 3
d) 4
Answer: a) 1Minterm A’BCD corresponds to decimal number:
a) 7
b) 9
c) 11
d) 13
Answer: c) 11In a 3-variable K-map, how many cells are used to represent one octet?
a) 8
b) 4
c) 2
d) 1
Answer: a) 8For function F(A,B,C,D)=Σ(0,1,2,3,4,5,6,7), the simplified expression is:
a) A’
b) B’
c) C’
d) D’
Answer: a) A’The Boolean expression F(A,B,C,D)=Σ(8,9,10,11,12,13,14,15) simplifies to:
a) A
b) B
c) C
d) D
Answer: a) AIf F = Σ(0,2,8,10), the simplified form is:
a) A’C’
b) B’D’
c) C’D’
d) A’B’
Answer: a) A’C’For a 5-variable K-map, grouping 16 adjacent cells eliminates:
a) 4 variables
b) 3 variables
c) 2 variables
d) 1 variable
Answer: a) 4 variablesIn K-map, adjacent cells differ by:
a) One bit
b) Two bits
c) Three bits
d) None
Answer: a) One bitThe variable that remains same in a group is called:
a) Essential variable
b) Common variable
c) Eliminated variable
d) Redundant variable
Answer: b) Common variableThe variable that changes in grouping is:
a) Eliminated
b) Common
c) Retained
d) Active
Answer: a) EliminatedThe number of essential prime implicants is:
a) Minimum number required to cover all 1s
b) Maximum possible
c) Random number
d) All prime implicants
Answer: a) Minimum number required to cover all 1sDon’t-care terms are used to:
a) Simplify logic
b) Increase complexity
c) Reduce speed
d) Avoid errors
Answer: a) Simplify logicThe K-map simplification technique is suitable up to:
a) 5 variables
b) 6 variables
c) 8 variables
d) Unlimited
Answer: a) 5 variables
SOP stands for:
a) Sum of Products
b) Series of Parameters
c) Sum or Product
d) Set of Parts
Answer: a) Sum of ProductsPOS stands for:
a) Product of Sums
b) Product of Systems
c) Product of Signals
d) Power of Sums
Answer: a) Product of SumsWhich form is standard for minterms?
a) SOP
b) POS
c) Both
d) None
Answer: a) SOPWhich form is standard for maxterms?
a) POS
b) SOP
c) Both
d) None
Answer: a) POSEach minterm corresponds to output value:
a) 1
b) 0
c) X
d) None
Answer: a) 1Each maxterm corresponds to output value:
a) 0
b) 1
c) X
d) 2
Answer: a) 0The SOP expression F = A’B + AB’ represents which logic gate?
a) XOR
b) OR
c) AND
d) XNOR
Answer: a) XORThe POS expression (A + B)(A’ + B’) represents which logic gate?
a) XNOR
b) AND
c) XOR
d) OR
Answer: a) XNORThe expression F = (A + B)(A + C) is equivalent to:
a) A + BC
b) AB + AC
c) (A + B + C)
d) A·B·C
Answer: a) A + BCThe expression F = (A + B’)(A + C’) is equivalent to:
a) A + B’C’
b) A + BC
c) A·B + C
d) A’B’ + C’
Answer: a) A + B’C’The minterm representation for F(A,B,C) = A’B’C + A’BC’ is:
a) Σ(1,2)
b) Σ(3,5)
c) Σ(4,5)
d) Σ(2,5)
Answer: b) Σ(3,5)The POS form of F = Σ(1,2,3) is:
a) Π(0,4,5,6,7)
b) Π(4,5,6,7)
c) Π(2,3,5,7)
d) Π(0,2,4,6)
Answer: b) Π(4,5,6,7)Minterms are combined in SOP using:
a) OR
b) AND
c) XOR
d) NOR
Answer: a) ORMaxterms are combined in POS using:
a) AND
b) OR
c) XOR
d) NAND
Answer: a) ANDThe term AB’C corresponds to which minterm number?
a) 5
b) 6
c) 4
d) 7
Answer: a) 5The term A’BC corresponds to which minterm number?
a) 3
b) 5
c) 6
d) 7
Answer: c) 6Which one is a canonical SOP?
a) A’B’C + A’BC’ + ABC
b) (A + B)(A’ + C)
c) A + BC
d) A(B + C)
Answer: a) A’B’C + A’BC’ + ABCWhich one is a canonical POS?
a) (A + B + C’)(A’ + B + C)(A’ + B’ + C)
b) A’B’C + A’BC’
c) A + BC
d) A’ + B’
Answer: a) (A + B + C’)(A’ + B + C)(A’ + B’ + C)The number of minterms in a 3-variable function is:
a) 8
b) 4
c) 6
d) 16
Answer: a) 8The number of maxterms in a 4-variable function is:
a) 16
b) 8
c) 12
d) 4
Answer: a) 16
NAND and NOR gates are known as:
a) Universal gates
b) Basic gates
c) Exclusive gates
d) Derived gates
Answer: a) Universal gatesA NAND gate can perform the function of:
a) NOT, AND, OR
b) Only NOT
c) Only OR
d) XOR
Answer: a) NOT, AND, ORA NOR gate can be used to construct:
a) NOT, AND, OR
b) NOT only
c) AND only
d) XOR only
Answer: a) NOT, AND, ORThe output of a NAND gate is low when:
a) All inputs are high
b) Any input is low
c) All inputs are low
d) Any input is high
Answer: a) All inputs are highThe output of a NOR gate is high when:
a) All inputs are low
b) Any input is high
c) One input is high
d) None of these
Answer: a) All inputs are lowXOR gate gives output 1 when:
a) Inputs are different
b) Inputs are same
c) All inputs are high
d) All inputs are low
Answer: a) Inputs are differentXNOR gate gives output 1 when:
a) Inputs are same
b) Inputs are different
c) Inputs alternate
d) All inputs are low
Answer: a) Inputs are sameThe gate which outputs 0 only when both inputs are equal is:
a) XOR
b) XNOR
c) NOR
d) NAND
Answer: a) XORThe gate which outputs 1 only when both inputs are equal is:
a) XNOR
b) XOR
c) AND
d) OR
Answer: a) XNORThe logic gate used in parity checker circuits is:
a) XOR
b) AND
c) OR
d) NOR
Answer: a) XOR