涉及 n 个布尔变量的不同布尔函数的最大数量是多少?
(A) n 2
(B) 2 n
(C) 2 2 n
(D) 2 n 2答案: (C)
解释:
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
这个问题的测验