CHAPTER - 2

BOOLEAN ALGEBRA

Boolean Algebra is also called as Switching Algebra.

Binary Valued Quantities:- The values 0(False) and 1(True) are called binary
valued quantities.

Binary Valued Variables:- The variables which can store the truth values 0(False)
and 1(True) are called binary valued variables. These variables can store one of the
two values 1 or 0(True or false).

Truth Table:- Truth table is a table which represents all the possible values of
logical variables / statements along with all the possible results for the given
combinations of values.

Logical statements can have only one of the two values 1(True) of 0(False)

Example:- In the truth table below X and Y are the logical statements and R is the
result.

X Y R
0 0 0
0 1 0
1 0 0
1 1 1

Tautology:- If result of any logical statements or expression is always 1(True) is

called Tautology.

Fallacy:- If the result of any logical statement or expression is always O(false) is

called fallacy.
Logical Operations:- An Operation which uses the logical operators like AND
OR and NOT is known as logical operation.

There are three types of logical operators:-

(i) AND Operator

(ii) OR Operator

(iii) NOT Operator

AND Operator
AND Operator takes two or more input variables and generates the only one output.
It performs the logical multiplication operation of Boolean algebra and is denoted
by symbol dot(.). Thus X.Y will be read as X AND Y.

Rules for AND operations

0.0=0

0.1=0

1.0=0

1.1=1

Truth Table for AND Operator

X Y R
0 0 0
0 1 0
1 0 0
1 1 1

In the truth table only when both X and Y are true the result X.Y is true. If any one of
X and Y is 0, the result is 0.
 x y

Venn diagram for AND operator (X.Y)

The shaded area denotes the X.Y result.

OR Operator

OR Operator takes two or more input variables and generates the only one output.
OR Operator performs the logical addition operation of Boolean algebra and is
denoted by a symbol Plus(+). Thus X+Y will be read as X OR Y.

The rules for OR operation are :-

0+0=0

0+1=1

1+0=1

1+1=1

The truth table for OR operator

X Y X+Y .
0 0 0
0 1 1
1 0 1
1 1 1

In the truth table when any one or both X and Y is 1, the result X+Y is 1, and if both
X and Y is 0, X+Y is 0.
Venn Diagram for OR operator (X+Y)

The shaded are result X+Y

NOT Operator

This is an unary operator. It operates on single variable and operation performed by

NOT Operator is called complementation, and is denoted by a symbol bar(-).

Thus Rules for NOT Operator.

0=1

1=0

Truth Table for NOT operator

X X
o 1
1 0

In the truth table if X value is 0 then X will be 1 and if X value is 1 then X will
result 0.

Note: - (negation) is also used for the complementation symbol.

X X

Venn diagram for NOT Operator

Venn diagram for X is given above where shaded area depicts X.

Evaluation of Boolean Expressions Using Truth Table

A Boolean expression will be evaluated using precedence rules. The order of

evaluation of an expression is called as precedence. The precedence is, firstly
NOT, then AND and then OR. If there is parenthesis, then the expression in
parenthesis is evaluated first.

Logical variables are combined by means of logical operators AND,

OR and NOT to form a Boolean expression.
For example:-X+Y.Z+Z is a Boolean expression.
It is often convenient to shorten X.Y.Z to XYZ and using this
convention, above expression can be written as X+YZ+Z

Example 1:- Consider the expression X+YZ. Here three variables X, Y, Z are
forming the expression.

Solution:- Each variable can assume the value 0 or 1. The possible combinations of
values may be arranged in ascending order as in Table 1.1

X Y Z Since X, Y, and Z are the three (3) variables in total. A truth

0 0 0 table involving 3 input variables will have 23 = 8 rows or
0 0 1
0 1 0 combinations in total.
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

Table 1.1 Possible Combinations of X, Y and Z

 So a column is added to list Y.Z (Table 1.2)
X Y Z Y.Z
0 0 0 0
0 0 1 0
0 1 0 0 AND operation is applied only on columns Y and Z.
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 1

Table 1.2 Truth Table for (Y.Z)

One more column is now added to list the values of YZ (Table 1.3)

X Y Z Y.Z YZ
0 0 0 0 1
0 0 1 0 1 Note that YZ contains complemented values of YZ.
0 1 0 0 1
0 1 1 1 0
1 0 0 0 1
1 0 1 0 1
1 1 0 0 1
1 1 1 1 0

