English

Draw the logic circuit of the following Boolean function using NAND gates only. F(A,B,C,D) = A.C + C.D + B.C

Advertisements

Question

Draw the logic circuit of the following Boolean function using NAND gates only.

F(A,B,C,D) = A.C + C.D + B.C

Diagram
Theorem
Advertisements

Solution

Step 1: Convert into NAND Form

Using De Morgan's Theorem:

F = ((A.C)' . (C.D)' . (B.C)')'

Step 2: Draw the NAND Logic Circuit

Step 3: Intermediate Outputs

  • N1 = (A.C)'
  • N2 = (C.D)'
  • N3 = (B.C)'

Output:

F = (N1.N2.N3)' = A.C + C.D + B.C

The circuit uses three 2-input NAND gates and one 3-input NAND gate.

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 32. | Page 51
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×