Scribd
Upload
10 views2 pages

CS302P bc240214058

Uploaded by

nimrausman216
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views2 pages

CS302P bc240214058

Uploaded by

nimrausman216
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment CS302(Practical)

Name: Usman Ali

Student ID:Bc240214058

Question:1

Simplify the Boolean Expression using Logic Converter in Electronic


Workbench. Submit the simplified Boolean Expression as well as the
NAND-Based Simplified circuit diagram.

(AB)+ (C'D)+ (EF'G) + (H' + AB'C))+(DE'H)

Answer:

Simplified Boolean Expression:

Using Electronic Workbench or Boolean algebra rules:

(AB) + (C'D) + (EF'G) + (H' + AB'C) + (DE'H)

= (AB) + (C'D) + (EF'G) + (H' + (AB'C)(H')) + (DE'H)

= (AB) + (C'D) + (EF'G) + H' + (AB'C)(H') + (DE'H)

= (AB + H') + (C'D) + (EF'G) + (AB'C)(H') + (DE'H)

= (A + H')(B + H') + (C'D) + (EF'G) + (AB'C)(H') + (DE'H)

Simplified Expression (Karnaugh Map or Quine-McCluskey


Algorithm):

(A + H')(B + C'D + EF'G) + (DE'H)

NAND-Based Simplified Circuit Diagram:

To generate the circuit diagram, I'll convert the simplified expression to


NAND logic.

((A + H')'(B + C'D + EF'G)' + (DE'H)')'

= ((A'H')'(B'C''D'' + E''F''G')' + (D'E''H')')

Using NAND gates:

= NAND(NAND(A, H'), NAND(B, NAND(C', D'), NAND(E, F', G)), NAND(D, E',
H'))

Circuit Diagram:
The circuit will consist of:

1. 3-input NAND gate: (A, H', (B NAND (C'D) NAND (EF'G)))

2. 3-input NAND gate: (D, E', H')

3. 2-input NAND gate: (output of step 1, output of step 2)

You might also like