What is the total number of distinct Boolean functions that can be formed using 2 binary variables?
The number of distinct Boolean functions for n variables is 2^{$2^n}$. For n = 2 variables, 2^{$2^2}$ = 2^4 = 16 functions.
In a 4-variable K-map, grouping all 16 cells together produces which output?
Grouping 2^4 = 16 cells in a 4-variable K-Map eliminates all 4 variables (4 - 4 = 0 variables remaining in product term), resulting in constant output 1.
What is the complement of a tautology (Boolean expression equal to 1)?
The complement of 1 (tautology) is 0 (fallacy or contradiction) in Boolean algebra.
Which logic gate exhibits the property that any odd number of 1s in input yields 0 output?
XNOR output is 1 for an even number of 1s, and 0 for an odd number of 1s (even parity function).
Minimum number of 2-input NAND gates required to implement a NOT gate is:
A NOT gate requires only 1 NAND gate by tying both inputs together: (A.A)' = A'.