Multiple choice

The total number of Boolean functions that can be generated by n variables is equal to

  1. $2^{2^n}$
  2. $2^{2n}$
  3. $2^{n-1}$
  4. $2^{n-2}$
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

 for n independent Boolean variables, each taking one particular Boolean value, there are 2n different possible combinations. A Boolean function has to assign one Boolean value to each one of these combinations. This brings the number of different possible Boolean functions of n variables to a total of  $2^{2^n}$

Keep practicing — related questions