239 views
Provide short answers to the following questions:

A switching function is said to be neutral if the number of input combinations for which its value is 1 is equal to the number of input combinations for which its value is 0. Compute the number of neutral switching functions of $n$ variables (for a given n).
| 239 views

For an 'n' variable function, total number of possible minterms(input combinations) will be $2^n$. Half of them will be one i.e, $2^{n-1}$.

Thus total number of neutral functions possble = Choosing any $2^(n-1)$ combinations to be 1 out of $2^n$ combination. i.e  $2^{n} \choose 2^{n-1}$.
by (95 points)
edited by