retagged by
293 views

1 Answer

1 votes
1 votes

Different Boolean Function with n variables

Input-------------------------------------->Output

n variable                                               0/1

2x2x2....n times Combination            2 Combination

$2^n$ Combination                                    2 Combination

No of way Function value can be assigned to input combination=[(no. of  output) ^ (no. of  input combination)]

=$(2)^(2^n)$

So A is the correct answer.

Answer:

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
1 answer
2
admin asked Jan 5, 2019
390 views
How many Boolean functions in one variable are $\text{NOT}$ idempotent: i.e. they do not satisfy $\forall a.f(f(a)) = f(a).$$4$Infinite$1$$0$
1 votes
1 votes
2 answers
3
admin asked Jan 5, 2019
410 views
How many different Boolean circuits of $n$ variables are there?None of the above$n^{2^{n}}$$2^{2^{n}}$$2^{n}$
0 votes
0 votes
3 answers
4
admin asked Jan 5, 2019
868 views
Which Boolean function does the following Karnaugh map represent?Inclusive $\text{NOR}$Exclusive $\text{NOR}$Exclusive $\text{OR}$Inclusive $\text{OR}$