De Morgan’s theorem - Laws and Theorems of Boolean Algebra

What is the use of De Morgan's theorem?

The output $Y$ of the given logic circuit is,

Output $C$ of the network shown is:-

Cotyledons are also called-

What is the Boolean equation for the figure?

In the given circuit, the binary inputs at $A$ and $B$ are both $1$ in one case and both $0$ in the next case. The respective outputs at $Y$ in these two cases will be

In the LOGIC gate circuit, if the value of output $\left(R\right)$ be $1$ then the inputs $X$ and $Y$ can be.

Select the output $Y$ of the combination of gates shown in figure for inputs $A=1,B=0;A=1,B=1$ and $A=0,B=0$ respectively.

What will be the input of $A$ and $B$ for Boolean expression?

$\left(\overline{A+B}\right)·\left(\overline{A·B}\right)=1$

For given logic diagram, output $F=1$, then inputs are

The diagram of a logic circuit is given below. The output $A$ of the circuit is represented by

The circuit is equivalent to

An AND gate is followed by a NOT gate. With two inputs $\mathrm{A}$ and $\mathrm{B}$, the boolean expression for the output $\mathrm{Y}$ will be

Which one of the entries given in the truth table is true for the following logic circuit?

Sum of the two binary numbers ${\left(100010\right)}_2$ and ${\left(11011\right)}_2$ is

The Binary Coded Decimal (BCD) equivalent of 429 is

The truth table for the following logic circuit is

The circuit diagram shows a logic combination with the states of output $X$, $Y$ and $Z$ given for inputs $P$, $Q$, $R$ and $S$ all at state $1$. When inputs $P$ and $R$ change to state 0 with inputs $Q$ and $S$ still at $1$, the states of outputs $X$, $Y$ and $Z$ change to

In the following circuit Y is