How are 'Don't Care' conditions (denoted by X) utilized during K-Map minimization?
Don't cares represent invalid/unused input combinations and can be treated as 1 to enlarge 1-groups or 0 if they do not assist in grouping.
Simplify the Boolean expression: A(A + B)
By Absorption Law: A(A + B) = AA + AB = A + AB = A(1 + B) = A.
What is the complement of the Boolean expression (A + B')(C + D)?
Using De Morgan's theorem: [(A + B')(C + D)]' = (A + B')' + (C + D)' = A'B'' + C'D' = A'B + C'D'.
Which algebraic theorem states that A + BC = (A + B)(A + C)?
In Boolean algebra, OR distributes over AND: A + BC = (A + B)(A + C).
What is the Quine-McCluskey method used for?
The Quine-McCluskey (tabular) method is an algorithmic technique for simplifying Boolean functions, ideal when variable count exceeds 4 or 5.