Question 17447 – ISRO CS-2023
May 28, 2024Question 8152 – Computer-Organization
May 28, 2024Question 4933 – Digital-Logic-Design
A Boolean function F is called self-dual if and only if
F(x1, x2, … xn) = F(͞x1,͞x2, …͞xn)
How many Boolean functions of degree n are self-dual ?
Correct Answer: D
Question 542 Explanation:
→ Number of possible minterms = 2n.
→ Number of mutually exclusive pairs of minterms = 2n-1.
→ There are 2 choices for each pair i.e., we can choose one of the two minterms from each pair of minterms for the function.
Therefore number of functions = 2*2* …. 2n-1 times.
= 2(2^(n-1))
→ Number of mutually exclusive pairs of minterms = 2n-1.
→ There are 2 choices for each pair i.e., we can choose one of the two minterms from each pair of minterms for the function.
Therefore number of functions = 2*2* …. 2n-1 times.
= 2(2^(n-1))
2n
(2)2^n
(2)n^2
(2)(2^(n-1))
Subscribe
Login
0 Comments