Q87.Marks: +2.0UGC NET Paper 2: Computer Science 18th June 2024 Shift 1 (Cancelled)
The Boolean expression for the following would be:
F(A, B, C) = Σ(0, 2, 6)
d(A, B, C) = Σ(1, 3, 5)
1.A'C' + BC'
2.B + AC'
3.A + BC'
4.A' + BC'✓ Correct
Solution
The correct answer is A' + BC'
Key PointsA Karnaugh Map (K-map) is a visual method used for simplifying Boolean expressions. It provides a straightforward way to minimize expressions with two, three, four, or more variables. The map is a grid where each cell represents a min-term of the Boolean function. By organizing these min-terms in a specific pattern, it becomes easier to spot opportunities for simplification.
Don't-care terms (denoted as (x)) are used in Boolean functions to indicate that for certain combinations of variables, the output value can be either 0 or 1 without affecting the overall functionality of the circuit or logic. These terms provide flexibility for further simplification and optimization of the Boolean expression.