PRACTICAL 2 - BOOLEAN LAWS SIMPLIFICATION

PRACTICAL NO: 2

AIM: Simplify given Boolean expression and realize it.

SOLUTION:

A set of rules or Laws of Boolean Algebra expressions have been invented to help reduce the number
of logic gates needed to perform a particular logic operation resulting in a list of functions or
theorems known commonly as the Laws of Boolean Algebra.

Boolean Algebra is therefore a system of mathematics based on logic that has its own set of rules or
laws which are used to define and reduce Boolean expressions.

The variables used in Boolean Algebra only have one of two possible values, a logic “0” and a logic
“1” but an expression can have an infinite number of variables all labelled individually to represent
inputs to the expression, for example, variables A, B, C etc, giving us a logical expression of A + B = C,
but each variable can ONLY be a 0 or a 1.

Laws of Boolean Algebra

There are six types of Boolean algebra laws. They are:

 Commutative law

Commutative law states that changing the sequence of the variables does not have any effect on the
output of a logic circuit.

A. B = B. A

A+B=B+A

 Associative law

It states that the order in which the logic operations are performed is irrelevant as their effect is the
same.

(A. B). C = A. (B. C)

(A + B) + C = A + (B + C)

 Distributive law

Distributive law states the following conditions:

A. (B + C) = (A. B) + (A. C)

A + (B. C) = (A + B). (A + C)

SMRITI.M. DUBEY Page no

 PRACTICAL 2 - BOOLEAN LAWS SIMPLIFICATION

 AND law

These laws use the AND operation. Therefore, they are called AND laws.

A .0 = 0

A. 1 = A

A. A = A

A.A’ = 0

 OR law

These laws use the OR operation. Therefore, they are called OR laws.

A+0=A

A+1=1

A+A=A

A+ A’ = 1

 Inversion law

In Boolean algebra, the inversion law states that double inversion of variable results in the original
variable itself.

A’’ = A

The Boolean expression is taken from the combinations where F = 1, so

Example no 1

F = A'BC + AB'C' + AB'C + ABC' + ABC

F= AB’(C’+C) + AB (C’+ C) + A’BC

F = AB’ (1) + AB (1) + AB’C

F = AB’+AB+AB’C

F = A(B’+B) + AB’C

F = A+AB’C

F = (A+A’).(A+BC)

Y = A+BC

Step 1: Open the Logisim software

SMRITI.M. DUBEY Page no

 PRACTICAL 2 - BOOLEAN LAWS SIMPLIFICATION

Step 2: Go to Gates Click on AND gate After clicking on AND gate you will see the description of
AND gate in the Selection Tab: AND Gate. Check the no. of inputs i.e., data bits if the input is two
change it one; the output will always be one

Step 3: For the inputs go to the green rectangle of ADD PIN and for the output we will add the LED
button i.e., Green Circle of ADD PIN.

Step 4: In order to connect the input pin and the AND and OR gate pin we will drag the cursor from
the OR and AND gate to the input pin and vice versa for the output.

Step 5: For running the connected circuit go to the HAND TOOL also known as Changing values
within circuit and then change the values of the input and check the output.

Example no 2
2) Y = BAC’+B’AC’+B.C’
Y = AC’ (B+B’) +BC’
Y = AC’ (1) + BC’
Y = AC’+BC’
Y = (A+B).C’

Step 1: Open the Logisim software

Step 2: Go to Gates Click on AND, NOT and OR gate After clicking on AND, OR and NOT gate you
will see the description of AND, NOT and OR gate in the Selection Tab: AND, NOT and OR Gate.
Check the no. of inputs i.e., data bits if the input is two change it one; the output will always be one

Step 3: For the inputs go to the green rectangle of ADD PIN and for the output we will add the LED
button i.e., Green Circle of ADD PIN.

Step 4: In order to connect the input pin and the AND, NOT and OR gate pin we will drag the cursor
from the AND, NOT and OR gate to the input pin and vice versa for the output.

SMRITI.M. DUBEY Page no

 PRACTICAL 2 - BOOLEAN LAWS SIMPLIFICATION

Step 5: For running the connected circuit go to the HAND TOOL also known as Changing
values within circuit and then change the values of the input and check the output.

SMRITI.M. DUBEY Page no