Convert the given Boolean equation into logic diagram:

$\overline{\mathrm{A}.\mathrm{B}.\mathrm{C}} =\overline{\mathrm{A}} +\overline{\mathrm{B}} +\overline{\mathrm{C}}$

Why are NOR and NAND gates called universal gates?

Give the truth table for 3-input OR gate.

State and explain AND law with example.

Express by truth table the output Y for all possible inputs A and B in the following circuit.

A logic gate has been obtained by applying the negation (NOT) operation after OR gate. Name the gate so formed. Write the symbol and truth table of this gate.

Draw a logic circuit diagram showing how a NAND gate can be converted to NOT gate.

Identify the logic gates marked $X$ and $Y$ in the fig. given below. Write down the output at Z when $A=1$ and $B=0$.

The output of a 2-input AND gate is fed to a NOT gate. Write its truth table.