The GATE Grind

GATE 2007 CS – Question 3

Digital Logic · Boolean Algebra and Minimization · 1 mark · Multiple choice

What maximum number of different Boolean functions involve n Boolean variables?

  1. $n^2$
  2. $2^n$
  3. $2^{2^n}$
  4. $2^{n^2}$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) $2^{2^n}$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Boolean Algebra and Minimization questions

All Boolean Algebra and Minimization questions →