NIMCET 2015 Question Paper with solutions

Question : 114 of 120

Marks: +1, -0

The number of Boolean functions possible with ‘n’binary variables is equal to;

$2^{2^n}$
$2^n$
$2^{2^{n-1}}$
$2^{n-1}$

Solution:

If there are p possibilities for choice 1 and q possibilities for choice 2, then there are a total of p * q different way of doing both. It is trivial that this can be extended to n choices.
So, there would be

2^n

boolean functions

Go to Question:

Prev Question

Next Question