Digital Logic Design Laboratory Hand Book
Experiment No. 2
VERIFICATION / IMPLEMENTATION LAWS AND RULES OF
BOLLEAN ALGEBRA BY USING LOGIC GATES
(Assemble the circuit related to each Law and Rule,
manipulate the circuit and then display result.)
OBJECTIVE
Assemble different circuits using Logic Gates that implement the rules and laws of Boolean
algebra. Verifying their results of implementation.
EQUIPMENT
ePAL Trainer Board
Connecting wires
COMPONENTs
IC Type 7404 Inverters
IC Type 7408 Quadruple 2-input AND gates
IC Type 7432 Quadruple 2-input OR gates
THEORY
Boolean algebra is a convenient and systematic way of expressing and analyzing the
operation of logic circuits. Boolean Algebra is the mathematics we use to analyse
digital gates and circuits. Boolean Algebra is the mathematics of the digital system.
In 1954 George Boole publish a work titled an Investigation of the Laws of thought,
on which are founded the mathematics theories of logic and probabilities. It was in
this publication that a” Logical Algebra “known today as a Boolean Algebra, was
formulated.
LAWS OF BOOLEAN ALGRBRA;
Commutative Laws
Associative Laws
Distributive Laws
irfanriazshohab@gcuf.edu.pk 1
MSISDN +923338369095
Digital Logic Design Laboratory Hand Book
1. Commutative Laws;
• Commutative Law of Addition:
The commutative laws are applied to addition and multiplication. For addition, the commutative
law states In terms of the result, the order in which variables are ORed makes no difference.
A+B=B+A
• Commutative Law of Multiplication:
For multiplication, the commutative law states In terms of the result, the order in which
variables are ANDed makes no difference.
A*B=B*A
2. Associative Laws
Associative Law of Addition:
The associative laws are also applied to addition and multiplication. For addition, the associative
law states When ORing more than two variables, the result is the same regardless of the grouping
of the variables.
A + (B + C) = (A + B) + C
irfanriazshohab@gcuf.edu.pk 2
MSISDN +923338369095
Digital Logic Design Laboratory Hand Book
Associative Law of Multiplication:
For multiplication, the associative law states When ANDing more than two variables, the result is
the same regardless of the grouping of the variables.
A * (B * C) = (A * B) * C
3. Distributive Law
The distributive law is the factoring law. A common variable can be factored from an expression
just as in ordinary algebra. That is
A(B + C) = AB + AC
RULES OF BOOLEAN ALGEBRA;
Following Table lists of 12 basic rule that are useful in manipulating and simplifying Boolean
Expression. Rule 1 through 9 will be viewed in terms of their application to logic gate. Rule 10
through 12 will be derived in term of simpler rules and the laws previously discussed.
irfanriazshohab@gcuf.edu.pk 3
MSISDN +923338369095
Digital Logic Design Laboratory Hand Book
• Rule 1
A Variable ORed with 0 is always equal to the variable.
• Rule 2
A Variable ORed with 1 is always equal to the 1.
• Rule 3
A Variable ANDed with 0 is always equal to the zero.
irfanriazshohab@gcuf.edu.pk 4
MSISDN +923338369095
Digital Logic Design Laboratory Hand Book
• Rule 4
A Variable ANDed with 1 is always equal to the variable.
• Rule 5
A Variable ORed with itself is always equal to the variable.
• Rule 6
A Variable ORed with its complement is always equal to 1.
• Rule 7
A Variable ANDed with itself is always equal to the variable.
irfanriazshohab@gcuf.edu.pk 5
MSISDN +923338369095
Digital Logic Design Laboratory Hand Book
• Rule 8
A Variable ANDed with its complement is always equal to 0.
• Rule 9
The double complement of a variable is always equal to the variable.
• Rule 10
A + AB = A
=A+AB
= A(1+B)
= A(1)
=A
irfanriazshohab@gcuf.edu.pk 6
MSISDN +923338369095
Digital Logic Design Laboratory Hand Book
• Rule 11
• Rule 12
irfanriazshohab@gcuf.edu.pk 7
MSISDN +923338369095
Digital Logic Design Laboratory Hand Book
PROCEDURE
1. Make the connections as per the circuit diagrams given in Figures of each Laws and
Rules
2. Switch on Vcc and GND and apply various combinations of input according to the rules
and Laws for each circuit.
3. Note down the outputs readings
4. Verify the output for verification of Laws and Rules according to statements.
RESULTS & CALCULATIONS
Laws of Boolean algebra
Sr.No INPUT OUTPUT Remarks
Commutative Law A B C
1 of Addition 1 0
A+B=B+A
0 1
Commutative Law A B C
2 of Multiplication 1 0
A.B=B.A
0 1
Associative Law of A B C L.HS R.H.S
3 Addition 0 0 0
A+(B+C)=(A+B)+C
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
irfanriazshohab@gcuf.edu.pk 8
MSISDN +923338369095
Digital Logic Design Laboratory Hand Book
1 1 0
1 1 1
Associative Law of A B C L.HS R.H.S
3 Multiplication 0 0 0
A.(B.C)=(A.B).C
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
A B C L.HS R.H.S
4 Distributive Law 0 0 0
A(B+C)=AB+BC
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Rules of Boolean algebra
Sr.No INPUT OUTPUT Remarks
A B C
1 A+0=A 1 0
0 0
A B C
2 A+1=A 1 1
0 1
A B C
3 A.0=A 1 0
0 0
irfanriazshohab@gcuf.edu.pk 9
MSISDN +923338369095
Digital Logic Design Laboratory Hand Book
A B C
4 A.1=A 1 1
0 1
A B(A) C
5 A+A=A 1 1
0 0
A B(A’) C
6 A+A’=1 1 0
0 1
A B(A) C
7 A.A=A 1 1
0 0
A B(A’) C
8 A.A’=0 1 0
0 1
A C
9 A’’=A 1
0
A B L.HS R.H.S
10 A+AB=A A+AB A
0 0
0 1
1 0
1 1
A B L.HS R.H.S
11 A+A’B=A+B A+A’B A+B
0 0
0 1
1 0
1 1
A B L.HS R.H.S
12 (A+B)(A+C)=A+B C (A+B)(A+C) A+B
0 0 0
0 0 1
irfanriazshohab@gcuf.edu.pk 10
MSISDN +923338369095
Digital Logic Design Laboratory Hand Book
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
CONCLUSION
-------------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------------
--------------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------------
--------------------------------------------------------------------------------------------
irfanriazshohab@gcuf.edu.pk 11
MSISDN +923338369095
