English

Represent the Boolean expression X + Y.Z' using NAND gates only.

Advertisements

Question

Represent the Boolean expression X + Y.Z' using NAND gates only.

Short Answer
Advertisements

Solution

Step 1: Convert into NAND Form

Using De Morgan's Theorem:

F = (X'.(Y.Z')')'

Step 2: Draw the NAND Logic Circuit

Step 3: Intermediate Outputs

N1 = (X.X)' = X'

N2 = (Z.Z)' = Z'

N3 = (Y.Z')'

N4 = (X'.N3)'

F = (X'.(Y.Z')')' = X + Y.Z'

The circuit uses four 2-input NAND gates only.

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Boolean Algebra - EXERCISE [Page 51]

APPEARS IN

Dheeraj Mehrotra Computer Science [English] Class 12
Chapter 1 Boolean Algebra
EXERCISE | Q 35. | Page 51
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×