The Gateway to Computer Science Excellence
0 votes
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).
in Digital Logic by Boss (30.7k points) | 239 views

1 Answer

+5 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}$.
by (95 points)
edited by
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,251 answers
198,055 comments
104,680 users