Which method is best suited for tabular minimization of Boolean functions with 5 or more variables?
Quine-McCluskey algorithm is a tabular minimization technique suitable for computer programming and functions with 5+ variables where K-Maps become visually complex.
If a Boolean function F(A, B, C) = ∑m(0, 2, 4, 6), what is its simplified expression?
m0=A'B'C', m2=A'BC', m4=AB'C', m6=ABC'. Grouping all four: C'(A'B' + A'B + AB' + AB) = C'(1) = C'.
What is the output of an EX-OR gate when inputs are A and A?
$A ⊕ A = A'A + AA' = 0 + 0 = 0.$
What is the output of an EX-OR gate when inputs are A and 1?
A ⊕ 1 = A'(1) + A(1)' = A' + 0 = A'. Connecting one input of XOR to 1 makes it an inverter (NOT gate).
Which of the following Boolean expressions is in Canonical POS form?
In Canonical Product of Sums (POS) form, every sum term (maxterm) contains all system variables.