Exercise: Boolean Algebra And Logic Simplification

Questions for: Boolean Algebra And Logic Simplification

Applying the distributive law to the expression , we get ________.
A:
B:
C:
D:
Answer: D
No answer description is available. Let's discuss.
The Boolean expression is logically equivalent to what single gate?
A:
NAND
B:
NOR
C:
AND
D:
OR
Answer: A
No answer description is available. Let's discuss.
A Karnaugh map is a systematic way of reducing which type of expression?
A:
product-of-sums
B:
exclusive NOR
C:
sum-of-products
D:
those with overbars
Answer: C
No answer description is available. Let's discuss.
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: D
No answer description is available. Let's discuss.
The truth table for the SOP expression has how many input combinations?
A:
1
B:
2
C:
4
D:
8
Answer: D
No answer description is available. Let's discuss.
Ad Slot (Above Pagination)
Quiz