‹ Back to the paper
If and , then the maxterm will be:
If $A = 1, B = 0, C = 0$ and $D = 1$, then the maxterm will be:
- (a)$AB'C'D$
- (b)$A'BCD'$
- (c)$A + B' + C' + D$
- (d)$A' + B + C + D'$
Answer
No answer yet.
From ISC 2022 Computer Science - Specimen paper (Semester 1), Paper 1, question 3.
Check your working with the Boolean algebra solver: the steps law by law, the K-map and the logic circuit for any expression.