Question

Consider the following logic circuit diagram.

Logic circuit with inputs Y and X feeding three branches into a 3-input OR gate with output F: top branch is a 2-input NAND gate of Y and X; middle branch is a NOT gate of X; bottom branch is a 2-input AND gate of X and NOT Y.

Which is/are the CORRECT option(s) for the output function FF?

Choose every correct option
Official answer and solution
Official answer
A, B and C
From
Official GATE 2025 answer key

Solution

Write the Boolean expression for each of the three gate outputs feeding the final OR gate, then simplify using De Morgan's and absorption laws.

Tracing the three inputs to the final 3-input OR gate:

  1. Top 2-input NAND gate receives YY and XX, producing XY‾\overline{XY}.
  2. Middle NOT gate receives XX, producing Xˉ\bar{X}.
  3. Bottom 2-input AND gate receives XX and Yˉ\bar{Y} (from the inverter on YY), producing XYˉX\bar{Y}.

Combining these at the OR gate gives:

  • F=XY‾+Xˉ+XYˉF = \overline{XY} + \bar{X} + X\bar{Y}, which is Option (C).
  • By De Morgan's law (XY‾=Xˉ+Yˉ\overline{XY} = \bar{X} + \bar{Y}) and idempotence (Xˉ+Xˉ=Xˉ\bar{X} + \bar{X} = \bar{X}), F=Xˉ+Yˉ+XYˉF = \bar{X} + \bar{Y} + X\bar{Y}, which is Option (B).
  • By absorption (Yˉ+XYˉ=Yˉ\bar{Y} + X\bar{Y} = \bar{Y}), F=Xˉ+Yˉ=XY‾F = \bar{X} + \bar{Y} = \overline{XY}, which is Option (A).
  • Option (D) X+YˉX + \bar{Y} evaluates to 11 when (X,Y)=(1,1)(X, Y) = (1, 1), whereas F(1,1)=0F(1, 1) = 0.
Final answer

Options (A), (B), (C)

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2025 Computer Science and Information Technology - Session 2 (CS2)
Question
31 of 65
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.