Table 1.3 Truth Table for Y Z and YZ

Now values of X are ORed (logical addition) to the values of YZ and the
resultant values are contained in the last column (Table 1.4).

X Y Z Y.Z YZ X+YZ
0 0 0 0 1 1
0 0 1 0 1 1
0 1 0 0 1 1
0 1 1 1 0 0
1 0 0 0 1 1
1 0 1 0 1 1
1 1 0 0 1 1
1 1 1 1 0 1

Table 1.4 Truth Table for X + YZ.

Now observe the expression X+YZ, after ANDing Y and Z, the result has been
complemented and then ORed with X.
Example 2:- Verify the Boolean expression X+XY = X using truth.

Solution:- As the expression X+XY=X is a two variable expression,

so we require four possible combinations of values of X, Y.

Truth Table will be as follows:

X Y XY X+XY
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1

Therefore Comparing the columns X+XY and X, we find, contents of both

the columns are identical, hence verified.

Example 3:- Verify the Boolean expression X+Y = X . Y using truth.

Solution:- As it is a 2-variable expression, truth table will be as follows:

X Y X+Y X+Y X Y X.Y
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

X+Y = X. Y hence proved.

Example 4:- Prepare a table for the given Booleanalgebra expressions.

(a) X Y + X Y (b) XY Z + X Y Z (c) X Y Z + X Y

(a) Truth Table for X Y + XY

X Y X Y XY XY XY+XY
0 0 1 1 1 0 1
0 1 1 0 0 1 1
1 0 0 1 0 0 0
1 1 0 0 0 0 0
(b) Truth table for XY Z + X Y Z is as follows :

X Y Z X Y Z XYZ X YZ XYZ+XYZ
0 0 0 1 1 1 0 0 0
0 0 1 1 1 0 0 1 1
0 1 0 1 0 1 0 0 0
0 1 1 1 0 0 0 0 0
1 0 0 0 1 1 0 0 0
1 0 1 0 1 0 0 0 0
1 1 0 0 0 1 1 0 1
1 1 1 0 0 0 0 0 0

(C) Truth table for XYZ+XY is as follows

X Y Z X Y Z XYZ XY XYZ+XY
xyz
0 0 0 1 1 1 0 0 0
0 0 1 1 1 0 0 0 0
0 1 0 1 0 1 1 0 1
0 1 1 1 0 0 0 0 0
1 0 0 0 1 1 0 1 1
1 0 1 0 1 0 0 1 1
1 1 0 0 0 1 0 0 0
1 1 1 0 0 0 0 0 0

Example 5:- prepare truth table for the following Boolean algebra
expressions:
(a) X(Y+Z) +X Y (b) XY (Z+YZ)+Z (c) A[(B+C)+C]
Solution (a) Truth table for X(Y+Z)+XY is as follows :

X Y Z Y Z (Y+Z) X(Y+Z) XY X(Y+Z)+XY

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

(b) Truth table for XY (Z+YZ)+Z is as follows:

X Y Z Y Z YZ Z+YZ XY XY(Z+YZ) XY(Z+YZ)+Z

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

(C) Truth table for A[(B+C)+C] is as follows :

A B C B C (B+C) (B+C)+C A[(B+C)+C]

0 0 0 1 1 1 1 0
0 0 1 1 0 1 1 0
0 1 0 0 1 0 1 0
0 1 1 0 0 1 1 0
1 0 0 1 1 1 1 1
1 0 1 1 0 1 1 1
1 1 0 0 1 0 1 1
1 1 1 0 0 1 1 1
BASIC LOGIC GATES
A Gate is simply an electronic circuit which operates on one or more input signals
to produce an output signal.

There are three types of logic gates:

 NOT gate or Inverter
 OR gate
 AND gate

Inverter (NOT Gate)

NOT Gate is a gate or an electronic circuit that accepts only one input and
produces one output signal. The output state is always the complement of the
input state. A low input or 0 produces high output or 1 and vice versa.

x x
0 1
1 0

Truth Table for NOT Gate

The symbol for NOT Gate
X X
Not gate symbol
OR Gate

