Gate CS-2014-2 Question Paper With Solutions

Q. 16 The dual of a Boolean function f(x1, x2, … , xn, +, ∙ , ′ ), 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²ⁿ

(D) 2^2n-1

Answer: (D)

Explanation: