Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

BOOLEAN ALGEBRA LAWS

AND RULES

BOOLEAN ALGEBRA BASICS

• Variable, complement, and literal are terms used in Boolean algebra.

• A variable is a symbol used to represent a logical quantity. Any single variable can
have a 1 or a 0 value.
• The complement is the inverse of a variable and is indicated by a bar over variable
(overbar). For example, the complement of the variable A is A̅ . If A = 1, then
A̅ = 0. If A = 0, then A̅ = 1.
• Sometimes a prime symbol rather than an overbar is used to denote the complement
of a variable; for example, B' indicates the complement of B. A literal is a variable or
the complement of a variable.

Boolean Addition:

• Addition is equivalent to the OR operation.

• The sum term is 1 if one or more of the literals are 1. The sum term is zero
only if each literal is 0.
• In Boolean algebra, a sum term is a sum of literals. Some examples of
sum terms are A + B, A +B + C, and A + B + C + D.

Boolean Multiplication:

• Boolean multiplication is equivalent to the AND operation.

• In Boolean algebra, a product term is the product of literals.
• Some examples of product terms are AB, AB̅ , ABC and ABC̅ D.A
product term is equal to 1 only if each of the literals in the term is 1.

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 1

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

Laws Of Boolean Algebra:

The basic laws of Boolean algebra-the commutative laws for addition and
multiplication, the associative laws for addition and multiplication, and the
distributive law-are the same as in ordinary algebra.

Commutative Laws

1. The commutative law of addition for two variables is written as

A+B = B+A
This law states that the order in which the variables are ORed makes no
difference. Remein Boolean algebra addition and the OR operation are the
same. Figure illustrates the commutative law as applied to the OR gate and
shows that it doesn't matter to which input each variable is applied. (The
symbol ≡ means "equivalent to."). The circuit and the truth table are as follows:

2. The commutative law of multiplication for two variables is written

as A.B = B.A
This law states that the order in which the variables are ANDed makes no
difference. Figure, il1ustrates this law as applied to the AND gate. The
circuit and the truth table are as follows:

Associative Laws :
1. The associative law of addition is written as follows for three variables:
A + (B + C) = (A + B) + C
This law states that when ORing more than two variables, the result is
the same regardless of the grouping of the variables. Figure illustrates

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 2

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

this law as applied to 2-input OR gates. The circuit and truth table are as
follows:

2. The associative law of multiplication is written as follows for three

variables:
A(BC) = (AB)C
This law states that it makes no difference in what order the variables
are grouped when ANDing more than two variables. Figure illustrates
this law as applied to 2-input AND gates. The circuit and truth table
are as follows:

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 3

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

Distributive Law:
1. The distributive law is written for three variables as follows: A(B
+ C) = AB + AC
This law states that ORing two or more variables and then ANDing the
result with a single variable is equivalent to ANDing the single variable
with each of the two or more variables and then ORing the products. The
circuit and truth table are as given below:

Rules of Boolean Algebra: Table lists the Basic rules of Boolean algebra.

Rule 1. A + 0 = A

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 4

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

A variable ORed with 0 is always equal to the variable. If the input variable
A is 1, the output variable X is 1, which is equal to A. If A is 0, the output is
0, which is also equal to A.

Rule 2: A + 1 = 1
A variable ORed with 1 is always equal to 1. A 1 on an input to an OR gate
produces a 1 on the output, regardless of the value of the variable on the other
input.

Rule 3: A . 0 = 0
A variable ANDed with 0 is always equal to 0. Any time one input to an AND
gate is 0, the output is 0, regardless of the value of the variable on the other
input.

Rule 4: A . 1 = A
A variable ANDed with 1 is always equal to the variable. If A is 0 the output
of the AND gate is 0. If A is 1, the output of the AND gate is 1 because both
inputs are now 1s.

Rule 5: A + A = A
A variable ORed with itself is always equal to the variable. If A is 0, then 0 + 0
= 0; and if A is 1, then 1 + 1 = 1. This is shown in Figure where both inputs are
the same variable.

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 5

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

Rule 6: A + A = 1
A variable ORed with its complement is always equal to 1. If A is 0, then 0
+0 = 0 + 1 = 1. If A is l, then 1 + 1 = 1+ 0 = 1. See Figure, where one input
is the complement of the other.

Rule 7: A . A = A
A variable ANDed with itself is always equal to the variable. If A = 0, then
0.0 = 0; and if A = 1. then 1.1 = 1.

Rule 8: A . A = 0
A variable ANDed with its complement is always equal to 0. Either A or A will
always be 0: and when a 0 is applied to the input of an AND gate. the output
will be 0 also.

̅
Rule 9: 𝐴̅= A
The double complement of a variable is always equal to the variable. If you
start with the variable A and complement (invert) it once, you get A. If you then
take A and complement (invert) it, you get A, which is the original variable.

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 6

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

Rule 10. A + AB = A
This rule can be proved by applying the distributive law, rule 2, and rule 4 as
follows:
A + AB = A( 1 + B) Factoring (distributive law)
=A.l Rule 2: (1 + B) = 1
=A Rule 4: A . 1 = A

Rule 11: A + AB = A + B
This rule can be proved as follows:
A + AB = (A + AB) + A̅ B Rule 10: A = A + AB
= (AA + AB) + A̅ B Rule 7: A = AA
=AA +AB +AA̅ +A̅ B Rule 8: adding AA̅ = 0
= (A + A̅ )(A + B) Factoring
= 1. (A + B) Rule 6: A + A̅ = 1
=A + B Rule 4: drop the 1

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 7

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

Rule 12: (A + B)(A + C) = A + BC This

rule can be proved as follows:
(A + B)(A + C) = AA + AC + AB + BC Distributive law
= A + AC + AB + BC Rule 7: AA = A
= A( 1 + C) + AB + BC Rule 2: 1 + C = 1
= A. 1 + AB + BC Factoring (distributive law)
= A(1 + B) + BC Rule 2: 1 + B = 1
= A. 1 + BC Rule 4: A . 1 = A
= A + BC

Exercises:

1. Apply Associative law to the given expression A+(B+C+D)

Answer : A+ (B+C+D)= (A+B+C)+D

2. Apply Distributive law to the given expression A(B+C+D)

Answer : A(B+C+D)= AB+AC+AD

3. Draw a logic circuit and truth table for (A + B)C.

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 8

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

4. Draw a logic circuit and truth table for AB+̅𝑨𝑪̅̅̅.

5. Find the Boolean algebra expression for the following system.

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 9

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 10

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

Solution:

Inputs Intermediates Output

A B A.B A+B Q

0 0 1 1
0

0 1 0 0 0

1 0 0 0 0
1 1 1 0 1

Exercises to Self Test:

Draw a logic circuit for A + BC + D̅ .
Draw a logic circuit for ̅(̅𝐴̅̅ ̅+̅̅̅̅ 𝐵̅̅̅)(C + D)𝐶̅.
•

• Draw a truth table for (P+Q)(P+R).

• Draw a truth table for W(X+Y)Z

• Find the Boolean algebra expression for the following system.

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 11

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

Page
• Find X in the below circuit:

• Find the result / output of Expression:

: BASIC OF LOGIC DESIGN

Boolean Algebra
Demorgan’s theorem :
 A famous mathematician DeMorgan invented the two most important
theorems of Boolean algebra.

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 12

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

 These theorems play an important role in solving various Boolean algebra

expressions.

Two theorem are

1. DeMorgan's first theorem

2. DeMorgan's second theorem

1. DeMorgan's first theorem is stated as follows:

 The complement of a product of variables is equal to the sum of complements

of the variables.

Stated another way,

 The complement of two or more variables ANDed is equivalent to the OR of
the complements of the Individual variables.

 The formula for expressing this theorem for two variables

2. DeMorgan's second theorem is stated as follows:

 The complement of a sum of variables is equal to the product of the
complements of the variables.

Stated another way,

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 13

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

 The complement of two or more variables ORed is equivalent to the AND of

the complements of the individual variables.

 The formula for expressing this theorem for two

. variables

Standard forms of Boolean expressions

 Boolean expressions can be written in the sum-of-products form (SOP) or in the product-
of-sums form (POS).

 In both forms, an over bar cannot extend over more than one variable.

1. Sum of Products form(SOP) : The Sum of Product (SOP) expression comes

from the fact that two or more products (AND) are summed (OR) together.

Product terms are : (A.B) , (B.C) , (A,1)

If we sum all these terms together , will get SOP form SOP =
(A.B) + (B.C) + (A.1)

2. Product of Sums form(POS) : The Product of Sum (POS) expression comes

from the fact that two or more sums (OR’s) are AND’ed together.

Sum terms are : (A + B), (B + C) , (A + 1)

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 14

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

If we product (AND’ed) all these terms together , will get POS form
POS = (A + B).(B + C).(A + 1)

Simplification of Boolean expressions

Every Boolean expression must be simplified before realization
because it reduces the cost, and complexity of the digital hardware
and increases its reliability.
To reduce Boolean expressions , all the laws, rules & theorems of
Boolean algebra may be used & procedure as follows :

a. Multiply all variables necessary to remove parenthesis.

b. Look for identical terms. Retain only one of those terms and
drop all others for example:
AB+AB+AB+AB=AB
AB.AB.AB.AB=AB
c. Look for pairs of variable and its negation in the same term .
this term can be dropped for example
A.BB=A.0=0
d. Look for pair of terms that are identical except for one variable
simplify this expression for example
ABCD+ABC=ABC(D+1)=ABC.1=AB
C
e. Look for the pairs of terms which have one or more variables
complemented & apply Demorgans theorems to separate
complement operator or bar.

 Classify the Boolean expressions into SOP & POS

1. A+BC
2. AB+CD+EF
3. (A+B)(B+C+D)
4. AB+A+1
5. (A+B+C)(C+D+E)(B+C+D)
6. A(B+C)(A+C)

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 15

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

Solution :

SOP POS
A+BC (A+B)(B+C+D)
AB+CD+EF (A+B+C)(C+D+E)(B+C+D)
AB+A+1 A(B+C)(A+C)

 Simplify POS expression :

 Simplify SOP expression :

 Simplify using Demorgan’s theorem

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 16

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

1. AB+CD

X = (A + B)*CD
X = ACD+ BCD
2. (AB+AB)(A+B
)

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 17

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

5. F2 = (X+Z)(XY
)

 Verify the above expressions using truth table

1. A.B+B=B

A B A.B A.B+B
0 0 0 0
0 1 0 1
1 0 0 0
1 1 1 1

2. B.(A  B)=AB

A B B A+B B.(A  B) AB
0 0 1 1 0 0
0 1 0 0 0 0
1 0 1 1 0 0
1 1 0 1 1 1

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 18

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

BOOLEAN ALGEBRA LAWS

AND RULES

SIMPLIFICATION OF BOOLEAN EXPRESSION

• Every Boolean expression must be simplified before realization

because it reduces the cost, and complexity of the digital
hardware and increases its reliability.
• The purpose of simplification is to reduce a particular
expression to its simplest form or change its form to a more
convenient one to implement the expression efficiently.
• To reduce Boolean expressions, all the laws, rules & theorems
of Boolean algebra may be used.
• A simplified Boolean expression uses the fewest gates possible
to implement a given expression.

Simplify the following Expressions:

1. Y= ACD+A CD
=CD(A+AB) Because A+AB̅ =A+B
=CD(A+B)
=ADC+BCD

2. Y=̅𝑨̅̅𝑩̅̅̅̅+̅̅̅𝑪̅
̅̅ ̅̅ ̅̅̅
=(𝐴𝐵). ̅ C̅
𝐵̿=B
By De-Morgan’s theorem
=(𝐴̅+𝐵̿).C̅
=(A̅ +B).C̅

3. Y= BC+BC̅ +BA
=B(C+C̅ )+BA Because C+C̅ =1.
= B.1+BA
=B(1+A) Because 1+A=1
=B

4. Y= AB+AB’+A’C+A’C’

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 19

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

=A(B+B’)+A’(C+C’) Because B+B’=1

=A.1+A’.1
=A+A’
=1

Note: (Observe the use of prime symbol instead of overbar

for complement in the above example).
5. Y=AB + A(B + C) + B(B + C)

Step 1: Apply the distributive law to the second and third terms in the
expression, as follows:
=AB + AB + AC + BB + BC
Step 2: Apply rule 7 (BB = B) to the fourth term.
=AB + AB + AC + B + BC
Step 3: Apply rule 5 (AB + AB = AB) to the first two terms.
= AB + AC + B + BC
Step 4: Apply rule 10 (B + BC = B) to the last two terms.
=AB + AC + B
Step 5: Apply rule 10 (AB + B = B) to the first and
third terms. =B+AC

6. Y= AB+ABC+ABCD+ABCDE+ABCDEF
= AB(1+C)+(ABCD+ABCDE)+ABCDEF (Because
1+C=1)
=AB+ABCD(1+E)+ ABCDEF (Because 1+E=1)
=AB+ABCD+ABCDEF
=AB+ABCD(1+EF) (Because (1+EF=1))
=AB+ABCD
=AB(1+CD) (Because
(1+CD=1)) =AB

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 20

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

̅ ̅̅ ̅ ̅̅ ̅̅̅ ̅̅ ̅̅̅̅̅
𝑨(𝑩̅𝑪̅+𝑩𝑪)=𝑨̅+
(𝑩+𝑪)(𝑩̅+𝑪̅)
7. Show the following equality holds:

̅ ̅ ̅̅ ̅̅ ̅̅̅ ̅̅̅ ̅̅̅̅

LHS= 𝐴(𝐵̅𝐶+
̅ 𝐵𝐶)
̅̅̅ ̅
=𝐴̅+(𝐵𝐶 ̅ ̅)(̅𝐵𝐶̅̅̅̅) Because of De-
Morgan’s theorem
=𝐴̅+(𝐵+𝐶)(𝐵̅+𝐶̅)
= RHS
8. Express the Boolean function: XY+YZ+Y̅ Z=XY+Z
LHS = XY+ YZ+ Y̅ Z
= XY + Z(Y+Y̅ )
Because of Y+Y̅ =1 = XY + Z.1
= XY + Z
= RHS

9. Express the Boolean function: 𝑨𝑩̅̅̅̅(𝑨̅+𝑩)(𝑩̅+𝑩)= A̅

LHS= ̅𝐴𝐵̅̅̅(𝐴̅+𝐵)(𝐵̅+𝐵) Commutative
Law And
= (A̅ + B̅ )(A̅ B̅ + A̅ B + BB̅ + BB) De-morgan’s
theorem
= (A̅ + B̅ )(A̅ (B̅ + B)+0+B) B.B̅ =0 And
BB=B
= (A̅ + B̅ )(A̅ + B) Commutative law
= A̅ A̅ + A̅ B + A̅ B̅ + B̅ B A̅ .A̅ =A̅ and
B.B̅ =0
= A̅ + A̅ (B + B̅ ) B+B̅ =1
= A̅ + A̅ (A̅ + A̅ = A̅ )
= A̅

10. Prove That : A̅ (A + B) + (B + AA) (A + B̅ ) = B + A

LHS = A̅ (A + B) + (B + AA) (A + B̅ ) A.A=A
= A̅ A + A̅ B + (B + A) (A Commutative law and
+ B̅ ) A.A̅ =0

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 21

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

= A̅ B + AB + BB̅ + AA + B.B̅ =0 and A.A=A

AB̅
= B(A̅ + A) + A + AB̅ A̅ + A= 1
= B + A(1 + B̅ ) 1 + B̅ =1
=B+A
= RHS

11. Verify the below equation using Truth Table:

12. Convert the following logic circuits into Boolean Expression:

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 22

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

EXERCISES:

1. Guess the difference between these circuits:

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 23

Basics of Digital Logic and Computer Organization 25CS11I 2025-2026

[𝐴𝐵̅(𝐶+𝐵𝐷)+𝐴̅𝐵̅]𝐶
2. Simplify the Following Boolean Expressions:
•
• AB̅ C(BD+CDE) + AC̅
• A(A + A̅ ) + B
• (A + B) (A̅ + B) B̅
• (B + BC) (B + B̅ C) (B + D)

3. Prove the following:

• XY(X’YZ’ + XY’Z’ + XY’Z’) = XYZ’(X’Y+XY’)
• AB + AB’ + A’C +A’C’ = 1

• ̅𝐴𝐵̅̅̅̅+̅̅̅𝐴𝐶̅̅̅+𝐴̅𝐵̅𝐶 = A̅ + B̅ C̅
• (A + C)(AD + AD’) + AC + C = A + C

4. Verify the below equation using truth table

• ̅𝐴𝐵̅̅̅̅+̅̅̅𝐴𝐶̅̅̅+𝐴̅𝐵̅𝐶 = A̅ + B̅ C̅
• (A + C)(AD + AD’) + AC + C = A + C

COMPUTER SCIENCE & ENGINEERING BY- Sushant Savant L/CS Page 24