Prashnikaप्रश्निका
Code
About
‹ Back to the paper

Question 5(i)

5 marks

Computer ScienceISC 2026 Improvement Computer Science Paper 1K-mapBoolean Algebra

Reduce the following using a Karnaugh map.

Reduce the Boolean function F(A, B, C, D) = Σ(0, 1, 2, 4, 8, 9, 10, 12) by using 4-variable…

Reduce the Boolean function $F(A, B, C, D) = \Sigma(0, 1, 2, 4, 8, 9, 10, 12)$ by using 4-variable Karnaugh map, showing the various groups (i.e., octal, quads and pairs). Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs.
Open in the Boolean algebra solver

Answer

Answer

Groups: (0, 1, 8, 9) → B'C'; (0, 2, 8, 10) → B'D'; (0, 4, 8, 12) → C'D'

Reduced expression: F = B'C' + B'D' + C'D'

There is no octet. Three quads: (0, 1, 8, 9) gives B'C', (0, 2, 8, 10) gives B'D' and (0, 4, 8, 12) gives C'D'. Logic gate diagram: three 2-input AND gates feeding one 3-input OR gate.
Diagram for this answer