The number of Boolean functions possible with n binary variables is equal to
With \(n\) variables, the truth table has \(2^n\) rows. Each row's output can be 0 or 1 independently.
Number of different Boolean functions = \(2^{2^n}\). (For example, \(n = 2\) gives 16 functions.)
Answer: (A) \(2^{2^n}\)
Reinforce your conceptual grasp with related questions from MAH MCA CET 2015:
Given f1 , f3 and f in canonical sum of products...
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 →