The total number of binary function that can be defined using n boolean variable is _________.
With \(n\) variables there are \(2^n\) input rows, and each row's output can be 0 or 1. So there are \(2^{2^n}\) Boolean functions.
None of the options (A)–(C) gives \(2^{2^n}\).
Answer: (D) None
Reinforce your conceptual grasp with related questions from MAH MCA CET 2017:
Which of the following is a functionally complete set of gates?
...Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.
Start Free Mock Test Series →