All Exams Test series for 1 year @ ₹349 only
Question

The output of the circuit is given by :

This question was previously asked in
UGC NET 2016 Paper 1 Question Paper (10-Jul-2016)
The correct answer is

\(A+B\)

Work forward gate by gate. The circuit has two identical halves feeding a final NAND, so simplify one half and the other follows by symmetry.

Step 1 — the upper half. The inverter gives \(\bar{A}\) and the NOR gives \(\overline{A+B}=\bar{A}\bar{B}\). The OR gate combines them:

\(Y_1=\bar{A}+\bar{A}\bar{B}\)

Apply the absorption law, \(X+XY=X\), with \(X=\bar{A}\):

\(Y_1=\bar{A}\)

Step 2 — the lower half. Identically, the inverter gives \(\bar{B}\), the NOR gives \(\overline{B+C}=\bar{B}\bar{C}\), and the OR gate produces

\(Y_2=\bar{B}+\bar{B}\bar{C}=\bar{B}\)

Notice that C has vanished completely — absorption swallowed the only branch that carried it. That is the key observation of the whole problem, and it immediately rules out options 1, 2 and 4, all of which contain C.

Step 3 — the output NAND.

\(Y=\overline{Y_1\cdot Y_2}=\overline{\bar{A}\cdot\bar{B}}\)

By De Morgan's theorem,

\(Y=\overline{\bar{A}}+\overline{\bar{B}}=A+B\)

Verify with a quick truth check. Take A = 0, B = 0, C = 1. Then \(Y_1=\bar{A}=1\) and \(Y_2=\bar{B}=1\), so the NAND gives 0 ✓, matching A + B = 0. Take A = 1, B = 0, C = 0: \(Y_1=0\), so the NAND gives 1 ✓, matching A + B = 1. Changing C never changes the output, confirming the redundancy.

The lesson. A NOR gate followed by an OR with one of its own inputs inverted is a redundant structure — the absorption law collapses it. Recognising \(X+XY=X\) and its dual \(X(X+Y)=X\) on sight is what turns a five-gate network into a single OR.

Hence, the output is A + B.

Was this answer helpful?

Similar Questions

  1. The Boolean expression \(AC+B\bar{C}\) is equivalent to :

  2. Consider the following expressions :

    (a) Y = f(A, B, C, D) = Σ (1, 2, 4, 7, 8, 11, 13, 14)
    (b) Y = f(A, B, C, D) = Σ (3, 5, 7, 10, 11, 12, 13, 14)
    (c) Y = f(A, B, C, D) = Π (0, 3, 5, 6, 9, 10, 12, 15)
    (d) Y = f(A, B, C, D) = Π (0, 1, 2, 4, 5, 8, 9, 15)

    Which of the above expressions are equivalent to the expression Y = A⊕B⊕C⊕D ?


Important Questions from Logic Gates and Boolean Algebra

  1. The digital circuit shown has 3 inputs ($x$, $y$, and $z$). 

    The simplified logical expression for the output (OUT) is:

  2. The MOSFET switches shown in the circuit are ideal. 

    Which of the following is the correct option for Boolean logical expression of the output (OUT), and the maximum possible power (P) consumed by the circuit?

  3. The Boolean expression \(AC+B\bar{C}\) is equivalent to :

  4. Consider the following expressions :

    (a) Y = f(A, B, C, D) = Σ (1, 2, 4, 7, 8, 11, 13, 14)
    (b) Y = f(A, B, C, D) = Σ (3, 5, 7, 10, 11, 12, 13, 14)
    (c) Y = f(A, B, C, D) = Π (0, 3, 5, 6, 9, 10, 12, 15)
    (d) Y = f(A, B, C, D) = Π (0, 1, 2, 4, 5, 8, 9, 15)

    Which of the above expressions are equivalent to the expression Y = A⊕B⊕C⊕D ?

  5. Match the Exclusive-OR (XOR) operations (i) to (iv) with the results (p) to (s), where X is a Boolean input.
    (i) $X \oplus X$(p) 1
    (ii) $X \oplus \bar{X}$(q) 0
    (iii) $X \oplus 0$(r) $\bar{X}$
    (iv) $X \oplus 1$(s) X
Need Expert Advice?
Upcoming Exams
CTET
December 12, 2026
CBSE UGC NET
December 14, 2026
CSIR UGC NET
December 19, 2026
Test Series
UGC NET img
Teaching
UGC NET (Paper 2) 2026 Mock Test Series
796 Tests 2 Tests Free
4.4(40)
English
More Questions from UGC NET

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App