Introduction to Boolean Logic –Class 11

Every day we may cross a path of many situation like “Should I do this or not?”, “Should I do switch
on laptop or not?”. These types of questions having answer either “Yes” or “No”. So these kind of
situation is binary decision.

Boolean logic refers to Boolean Algebra which values of variables are the truth values true or false.
These values have two states either on or off denoted by 0 or 1.

Truth Table : A truth table represents a Boolean function or expression with all possible input and
output results in tabular form.
If the result is always 1 or true or high, is called Tautology, where as result is false or 0(zero) or low is
known as Fallacy. The number of rows in truth table is computed as 2n . Where n is the number of
variable inputs

Rules of writing Truth table:

 Check the number of variables of expression. Make column for each input variable.
 Make column for each logical expression.
 Write 0’s in first half for the number of rows in first column and then second column
respectively.
 Continue the same pattern until the last column.
 Compute result for each operation by considering the input values of variables written in each
row.

Logical Operations: These operations carried out by logical operators with operands.

NOT
It handles only a single variable. The operation performed by NOT is known as
complementation. To denote NOT operator bar symbol is used.

A Result A’ (bar)
0 0
0 1

AND
It is a binary operator that operates on two variables and the result of the AND operator is
known as logical multiplication. To denote AND operator dot(.) symbol is used.
AND operator accepts two input variables A and B with values 0 and 1 respectively. In short the
AND operator returns TRUE or 1 when both input are 1, rest all results will be 0. True is also
considered as high, and False as low
The truth table for AND operator looks like as following:

A B A.B (Result)
0 0 0
0 1 0
1 0 0
1 1 1
 OR
It is also a binary operator that operates on two variables. The result of the OR operator is also
known as logical addition. The symbol is used for OR is plus (+).
In short the OR operator returns TRUE or 1 when any one input value is 1, otherwise 0. True is
also considered as high, and False as low
The truth table for the OR operator looks as follows:

A B A+B (Result)
0 0 0
0 1 1
1 0 1
1 1 1

Precedence of Boolean Operator

NOT (First Priority)

AND (Second Priority)

OR (Third Priority)

Logic Gates

A logical gate is a logical circuit that takes one or more inputs and produces result. It uses three
operators AND, OR and NOT known as AND Gate, OR Gate and NOT Gate. These are fundamentals
gates.

NOT Gate

A NOT gate has only one input. It is known as inverter gate. It is used for electronic inverter
devices. It produces the reverse result of an input. The output is always negation or complement
of an input signal.
 AND Gate

AND means that A & B. When both inputs are true then it produce true result, otherwise false.

OR Gate

OR refers like A or B. It is considered as inclusive “or”. The output is true if either one or two
inputs are “true”. It both false it produce false result.

Universal gates are the logic gates which are capable of implementing any Boolean function
without requiring any other type of gate. Types of Universal Gates in digital electronics, there are
only two universal gates which are 1. NAND Gate 2. NOR Gate

NAND Gate
It stands for NOT AND that produce reverse result of AND gate. The truth table for NAND Gate
is as following:
A B A.B (A.B)’

0 0 0 1

0 1 0 1

1 0 0 1

1 1 1 0

NOR Gate
It stands for NOT OR. It produces reverse output than OR gate. The truth table for NOR Gate
is as following:

A B A+B (A+B)’
0 0 0 1
0 1 1 0
1 0 1 0
1 1 1 0
 XOR Gate
It produces true if input is similar, otherwise false.
A B Result

0 0 0

0 1 1

1 0 1

1 1 0

Basic Laws

QUESTION WITH SOLUTION

Prove WITH HELP OF TRUTH TABLE

1. X+XY = X
2. X(Y+Z) = XY +XZ
3. (X+Y)' =X'Y'
4. XY+YZ+Y'Z = XY + Z
ANSWER
1.
X Y XY X+XY
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1

2.
X Y Z Y+Z X.(Y+Z) X.Y X.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 0 1 1 0 1 1
1 1 0 1 1 1 1 1
1 1 1 1 1 1 1 1
3.
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

4.
X Y Z XY YZ Y' Y'Z XY + Z XY+YZ+Y'Z
0 0 0 0 0 1 0 0 0
0 0 1 0 0 1 1 1 1
0 1 0 0 0 0 0 0 0
0 1 1 0 1 0 0 1 1
1 0 0 0 0 1 0 0 0
1 0 1 0 0 1 1 1 1
1 1 0 1 0 0 0 1 1
1 1 1 1 1 0 0 1 1
GATES

Draw the logic circuit for the following :

1. A.B + (A.C)’
2. A.B + B.C(B+C)
3. A + B.C +D’