Number of Self-Dual Boolean Functions | GATE CS 2014 Set 2 Question 16

```

Computer Sciences > GATE 2014 SET-2 > Boolean Algebra

The dual of a Boolean function F(x₁, x₂,..., x_n, +,., ') written as F^D is the same expression as that of F with + and. swapped. F is said to be self-dual if F = F^D. The number of self-dual functions with n Boolean variables is

A

2ⁿ

B

2^(n-1)

C

2^(2ⁿ)

D

2^{(2^(n-1))}

Correct : d

Similar Questions

Consider a Boolean function of 3 inputs F(X,Y,Z) = Σ(3,5,6,7). Which of the following expressions is/are CORRECT?

#883 MSQ

For a Boolean variable x, which of the following statements is/are FALSE?

#918 MSQ

Consider the following Boolean expression. F = (X + Y + Z)(X̅ + Y)(Y̅ + Z) Which of the following Boolean expressions is/are equivalent to F̅ (complement of F)?

#1041 MSQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......