Digital Electronics

Boolean Algebra And Logic Simplification | Digital Electronics

Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________.

Question: Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________.
[A].
LM + MNOPQ
[B].
L + MNO + MPQ
[C].
LM + M + NO + MPQ
[D].
LM + MNO + MPQ

Answer: Option D

Explanation:

No answer description available for this question.

Read More Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________.
Digital Electronics | Electronics And Communication Engineering

A(A + B) =

Question: A(A + B) =
[A].
A
[B].
A B
[C].
AB
[D].
AB

Answer: Option C

Explanation:

No answer description available for this question.

Read More A(A + B) =
Digital Electronics | Electronics And Communication Engineering

A + AB =

Question: A + AB =
[A].
A
[B].
A
[C].
A + B
[D].
A + B

Answer: Option C

Explanation:

No answer description available for this question.

Read More A + AB =
Digital Electronics | Electronics And Communication Engineering

A (A + B) =

Question: A (A + B) =
[A].
A
[B].
B
[C].
A
[D].
B

Answer: Option A

Explanation:

No answer description available for this question.

Read More A (A + B) =
Digital Electronics | Electronics And Communication Engineering

Inputs A and B of the given figure are applied to a NAND gate. The output is LOW

Question: Inputs A and B of the given figure are applied to a NAND gate. The output is LOW
[A].
from 0 to 6
[B].
from 0 to 2
[C].
from 0 to 1 and 2 to 3
[D].
from 1 to 2 and 3 to 4

Answer: Option C

Explanation:

NAND gate gives Low output if all inputs are High. For other combinations of inputs, output is High.

Read More Inputs A and B of the given figure are applied to a NAND gate. The output is LOW
Boolean Algebra And Logic Simplification | Digital Electronics

Derive the Boolean expression for the logic circuit shown below:

Question: Derive the Boolean expression for the logic circuit shown below:
[A].

[B].

[C].

[D].

Answer: Option C

Explanation:

No answer description available for this question.

Read More Derive the Boolean expression for the logic circuit shown below:
Digital Electronics | Electronics And Communication Engineering

In a gate output is Low if and only if all inputs are High. The gate is

Question: In a gate output is Low if and only if all inputs are High. The gate is
[A].
OR
[B].
AND
[C].
NOR
[D].
NAND

Answer: Option D

Explanation:

No answer description available for this question.

Read More In a gate output is Low if and only if all inputs are High. The gate is
Digital Electronics | Electronics And Communication Engineering

For the given truth table, the correct Boolean expression is

Question: For the given truth table, the correct Boolean expression is
[A].
XYZ + X YZ + X Y Z
[B].
X Y Z + XYZ + X YZ
[C].
X Y Z + XYZ + XY Z
[D].
XYZ + XYZ + XY Z

Answer: Option B

Explanation:

No answer description available for this question.

Read More For the given truth table, the correct Boolean expression is
Boolean Algebra And Logic Simplification | Digital Electronics

Applying DeMorgan’s theorem to the expression , we get ________

Question: Applying DeMorgan’s theorem to the expression , we get ________
[A].

[B].

[C].

[D].

Answer: Option A

Explanation:

No answer description available for this question.

Read More Applying DeMorgan’s theorem to the expression , we get ________
Digital Electronics | Electronics And Communication Engineering

The boolean expression for shaded area in the given figure is

Question: The boolean expression for shaded area in the given figure is
[A].
AB + AC
[B].
ABC + ABC
[C].
ABC + ABC
[D].
None of these

Answer: Option C

Explanation:

No answer description available for this question.

Read More The boolean expression for shaded area in the given figure is