‹ Back to the paper
Choose the correct option.
What will be the least number of groups and their types formed for reduction?
- (i)6 pairs
- (ii)2 quad and 2 pairs
- (iii)1 quad and 3 pairs
- (iv)3 quads
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: (iv)
Answer: (iv) 3 quads
The map groups are 8,9,12,13 ; 0,2,8,10 ; 0,4,8,12: three quads cover all minterms.
From ISC 2022 Computer Science - Specimen paper (Semester 1), Paper 1, question 21(a).
Check your working with the Boolean algebra solver: the steps law by law, the K-map and the logic circuit for any expression.