What is the maximum number of different Boolean functions involving n Boolean variables?
(A)
n2
(B)
2n
(C)
22n
(D)
2n2
Answer: (C)
Explanation:
No of inputs sequences possible for a n variable Boolean function = 2n Each input sequence can give either T or F as output ( 2 possible values ) So, Total no of Boolean functions are - 2X2X2X2X2X2X.............X2X2X2X2X2X2 <-------------------- 2n Times --------------> 22n
Quiz of this Question
Please comment below if you find anything wrong in the above post