The dual of a Boolean function $$F\left( {{x_1},{x_2},\,....,\,{x_n},\, + , \cdot ,'} \right),$$ written as $${F^D}$$, is the same expression as that of $$F$$ with $$+$$ and $$ \cdot $$ swapped. $$F$$ is said to be self-dual if $$F = {F^D} \cdot $$. The number of self-dual functions with $$n$$ Boolean variables is

Consider the following combinational function block involving four Boolean variables $$x, y, a,$$
$$b$$ where $$x, a, b$$ are inputs and $$y$$ is the output.
Which one of the following digital logic blocks is the most suitable for implementing this function?

Consider the following Boolean expression for $$F:$$
$$F\left( {P,\,Q,\,R,\,S} \right) = PQ + \overline P QR + \overline P Q\overline R S.$$
The minimal sum-of-products form of $$F$$ is

Which one of the following expressions does NOT represent exclusive NOR of $$x$$ and $$y?$$