The number of distinct Boolean expressions of four variables is-
65536
Therefore, the number of distinct Boolean expressions of four variables is 65536. The calculation 2^{(2^n)} arises because for 'n' variables, there are 2^n rows in a truth table. Therefore, the total number of unique output columns (distinct functions) is 2^{2^n}.
In Boolean algebra, the term sum of products means
The value of \(\rm \overline{A+B}\) is :
The Boolean function Y = AB + CD is to be realized using only two-input NAND gates. The minimum number of gates required are:
The minimum number of 2-input NAND gates required to realize the logic function $Y = AB + \bar A \bar B$ is