5555555555
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
Explanation
Explanation : No answer description available for this question. Let us discuss.
Subject Name : Electronics Engineering |
Exam Name : IIT GATE, UPSC ESE, RRB, SSC, DMRC, NMRC, BSNL, DRDO, ISRO, BARC, NIELIT |
Posts Name : Assistant Engineer, Management Trainee, Junior Engineer, Technical Assistant |
Electronics & Communication Engineering Books
|
Related Posts
555555555528. Identify the Boolean expression that is in standard POS form. (a) (b) (c) (d) (A + B)(C + D)Tags: minimization, techniques, boolean, expression, form, electronics, engineering
555555555549. The Boolean expression is equal to ________. (a) C (b) D (c) C + D (d) 1Tags: boolean, expression, electronics, engineering
Minimization Techniques » Exercise - 17. The expression Y=M(0,1,3,4) is : (a) POS (b) SOP (c) Hybrid (d) None of aboveTags: minimization, techniques, expression, sop, electronics, engineering
555555555525. For the SOP expression , how many 1s are in the truth table's output column? (a) 1 (b) 2 (c) 3 (d) 5Tags: minimization, techniques, sop, expression, electronics, engineering
555555555524. The truth table for the SOP expression has how many input combinations? (a) 1 (b) 2 (c) 4 (d) 8Tags: minimization, techniques, sop, expression, electronics, engineering