Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
33 views7 pages

DLD Assignment 3

This lab experiment involves verifying the truth table of an XOR gate using Boolean algebra and an actual XOR gate. It also involves verifying the two parts of De Morgan's theorem. The required equipment includes a trainer set, AND gates, NOT gates, an OR gate, and wires. Task 1 involves implementing an XOR gate using AND, NOT, and OR gates and verifying it matches the truth table. It also uses an actual XOR gate to verify the truth table. Task 2 involves verifying the two parts of De Morgan's theorem by constructing logic diagrams and truth tables.

Uploaded by

asimnisar5555
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
33 views7 pages

DLD Assignment 3

This lab experiment involves verifying the truth table of an XOR gate using Boolean algebra and an actual XOR gate. It also involves verifying the two parts of De Morgan's theorem. The required equipment includes a trainer set, AND gates, NOT gates, an OR gate, and wires. Task 1 involves implementing an XOR gate using AND, NOT, and OR gates and verifying it matches the truth table. It also uses an actual XOR gate to verify the truth table. Task 2 involves verifying the two parts of De Morgan's theorem by constructing logic diagrams and truth tables.

Uploaded by

asimnisar5555
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/ 7

LAB EXPERIMENT 3

Lab Title:
A) Verify the truth table of an XOR gate by implementing the
Boolean equation: Y = A(not)B + AB(not). And also by using an
XOR gate directly.
B) Verify both parts of the De Morgan’s Theorem.
Lab Equipment:
 Trainer set
 2 AND gate
 2 NOT gate
 OR gate
 Two Inputs of AND gate
 Two Inputs of Not gate
 Wires
 Voltage

Task No 1.
1. ) AND+NOT+OR Gate Methodology:

Use Two AND Gates:


 Connect the inputs A and B to the first AND gate.
 Connect the inputs A and B to the second AND gate.

Invert Inputs with NOT Gates:

 Connect input A to a NOT gate. The output is A (not).


 Connect input B to another NOT gate. The output is B (not).

Combine Results with OR Gate:


 Connect the output of the first AND gate to one input of an OR
gate.
 Connect the output of the second NOT gate to the same OR
gate.
 The output of this OR gate is the XOR result.

Truth Table

A B A(not) B(not) Y = A(not)B + AB(not)

0 0 1 1 0
0 1 1 0 1
1 0 0 1 0
1 1 0 0 0

Logic Diagram

Boolean Equation
Y = A(not)B + AB(not)

XOR gate directly:


 Exclusive OR (XOR) gate performs exclusive disjunction.
 Symbol representation: ⊕ or XOR.
 Two input terminals (A and B) and one output terminal.
 Logical expression: A⊕B.
 Applications: Used in binary addition, error detection, and
sequential circuits.
 Behavioural description: Outputs true only when the number of
true inputs is odd.
 Equivalent gates: Can be constructed using AND, OR, and NOT
gates.
 Commutative property: A⊕B=B⊕A.
 Physical implementation: Implemented using electronic
components like transistors.
 Exclusive nature: Produces true output only when inputs are
different.

Truth Table

A B A(not)B

0 0 0
0 1 1
1 0 1
1 1 0
Task No 1.
2. ) De Morgan’ Theorem Part 1 and 2
Part 01
 States that the complement of the product of two variables is
equal to the sum of their complements.
 Mathematically, it can be expressed as: |AB| = |A| + |B|.

Truth Table

A B A(not) B(not) AB A(not)B A(not) + B(not)

0 0 1 1 0 1 1
0 1 1 0 0 1 1
1 0 0 1 0 1 1
1 1 0 0 1 0 0

Mathematical Form:
|AB| = |A| + |B|.

Diagram:

Part 2
 States that the complement of the sum of two variables is
equal to the product of their complements.
 Mathematically, it can be expressed as |A+B| = |A|.|B|.
Truth Table

A B A(not) B(not) A+B A+B(not) A(not) x B(not)

0 0 1 1 0 1 1
0 1 1 0 1 0 0
1 0 0 1 1 0 0
1 1 0 0 1 0 0

Mathematical Form:
|A+B| = |A|.|B|.

Diagram:

You might also like