MCAPREP
Home > NIMCET 2015 Paper > Question 100

Question 100

Computer Awareness Boolean algebra Easy

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

(A) <span class="math-tex">\(2^{2^{n}}\)</span>
(B) 2<sup>n</sup>
(C) <span class="math-tex">\(2^{2{n-1}}\)</span>
(D) <span class="math-tex">\(2^{n-1}\)</span>
View Dynamic Solution & Explanation ▼
Correct Solution: Option A

Step-by-step Solution:

No explanation entered yet.

← Previous Question Our Rankers Next Question →