Skip to content
Question Bank (3 marks) · Q6

Q.Realize the half adder using only NAND gates and write the Boolean expression at the output of each gate.

Karnataka PUCTextbookLong· 3mImportance★★★★★est
18% · 28/160 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

[!TLDR]

Five NAND gates give a half adder: four form the sum A⊕BA\oplus B and the fifth inverts AB‾\overline{AB} to the carry ABAB.

Realization: The sum of a half adder is A⊕BA\oplus B, which needs four NAND gates, and the carry is ABAB, obtained by inverting the output of the first NAND.

  • Gate G1 (inputs A,BA, B): G1=AB‾G1 = \overline{AB}.
  • Gate G2 (inputs A,G1A, G1): G2=A⋅G1‾=A AB‾‾=A‾+BG2 = \overline{A\cdot G1} = \overline{A\,\overline{AB}} = \overline{A}+B.
  • Gate G3 (inputs B,G1B, G1): G3=B⋅G1‾=B AB‾‾=A+B‾G3 = \overline{B\cdot G1} = \overline{B\,\overline{AB}} = A+\overline{B}.
  • Gate G4 (inputs G2,G3G2, G3): Sum=G2⋅G3‾=AB‾+A‾B=A⊕BSum = \overline{G2\cdot G3} = A\overline{B}+\overline{A}B = A\oplus B. …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.