21. 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
22. The expression W(X + YZ) can be converted to SOP form by applying which law?
(a) associative law
(b) commutative law
(c) distributive law
(d) none of the above
23. A truth table for the SOP expression has how many input combinations?
(a) 1
(b) 2
(c) 4
(d) 8
24. The truth table for the SOP expression has how many input combinations?
(a) 1
(b) 2
(c) 4
(d) 8
25. For the SOP expression , how many 1s are in the truth table’s output column?
(a) 1
(b) 2
(c) 3
(d) 5
Related Posts
555555555589. The Boolean expression AB + CD is an example of ________. (a) PAL (b) GAL (c) SOP (d) POS- 555555555549. The Boolean expression (A + B)(C + D) is an example of ________. (a) LAB (b) LUT (c) SOP (d) POS
- 555555555517. Convert the following SOP expression to an equivalent POS expression. (a) (b) (c) (d)
- 5555555555130. The Boolean SOP expression obtained from the truth table below is ________. (a) (b) (c) (d) None of these
- 555555555527. The standard SOP form of the expression is ________. (a) (b) (c) (d)