Class 12 · ICSE · Computer Science

Karnaugh Maps

Reducing Boolean expressions with three and four variables using K-maps, and reading off the minimal SOP and POS forms.

Questions

6 questions in this chapter.

Answer available
Class 12 · Computer Science · Karnaugh Maps
Reduce F(A, B, C, D) = Σ(0, 2, 8, 10) using a Karnaugh map.
3 marksMediumNumerical
Answer available
Class 12 · Computer Science · Karnaugh Maps
State the rules for forming groups on a Karnaugh map.
3 marksMediumShort answer
Answer available
Class 12 · Computer Science · Karnaugh Maps
What are don't care conditions, and how are they used in a Karnaugh map?
3 marksMediumShort answer
Answer available
Class 12 · Computer Science · Karnaugh Maps
What is a redundant group on a Karnaugh map, and why should it be removed?
3 marksMediumShort answer
Answer available
Class 12 · Computer Science · Karnaugh Maps
Reduce F(A, B, C) = Σ(0, 1, 2, 3) using a Karnaugh map.
3 marksMediumNumerical
Answer available
Class 12 · Computer Science · Karnaugh Maps
Reduce F(A, B, C) = Σ(1, 3, 5, 7) using a Karnaugh map.
3 marksMediumNumerical