Prashnikaप्रश्निका
Code
About
‹ Back to the paper

Question 4(ii)

5 marks

Computer ScienceISC 2025 Improvement Computer Science Paper 1Case basedComputer Hardware

Answer the following from the logic gate diagram.

From the logic gate diagram given below: Derive Boolean expression for X(A, B, C) and draw the…

From the logic gate diagram given below:
Figure for this question
(a)[4]
Derive Boolean expression for X(A, B, C) and draw the truth table.
(b)[1]
Write the canonical expression for SUM and CARRY of a half adder.

Answer

Answer (a)

Truth Table for X(A,B,C):
ABCX
0001
0011
0101
0111
1001
1011
1101
1110
Final reduced expression: X(A,B,C) = A' + B' + C'
  1. From the diagram: the top gate is a 2-input NAND gate with inputs A,B giving output (A.B)'.
  2. The bottom gate is a 2-input XOR (Ex-OR) gate with inputs B,C giving output B.C' + B'.C.
  3. The final OR gate combines both outputs: X = (A.B)' + (B.C' + B'.C)
  4. By De Morgan's law, (A.B)' = A' + B'
  5. So X = A' + B' + B.C' + B'.C
  6. By the identity B' + B.C' = B' + C' (Distributive law: B' + BC' = (B'+B).(B'+C') = B'+C'), X = A' + (B'+C') + B'.C = A' + B' + C' + B'.C
  7. By the Absorption law, B' + B'.C = B', so X = A' + B' + C'

Answer (b)

For a half adder with inputs A, B: SUM = A'B + AB' (canonical SOP, equivalent to A XOR B). CARRY = A.B (canonical AND term).