GATE 2025 CS (CS1) – Question 42
Consider the following four variable Boolean function in sum-of-product form
$F(b_3,b_2,b_1,b_0) = \sum(0,2,4,8,10,11,12)$.
where the value of the function is computed by considering $b_3b_2b_1b_0$ as a 4-bit binary number, where $b_3$ denotes the most significant bit and $b_0$ denotes the least significant bit. Note that there are no don't care terms. Which ONE of the following options is the CORRECT minimized Boolean expression for $F$?
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (A) $\bar b_1\bar b_0 + \bar b_2\bar b_0 + b_1\bar b_2 b_3$
Explanation
Minterms of $F=\sum(0,2,4,8,10,11,12)$, written as $b_3b_2b_1b_0$: $0000,0010,0100,1000,1010,1011,1100$.
Prime groups on the K-map:
- $\overline{b_1}\,\overline{b_0}$ (cells with $b_1=0,b_0=0$): $0,4,8,12$ — all are in $F$.
- $\overline{b_2}\,\overline{b_0}$ (cells with $b_2=0,b_0=0$): $0,2,8,10$ — all are in $F$.
- Minterm $11=1011$ is left. It combines with $10=1010$: $b_3\overline{b_2}b_1$ covers $10,11$.
$$F=\overline{b_1}\,\overline{b_0}+\overline{b_2}\,\overline{b_0}+b_3\overline{b_2}b_1.$$
This matches option (A). Option (D) would include minterm 1 ($\overline{b_3}$ covers $0$–$7$), which is not in $F$.