The OR gate has two or more input signals, but only one output signal. The out
will be the logical addition of the inputs.
Truth table for OR Gate
X Y F
X Y Z F
0 0 0
0 1 1 0 0 0 0
O
1 0 1 0 0 1 1
0
1 1 1 0 1 0 1
0 1 1 1
Two variable truth table 1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1

Three variable truth table

 The symbol for OR gate is given below:
A A F A F
F B
B
B c C C
D

a) 2 input OR gate b) 3 input OR gate c) 4 input OR gate

AND gate

The AND Gate has two or more input signals, but only one output signal.
The out will be the logical multiplication of the inputs.

Truth table for AND Gate

X Y Z X.Y.Z
X Y A.B 0 0 0 0
0 0 0 0 0 1 0
0 1 0 0 1 0 0
1 0 0 0 1 1 0
1 1 1 1 0 0 0
1 0 1 0
Two input AND gate
1 1 0 0
1 1 1 1

Three input AND gate

The symbol for AND is
A AA
A A F F
F B
B
B C
C D
(a) 2-input AND gate (b) 3-input AND gate (c) 4 input AND gate
BASIC POSTULATES OF BOOLEAN ALGEBRA
The fundamental laws of the Boolean algebra are called as the postulates
of Boolean algebra.

I. If X  0 then X = 1; and If X  1 then X = 0

II. OR Relations (Logical Addition)

0+0=0 0
OR 0
0

0+1=1 0
OR 1
1
1
1+0=1 OR 1
0

1
1+1=1 OR 1
1
III AND Relations (Logical Multiplication)

0.0 = 0

0.1 = 0

1.0 = 0

1.1 = 1

IV Complement Rules

0=1 0 1

1=0 1 0

PRINCIPLE OF DUALITY
i. Changing each OR sign (+) to an AND sign (.)
ii. Changing each AND sign (.) to an OR sign (+)
iii. Changing each 0 by 1 and each 1 by 0.

The derived relation using duality principle is c alled dual of original

expression.

For instance, we take postulates of OR relation, which states that

(a) 0 + 0 = 0 (b) 0 + 1 = 1 (c) 1 + 0 = 1 (d) 1 + 1 = 1

Now working according to above guidelines, '+' is changed to '.' 0's are replaced by
1’s and 1’s are replaced by 0’s, these equations become

(i) 1.1=1 (ii) 1.0=0 iii) 0.1=0 (iv) 0.0=0

Basic theorems of Boolean algebra

Boolean theorems can be proved by substituting all possible values of the

variables that are 0 and 1. This technique of proving theorems is called as proof by
perfect induction. Boolean theorems can also be proved using truth table also.

1) Properties of 0 and 1

a) 0+X=X 0 X (gate representation of (a))

OR
X

b) 1+X=1 1 1 (gate representation of (b))

OR
X

c) 0.X=0 0 0 (gate representation of (c))

AND
X

d) 1.X=X 1 X (gate representation of (d))

AND
X

a) 0+ x=x
Proof:- If x = 0, then LHS = 0 + x
=0+0
=0 { By OR relation }
=x
= RHS
If x = 1, then LHS = 0 + x
=0+1
=1 { By OR relation }
=x
= RHS

LHS = RHS hence proved.

 Truth table for above expression is given in below table where R signifies the output.

O x R=0+x
0 0 0
0 1 1

Truth Table for 0 + x = x

As X can have values either 0 or 1 (postulate 1) both the values ORed with 0 produce
the same output as that of X. hence proved.

(b) 1 + x = 1
Proof:- If x = 0, LHS = 1 + x
=1+0
=1 { By OR relation }

= RHS

If x = 1, LHS =1+x (

=1+1
=1 { By OR relation }
= RHS
.
LHS = RHS hence proved.

Truth table for above expression is given below in Table where R signifies the
output or result.

1 x R=1 + x

1 0 1
1 1 1

Truth Table for 1 + x = 1

Again x can have values 0 or 1. Both the values (0 and 1) ORed with1
produce the output as 1. Therefore 1+X=1 is a tautology.
(c) 0 . X = 0
Proof:- If x=0 LHS = 0.x
= 0.0 { By AND relation }
=0
= RHS

If x = 1, LHS = 0.x
= 0.1 { By AND relation }
=0

= RHS

LHS = RHS hence proved.

Thus, for every value of x, 0.x = 0 always.

As both the possible values of X (0 and 1) are to be ANDed with 0,

produce the output as 0.
The truth table for this expression is as follows:

0 X R=0.X
0 0 0
0 1 0

Truth Table for 0.X = 0

Both the values of X (0 and 1), when ANDed with, produce the output as 0.
Hence proved. Therefore, 0.X=0 is a fallacy.
(d) 1 . X = X
Proof:- If x = 0, LHS = 1.x
= 1.0
=0 { By AND relation }
=x
=RHS
If x = 1, LHS = 1.x
= 1.1
=1 { By AND relation }
=x
=RHS

LHS = RHS hence proved.

Thus, for every value of x, 1.x = x always.

Now both the possible values of X (0 and 1) are to be ANDed with 1

to produce the output R.
Thus the truth table for it will be as follows :

1 X 1.X
1 0 0
1 1 1

Truth Table for 1.X=X

Now observe both the values (0 and 1) when ANDed with 1 produce the
same output as that of X. Hence proved.

2) Indempotence Law
This law states that when a variable is combined with itself using OR
or AND operator, the output is the same variable.
X
a) X + X = X OR X (gate representation for (a))
X

X
AND X
b) X . X = X X (gate representation for (b))
(a) X + X = X
Proof :- If x = 0 consider LHS = x + x
=0+0
=0 { By OR relation }
=x
=RHS
If x = 1, consider LHS = x + x
=1+1
=1 { By OR relation }
=x
=RHS

LHS = RHS hence proved.

Thus, for every value of x, x + x = x always.

As X is to be ORed with itself only, we will prepare truth table with the two
possible values of X (0 and 1).

X X X+X
0 0 0
1 1 1

Truth Table for x + x = x

(b) X.X = X

Proof: If x = 0, consider LHS = x . x

= 0.0
= 0 { By AND relation }
=x
=RHS
If x = 1, LHS = x . x
= 1.1
=1 { By AND relation }
=x
=RHS
 LHS = RHS hence proved.
Thus, for every value of x, x + x = x always.

x x x.x
0 0 0
1 1 1
Truth Table for X.X = X

3) Involution Law

This law states that the complement of a variable is complemented again,

then we get the same variable.
X
(X) = X ie., X X=X

Proof: If x = 0, then x =1 and (x) = 1 = 0 = x

If x = 1, then x = 0 and (x) = 0 = 1 = x

X x x
0 1 0
1 0 1

Truth Table for (X) = X

First column represents possible values of X, second column represents

complement of X (i.e. X) and the third column represents complement of

X (i.e., X) which is same as that of X. Hence proved.

This law is also called double-inversion rule.

4) Complementarity Laws
In this law, we will combine a variable with its complement. .
These laws states that

a) X + X = 1 X (gate representation of (a))

X OR X+X=1
b) X.X = 0
X X.X=0
X AND
(gate representation of (b))

Proof: If x = 0, LHS = x + x
=0+1 (x = 1)
=1 { By OR relation }
= RHS

If x = 1, LHS = x + x
=1+0
=1 { By OR relation }
= RHS

LHS = RHS hence proved.

Thus, for every value of x, x + x = 1 always.

We will prove x + x=1 with the help of truth table which is given below :

X x x+x
0 1 1
1 0 1

Truth Table for X + X =1

 Here, in the first column possible values of X have been taken, second column
consists of X values (complement values of X), X and X values are ORed and the
output is shown in third column. As the equation holds true for both possible
values of X, it is a tautology.

(b) X.X = 0
Proof: If x = 0, LHS = x . x
= 0 . 1 ( x = 1)
=0 { By AND relation }

= RHS

If x = 1, LHS = x . x
= 1 . 0 ( x = 0)
=0 { By AND relation }
= RHS

LHS = RHS hence proved

Thus, for every value of x, x . x = 0 always.

Truth table for the expression is as follows:
X X X.X
0 1 0
1 0 0
Truth table for X . X = 0

Observe that X.X=0. It is a fallacy. It is the dual of X+X=1.

5) Commutative Law

These laws state that a) x + y = y + x and b) x . y = y .x

X
X R Y OR R
AND R = Y AND
R
OR = Y X
Y X

(R signifies the output)

a) x + y = y + x

proof: If x = 0 then LHS = x + y

=0+y
=y
RHS = y + x

=y+0

=y
Therefore, for x = 0, x+y=y+x LHS = RHS

If x = 1 then LHS = x + y
=1+y
=1
RHS = y + x
=y+1
=1

LHS = RHS hence proved

Therefore, for x = 1, x + y = y + x. Hence the proved.

X Y X+Y Y+X
0 0 0 0
0 1 1 1
1 0 1 1
1 1 1 1

Truth Table for X + Y = Y +X

Compare the columns X + Y and Y +X, both of these are identical.

Hence also proved by truth table.

(b) X . Y = Y . X
Proof: If x = 0 LHS = x . y
= 0 .y

=0
RHS = y . x
=y.0
=0

Therefore, for x = 0, x+y=y+x LHS = RHS

If x = 1 then LHS = x . y

=1.y
=y

RHS = y. x

= y.1

=y

LHS = RHS hence proved

Therefore, for x = 1, x . y = y . x. Hence the proof.

X Y X.Y Y.X
0 0 0 0
0 1 0 0
1 0 0 0
1 1 1 1

Truth Table for X . Y = Y . X

Both of the columns X . Y and Y . X are identical, hence proved.

6) Associative Law
These laws state that
(a) X + (Y + Z) = (X + Y) + Z (associative Law of addition)
X X+Y
R R
X = Y
Y Z
Z Y+Z

(b) X (Y. Z) = (X.Y) . Z (associative Law of multiplication)

X XY
X R = Y R
Y
Z
Z YZ
a) X+(Y+Z) = (X+Y)+Z

Proof: If X = 0, then LHS = X + (Y + Z)

= 0 + (Y+ Z)
= Y+Z
RHS = (X+Y)+Z
= (0+Y)+Z
= Y+Z

Therefore for X=0, X+(Y+Z) = (X+Y)+Z

If X=1, then LHS = X+(Y+Z) RHS = (X+Y)+Z

=1+(Y+Z) =(1+Y)+Z
= (1 +Y)+Z =1+Z
=1+Z =1
= 1

Therefore for X=1, then X+(Y+Z) = (X+Y)+Z

LHS = RHS hence proved

 (a) Truth table for X + (Y + Z) = (X + Y)+ Z is given below:

X Y Z Y+Z X+Y X+(Y+Z) (X+Y)+Z

X
0 0 0 0 0 0 0
X
0 0 1 1 0 1 1
X
0 1 0 1 1 1 1
0 1 1 1 1 1 1
1 0 0 0 1 1 1
1 0 1 1 1 1 1
1 1 0 1 1 1 1
1 1 1 1 1 1 1

Truth Table for X + (Y + Z) = (X + Y) + Z

Compare the columns X+(Y+Z) and (X+Y)+Z, both of these are identical.
Hence proved.

(b) X. (Y. Z) = (X.Y). Z

Proof: If X = 0, then LHS = X . (Y . Z)

= 0 . (Y. Z)
= 0 . (Y.Z)
=0
RHS = (X.Y)+Z
= (0.Y).Z
=0
Therefore for X=0, X. (Y. Z) = (X.Y). Z

If X=1, then LHS = X.(Y.Z) RHS = (X.Y).Z

=1.(Y.Z) =(1.Y).Z
= YZ =YZ

Therefore for X=1, then X. (Y. Z) = (X.Y). Z

LHS = RHS hence proved
Note : Rule (b) is dual of rule (a), hence it is also proved.

(a) Truth table for X. (Y. Z) = (X.Y). Z is given below:

X
Y Z Y.Z X.Y X.(Y.Z) (X.Y).Z
X
0 0 0 0 0 0 0
X
0 0 1 0 0 0 0
0
0 1 0 0 0 0
0
0 1 1 1 0 0 0
1 0 0 0 0 0 0
1 0 1 0 0 0 0
1 1 0 0 1 0 0
1 1 1 1 1 1 1
1
Both the columns X. (Y. Z) = (X.Y). Z are1identical, hence proved.
1

7) Distributive Law
This law states that
(a) X (Y + Z) = XY+XZ X X+Y
Y
X R OR R
Y AND =
OR X
Z Y+Z Z X+Z

(b) X + YZ = (X+Y) (X+Z)

X X+Y
X Y
Y R Z AND R
AND OR R =
Z YZ X
Z
(a) X(Y+Z) = XY + XZ

Proof:- If X=0, LHS = X(Y+Z) RHS = XY + XZ

= 0(Y+Z) = 0.Y + 0.Z
=0 =0+0
=0

If X=1, LHS = X(Y+Z) RHS = XY + XZ

= 1(Y+Z) = 1.Y + 1.Z
= Y+Z = Y+Z

Therefore for X(Y+Z) = XY + XZ LHS = RHS hence proved.

(b) X + YZ = (X+Y) (X+Z)

Proof:- If x=0, then LHS = X + YZ RHS = (X+Y)(X+Z)

= 0 + YZ =( 0+Y)(0+Z)
=YZ =YZ

If x=1, then LHS = X+YZ RHS = (X+Y)(X+Z)

= 1+1.Z =(1+Y)(1+Z)
= 1+Z =(1)(1)
= 1 =1

Therefore for X + YZ = (X+Y) (X+Z) LHS = RHS hence proved.

 Therefore, for every value of x, LHS = RHS. i.e., x(y+z) = xy + xz

(a) Truth Table for X (Y + Z) = XY+XZ is given below:

Truth table for X (Y + Z) = XY+XZ
X Y Z Y+Z XY XZ X(Y+Z) XY+XZ
0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0
0 1 0 1 0 0 0 0
0 1 1 1 0 0 0 0
1 0 0 0 0 0 0 0
1 0 1 1 0 1 1 1
1 1 0 1 1 0 1 1
1 1 1 1 1 1 1 1

Both the columns X(Y+Z) and XY+XZ are identical, hence proved.

Note : Rule (b) is dual of rule (a), hence it is also proved

(b) Truth Table for X + YZ = (X+Y) (X+Z) is given below:

Truth table for X + YZ = (X+Y) (X+Z)
X Y Z YZ X+Y X+Z (X+Y)(X+Z X+YZ
)
0 0 0 0 0 0 0 0
0 0 1 0 0 1 0 0
0 1 0 0 1 0 0 0
0 1 1 1 1 1 1 1
1 0 0 0 1 1 1 1
1 0 1 0 1 1 1 1
1 1 0 0 1 1 1 1
1 1 1 1 1 1 1 1

Both the columns X + YZ = (X+Y) (X+Z) are identical, hence proved.

8) Absorption Law
According to this law
a) X+XY=X b) X(X+Y)=X
X X
X
XY OR X+Y AND
AND OR
Y Y
Logic diagram (a) Logic diagram (b)

a) X+XY = X

Proof:- If x=0, then LHS = x + xy

= 0+(0.y)
= 0
= x
= RHS

If x=1, then LHS = x + xy

= 1 + 1.y
= 1+y
=1
=x
= RHS

Therefore x+xy=x LHS = RHS hence proved

b) X(X+Y)=X

Proof:- If x=0, then LHS = x(x+y)

= 0(0+y)
= 0
= x
= RHS

If x=1, then LHS = x(x+y)

= 1(1+y)
= 1(1)
=1
=x
= RHS

Therefore X(X+Y)=X LHS = RHS hence proved

(a) Truth Table for X+XY = X is given below:

X Y XY X+XY
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1

Truth Table for X+XY = X

Column X and X+XY are identical. Hence proved

(b) Truth table for X(X+Y)=X

X Y X+Y X(X+Y)
0 0 0 0
0 1 1 0
1 0 1 1
1 1 1 1

Column X and X(X+Y) are identical. Hence proved

Some Other Rules of Boolean Algebra

There are some more rules of Boolean algebra which are given below:
X+XY=X+Y (This is the third distributive law)

X
X
R = X R=X+Y
XY Y
Y
(a) X+XY=X+Y

Proof:- If x=0, then LHS = x + x y RHS = X+Y

=0 + 0y =0+Y

=0+ y =Y

= y

Therefore for X =0, X+XY=X+Y LHS = RHS hence proved

Proof:- If x=1, then LHS = x + x y RHS = X+Y

=1 + 1y =1+Y

= 1+ 0 =1

= 1

Therefore for x =1, X+XY=X+Y LHS = RHS hence proved

Truth Table for X+XY=X+Y is given as below:

X Y X
XY X+Y X+XY
0 0 1 0 0 0
0 1 1 1 1 1
1 0 0 0 1 1
1 1 0 0 1 1

Therefore both the columns X+XY=X+Y are identical hence

proved.