$f(A, B, C, D) = \Pi M(0, 1, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15)$ is a maxterm representation of a Boolean function $f(A, B, C, D)$ where $A$ is the MSB and $D$ is the LSB. The equivalent minimized representation of this function is
Read the printed list literally: $f=0$ at the twelve listed cells, so $f=1$ only at cells 2, 6, 8 and 10 (0010, 0110, 1000, 1010). Grouping those ones gives $f=\bar AC\bar D+A\bar B\bar D=\bar D(A+C)(\bar A+\bar B)$, and none of the four options equals this.
Option (A), $(A+\bar C+D)(\bar A+B+D)$, is a product of sums whose factors are 0 exactly at cells 2, 6 (first factor) and 8, 10 (second factor). That is the complement of the printed function, and it is the answer given in the official key. So the key treats cells 2, 6, 8 and 10 as the maxterms, which means the printed list looks like a misprint; (A) is the expected choice.
More VCOs and timers, combinatorial and sequential logic circuits, multiplexers, demultiplexers questions
GATE 2017 EE Q23– The Boolean expression AB + AC + BC simplifies to
GATE 2017 EE Q46– The output expression for the Karnaugh map shown below is AB \ CD 00 01 11 10 --- --- ---…
GATE 2017 EE Q47– The logical gate implemented using the circuit shown below where, V 1 and V 2 are inputs…
GATE 2014 EE (EE1) Q31– Find the overall modulus of three cascaded identical modulo-5 counters.
GATE 2014 EE (EE1) Q60– Which logic circuit realizes F represented by the Karnaugh map shown?
GATE 2014 EE (EE1) Q62– An output device is interfaced with an 8085A 8-bit microprocessor as shown. The 3-to-8…