Scribd
Upload
47 views5 pages

EXpt 2 - PDF

The document describes an experiment to implement and verify Demorgan's laws and other Boolean functions using logic gates. It lists the required components including NAND, NOR, AND, OR and NOT gates. The procedure connects the components according to circuit diagrams and applies logical inputs to observe and verify the outputs against truth tables. Demorgan's laws and other Boolean functions are expressed and their logic circuits shown with corresponding truth tables.

Uploaded by

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

EXpt 2 - PDF

The document describes an experiment to implement and verify Demorgan's laws and other Boolean functions using logic gates. It lists the required components including NAND, NOR, AND, OR and NOT gates. The procedure connects the components according to circuit diagrams and applies logical inputs to observe and verify the outputs against truth tables. Demorgan's laws and other Boolean functions are expressed and their logic circuits shown with corresponding truth tables.

Uploaded by

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

Ex No :2 Implementation of Logic circuits

AIM:
To implement the following Boolean function using standard logic gates and
universal gates and verify their truth tables.
i) Demorgan’s Law

ii)

APPARATUS REQUIRED:
SL No. COMPONENT SPECIFICATION QTY

1. NAND GATE 2 I/P IC 7400 1

2. NOR GATE IC 7402 1

3. AND GATE IC 7408 1

4. OR GATE IC 7432 1

5. NOT GATE IC 7404 1

3. IC TRAINER KIT - 1

PROCEDURE:
(i) Connections are given as per circuit diagram.
(ii) Logical inputs are given.
(iii) Observe the output and verify the truth table.
PIN Diagram:
Circuit Diagram:

Demorgan’s Law

i) (A.B)’=A’+B’

Truth Table
ii) (A+B)’=A’.B’

Truth Table

Boolean Function

After simplification using Boolean laws

Logic Circuit
Truth Table:

RESULT:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy