edited by
5,108 views

7 Answers

Best answer
9 votes
9 votes
$2^n$ possible combinations in truth table

All these combinations can either take value $0$ or $1$ (if a variable takes any other value, its no longer boolean)

So no of boolean func=$2^{2^n}$
edited by
2 votes
2 votes

i think the answer would be .. n^{2^n}.

as there are 2^n possible entries in table  and  function is n valued so it will go power to n.

0 votes
0 votes
option (C ) is correct.

Because the nos of combinations with n nos boolean variable is 2^n.

Again for each such combination there will n value (as compared to 0,1 as binary values).

hENCE the possible boolean function is  n*n*n*n*n-------upto 2^n times=n^2^n which is the option (C).
0 votes
0 votes

Answer will be (a) 

Consider 2^2^n as a^b^c then we have a = 2, b = 2, c = n.

Now, remember this shortcut:

  • a represents no of variables
  • b represents type of variables
  • c represents type of functions.

Related questions

3 votes
3 votes
3 answers
2
sh!va asked Jul 15, 2016
16,184 views
How many different Boolean functions are there for $n$ Boolean variables?A. $n^ n$B. $2^ {2^ n}$ C. $n^ {n^2}$D. $2^ {n^2}$
0 votes
0 votes
1 answer
3
Sanjay Sharma asked Dec 30, 2016
3,641 views
If x={a,b,c,d}, then number of binary operations that can be defined on x is:-a. 4^16b. 4^2c. 2^16d. 2^4
2 votes
2 votes
1 answer
4
Rakesh K asked Oct 23, 2016
1,832 views
Consider the following Boolean function$f(a, b, c, d, e) = \sum (0,1,4,5,9,13,16,20,27,31)$ The function is (A) Independent of one variable(B) Independent of two variable...