‹ Back to the paper
Choose the correct option.
The reduced expression of the Boolean function given above is:
- (i)$ACD' + B'D' + BD$
- (ii)$(A + C' + D') \cdot (B' + D') \cdot (A + C')$
- (iii)$C'D' + AC' + B'D'$
- (iv)$(C + D') \cdot (B' + D') \cdot (A + B + D)$
Show the case
Reduce the given Boolean function $F(A,B,C,D) = \sum(0,2,4,8,9,10,12,13)$ by using 4-variable Karnaugh map and answer the following questions:
Answer
Answer
AICorrect option: (iii)
Answer: (iii) $C'D' + AC' + B'D'$
The three quads give $AC'$ (8,9,12,13), $B'D'$ (0,2,8,10) and $C'D'$ (0,4,8,12).
From ISC 2022 Computer Science - Specimen paper (Semester 1), Paper 1, question 21(b).
Check your working with the Boolean algebra solver: the steps law by law, the K-map and the logic circuit for any expression.