Boolean Algebra And Logic Simplification

Question: In the commutative law, in ORing and ANDing of two variables, the order in which the variables are ORed or ANDed makes no difference.
[A].

True

[B].

False

Answer: Option A

Explanation:

No answer description available for this question.

Question: In Boolean algebra, = A.
[A].

True

[B].

False

Answer: Option A

Explanation:

No answer description available for this question.

Question: In Boolean algebra, A + 1 = 1.
[A].

True

[B].

False

Answer: Option A

Explanation:

No answer description available for this question.

Question: Mapping the standard SOP expression , we get
[A].

(A)

[B].

(B)

[C].

(C)

[D].

(D)

Answer: Option B

Explanation:

No answer description available for this question.

Question: Mapping the SOP expression , we get ________.
[A].

(A)

[B].

(B)

[C].

(C)

[D].

(D)

Answer: Option B

Explanation:

No answer description available for this question.

Question: From the truth table below, determine the standard SOP expression.
[A].

[B].

[C].

[D].

Answer: Option D

Explanation:

No answer description available for this question.

Question: For the SOP expression , how many 0s are in the truth table’s output column?
[A].

zero

[B].

1

[C].

4

[D].

5

Answer: Option C

Explanation:

No answer description available for this question.

Question: For the SOP expression , how many 1s are in the truth table’s output column?
[A].

1

[B].

2

[C].

3

[D].

5

Answer: Option C

Explanation:

No answer description available for this question.

Question: A truth table for the SOP expression has how many input combinations?
[A].

1

[B].

2

[C].

4

[D].

8

Answer: Option D

Explanation:

No answer description available for this question.

Question: Convert the following SOP expression to an equivalent POS expression.
[A].

[B].

[C].

[D].

Answer: Option B

Explanation:

No answer description available for this question.