Shri VaishnavSM Institute of Technology & Science, Indore

Discipline Department of Electrical & Electronics Engineering Pages: 1/4

Subject Name: Digital Logic and Circuit Design Sub. Code: BTEC104 Experiment No.: 02

Name: Roll No.:

Details of Submissions & Performance
Performing Submission
Regular Turn Extra Turn First Second
Remarks and Grade by Tutor:

Cross Grade Exc VG G Fr M F Signature

EXPERIMENT NO. – 02

1.0 Aim: -
To verify the DeMorgan’s Theorem.

2.0 Objectives: -
2.1 Study of Boolean Algebra and implementing them by using logic gates.
2.2 Implementing and verify DeMorgan’s theorem by using logic gates.

3.0 Pre – Requisites: -

3.1 Knowledge of Binary Number System.
3.2 Knowledge of pin diagrams of all logic gates.
3.3 Knowledge of DC and AC Power Supply.
3.4 Knowledge of Boolean Algebra.
3.5 Knowledge of DeMorgan’s Theorem.

4.0 Apparatus Requirements: -

4.1 DC Power Supply (5 Volt)
4.2 Logic Gates IC’s
4.3 Breadboard
4.4 SPDT Switches
4.5 LED’s
4.6 Resistors
4.7 Connecting Wires

5.0 Theory: -
The digital circuit can be made up of several logic gates. To perform the logical operation
with minimum logic gates, a set of rules were invented, known as the Laws of Boolean Algebra.
These rules are used to reduce the number of logic gates for performing logic operations.
Boolean algebra was introduced by a famous mathematician “George Boole”.
Boolean algebra is the category of algebra in which the variable’s values are the truth
values, true and false, ordinarily denoted 1 and 0 respectively. It is used to analyze and simplify
digital circuits or digital gates. It is also called Binary Algebra or logical Algebra. It has been
fundamental in the development of digital electronics and is provided for in all modern
programming languages. It is also used in set theory and statistics.

Study Group. Digital Electronics Modified by: Nitin Saravagi

Created by: Nitin Saravagi Date of Creation: 14/09/2022 Date of Modification:
Rev. No. EC/DE/01/2022 Approved by: HOD
 Shri VaishnavSM Institute of Technology & Science, Indore
Discipline Department of Electrical & Electronics Engineering Pages: 2/4
Subject Name: Digital Logic and Circuit Design Sub. Code: BTEC104 Experiment No.: 02

The important operations performed in Boolean algebra are – conjunction (AND

denoted by ∩ or . ), disjunction (OR denoted by U or +) and negation (NOT denoted by ˉ ).
Rules in Boolean algebra
1. Only two values (1 for high and 0 for low) are possible for the variable used in Boolean
algebra.
2. The overbar ( ˉ ) is used for representing the complement variable. So, the complement of
variable A is represented as Ᾱ.
3. The plus ( + ) operator is used to represent the ORing of the variables.
4. The dot ( . ) operator is used to represent the ANDing of the variables.
Laws of Boolean algebra
These are the following laws of Boolean algebra:
Annulment Law
When the variable is AND with 0, it will give the result 0, and when the variable is OR with
1, it will give the result 1, i.e.,
A.0=0
A+1=1
Identity Law
When the variable is AND with 1 and OR with 0, the variable remains the same, i.e.,
A.1=A
A+0=A
Idempotent Law
When the variable is AND or OR with itself, the variable remains same or unchanged, i.e.,
A.A=A
A+A=A
Complement Law
When the variable is AND or OR with its complement, it will give the result 0 and 1
respectively.
A.Ᾱ=0
A+Ᾱ=1
Double Negation Law
This law states that, when the variable comes with two negations, the symbol gets
removed and the original variable is obtained.

=A
Commutative Law
This law states that no matter in which order we use the variables. It means that the order
of variables doesn't matter in this law.
A.B=B.A
A+B=B+A
Associative Law
This law states that the operation can be performed in any order when the variables
priority is of same as '*' and '/'.
(A . B) . C = A . (B . C)
(A + B) + C = A + (B + C)
Distributive Law
This law allows us to open up of brackets. Simply, we can open the brackets in the
Boolean expressions.
 Shri VaishnavSM Institute of Technology & Science, Indore
Discipline Department of Electrical & Electronics Engineering Pages: 3/4
Subject Name: Digital Logic and Circuit Design Sub. Code: BTEC104 Experiment No.: 02

A + (B . C) = (A + B) . (A + C)
A . (B + C) = (A . B) + (A . C)
Absorption Law
This law allows us for absorbing the similar variables.
A + (A . B) = A
A . (A + B) = A
While George Boole’s set of laws and rules allows us to analyses and simplify a digital
circuit, there are two laws within his set that are attributed to Augustus DeMorgan (a nineteenth
century English mathematician) which views the logical NAND and NOR operations as
separate NOT AND and NOT OR functions respectively.
DeMorgan’s Theorem:
DeMorgan’s Theorems are basically two sets of rules or laws developed from the
Boolean expressions for AND, OR and NOT using two input variables, A and B. These two rules
or theorems allow the input variables to be negated and converted from one form of a Boolean
function into an opposite form.
DeMorgan’s first theorem states that two (or more) variables NOR´ed together is the
same as the two variables inverted (Complement) and AND´ed, while the second theorem states
that two (or more) variables NAND´ed together is the same as the two terms inverted
(Complement) and OR´ed.
DeMorgan’s First Theorem:
DeMorgan’s First theorem proves that when two (or more) input variables
are AND’ed and negated, they are equivalent to the OR of the complements of the individual
variables. Thus the equivalent of the NAND function will be a negative-OR function, proving that
.
DeMorgan’s Second Theorem
DeMorgan’s Second theorem proves that when two (or more) input variables
are OR’ed and negated, they are equivalent to the AND of the complements of the individual
variables. Thus the equivalent of the NOR function is a negative-AND function proving that

6.0 Truth Table:

6.1 DeMorgan’s First Theorem:

Inputs Outputs for each Terms

A B A.B

0 0 0 1 1 1 1

0 1 0 1 1 0 1

1 0 0 1 0 1 1

1 1 1 0 0 0 0
 Shri VaishnavSM Institute of Technology & Science, Indore
Discipline Department of Electrical & Electronics Engineering Pages: 4/4
Subject Name: Digital Logic and Circuit Design Sub. Code: BTEC104 Experiment No.: 02

6.2 Demorgan’s Second Theorem:

Inputs Outputs for each Terms

A B A+B

0 0 0 1 1 1 1

0 1 1 0 1 0 0

1 0 1 0 0 1 0

1 1 1 0 0 0 0

7.0 Questions to Be Answered: -

7.1 What do you mean by Bit, Byte & Nibble?
7.2 Write and prove Demorgan’s 1st & 2nd theorem with statements?
7.3 What is duality theorem? Explain it’s principle with examples.
7.4 What is the use of DeMorgan’s theorem? Explain in brief.

8.0 Students should submit in their own handwriting: -

8.1 Truth table.
8.2 Answer of the given questions.

References: -
 Moris Mano; "Digital Logic & Computer Design"; PHI.