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
Recommended Posts:
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 21
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 7
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 6
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 5
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 4
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 3
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 2
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 1
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 8
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 9
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 10
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 20
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 19
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 18
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 17
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 16
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 15
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 14
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 13
- GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 12
