search
Log In
1 vote
406 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).
in Digital Logic 406 views

1 Answer

6 votes
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}$.

edited by

Related questions

16 votes
5 answers
1
930 views
Find values of Boolean variables $A, B, C$ which satisfy the following equations: A+ B = 1 AC = BC A + C = 1 AB = 0
asked Dec 1, 2016 in Digital Logic makhdoom ghaya 930 views
4 votes
2 answers
2
891 views
Provide short answers to the following questions: Explain the behaviour of the following logic circuit (Fig.4) with level input A and output B
asked Nov 30, 2016 in Digital Logic makhdoom ghaya 891 views
6 votes
3 answers
3
535 views
Provide short answers to the following questions: Show that {NOR} is a functionally complete set of Boolean operations.
asked Nov 30, 2016 in Digital Logic makhdoom ghaya 535 views
7 votes
1 answer
4
1.2k views
Consider an excess - 50 representation for floating point numbers with $4 BCD$ digit mantissa and $2 BCD$ digit exponent in normalised form. The minimum and maximum positive numbers that can be represented are __________ and _____________ respectively.
asked Nov 27, 2016 in Digital Logic makhdoom ghaya 1.2k views
...