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

Question 5(ii)

3 marks

Computer ScienceISC 2023 Computer Science Paper 1Short answerBoolean Algebra

Answer the following.

From the logic diagram given below, write the Boolean expression for (1) and (2). Also, derive the…

From the logic diagram given below, write the Boolean expression for (1) and (2). Also, derive the Boolean expression (F) and simplify it.
Figure for this question
Open in the Boolean algebra solver

Answer

Answer

From the diagram: gate (1) is a NAND gate with inputs X and Y, gate (2) is a NOR gate with inputs Y and Z, and their outputs go into an OR gate giving F. (1) $= (X \cdot Y)'$ (2) $= (Y + Z)'$ $F = (X \cdot Y)' + (Y + Z)' = X' + Y'$
  1. 1. Output of the NAND gate: (1) $= (X \cdot Y)'$
  2. 2. Output of the NOR gate: (2) $= (Y + Z)'$
  3. 3. The OR gate adds them: $F = (X \cdot Y)' + (Y + Z)'$
  4. 4. By De Morgan's laws: $F = X' + Y' + Y' \cdot Z'$
  5. 5. By the absorption law ($Y' + Y'Z' = Y'$): $F = X' + Y'$
  6. 6. By De Morgan's law this can also be written $F = (X \cdot Y)'$, so $F = X' + Y'$