The shaded portions are A without B and B without A; their overlap is unshaded. Thus the function is exclusive OR, $A\bar B+\bar A B$. Expanding $(A+B)(\bar A+\bar B)$ gives exactly this expression because $A\bar A=B\bar B=0$. Hence A.
More Number systems and combinational logic: Number systems, multiplexer and demultiplexer, truth tables, minimization of Boolean functions, IC families (ECL, TTL, CMOS), CMOS logic gates, arithmetic circuits questions
GATE 2020 IN Q22– For the shown 4:1 multiplexer with select bits S 1 (MSB) and S 0 (LSB), the output O is
GATE 2025 IN Q17– The minimized Boolean expression Y(P,Q,R) implemented by the shown multiplexer circuit is
GATE 2025 IN Q18– The 4-bit signed two’s-complement result of (5) 10+(5) 10 is
GATE 2025 IN Q29– A Boolean function is X= A B+ A C. The reduced form of X is
GATE 2024 IN Q16– The simplified form of the Boolean function F=(A+ A B)+ A(A+ B)C is
GATE 2023 IN Q17– Match XOR operations i–iv to results p–s, where X is a Boolean input. Operations: i. X X;…
