Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.

com

Chapter- 3 Boolean Logic and Gates

You will learn the following topics in this tutorial

S. No. Topics
1 BOOLEAN ALGEBRA

2 BINARY OPERATIONS

3 BOOLEAN OPERATORS

4 LOGIC GATES

5 (i) Basic or Fundamental gates

6 1. AND gate 2. OR gate 3. NOT gate ( Inverter)

7 (ii) Derived gates

8 1. NAND gate 2. NOR gate 3. X-OR gate 4. X-NOR gate

9 Basic postulates of Boolean Algebra

10 Principle of Duality

11 Basic Theorems of Boolean Algebra

12 1) Properties of 0 and 1

13 2) Indempotence Law

14 3) Involution Law

15 4) Complementarity Law

16 5) Commutative Law

17 6) Associative Law

18 7) Distributive Law

19 8) Absorption Law

20 9) DeMorgan's Theorem

Page 1 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

BOOLEAN ALGEBRA:-
 It is a two state algebra or algebra of logics.
 It is also called Switching Algebra.
 It is based on Binary number system and uses the numeric constants 0
and 1.

BINARY DECISION: -
The decision which results into either ‘ TRUE ‘ or ‘FALSE’ where TRUE
stands for 1 and FALSE stands for 0.
LOGICAL VARIABLES (Boolean Variable or Binary valued Variable):

The variables which can stores values either TRUE or FALSE OR ‘0’ or ‘1’.

BINARY OPERATIONS:

It is an operation in which for a set of variables result are the values i.e.
0 or 1.

BOOLEAN OPERATORS:

In Boolean Operation, operators used are of three types:

a) NOT
It is a Unary Operator i.e. it operation single variable and operation
performed by it is known as Complementation or Negation .Its symbol is “¯”
or “ ’ ” .e.g. A’ or Ā
Page 2 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

b) AND
It is a Binary Operator. It operates on two variables and operation
performed by it is known as Logical Multiplication. Its Symbol is “.” Or “ ˆ
”. e.g. A .B or Aˆ B.

c) OR
It is a Binary Operator. It operates on two variables and operation
performed by it is known as Logical Addition. Its symbol is “+” or “ˇ”.

Example: A + B or A ˇ B.

TRUTH TABLE: -
A truth table is a table that describes the behavior of a logic gate. It shows
all input and output possibilities for logical variables or statements. The
input patterns are written in Binary Progression.

TAUTOLOGY: -
If the result of a logical statement or expression is always true or ‘1’, it is
known as Tautology.

FALLACY: -
If the result of a logical statement or expression is always False or ‘0’, it is
known as Fallacy.
Page 3 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

LOGIC GATES-
A logic gate performs a logical operation on one or more logic inputs and
produces a single logic output.

Logic gates are small electronic circuits that work on digital signals. Basically
logic gates are of two types:

Logic Gates

Derived
Basic Gates
Gates

AND NOT OR NAND NOR X-OR X-NOR

(i) Basic or Fundamental gates.

There are some basic gates which are not constructed from others gates.
These are:

1. AND gate
 The AND Gate can have two or more than two input and produce an
output signal.

 If any of the input signal is 0, the output signal is 0.

 If all inputs are 0 then output is also 0.

F = A  B or F = AB, where A and B are input line.

F = 1 if and only if A=1 and B=1, otherwise F=0
Page 4 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

Graphical symbol of AND Gate

A A
F B F
B C
(Two Input Lines) (Three Input Lines)

Truth Table: Truth Table:

INPUT OUTPUT INPUT OUTPUT

A B F = A.B A B C F = A.B.C
0 0 0 0 0 0 0
0 1 0 0 0 1 0
1 0 0 0 1 0 0
1 1 1 0 1 1 0
1 0 0 0
It is concluded from the above truth 1 0 1 0
1 1 0 0
table that; the output of an AND 1 1 1 1

gate is TRUE (i.e. 1) only when all the inputs are TRUE, and in all other cases
it is always FALSE.

2. OR gate
 The OR Gate has two or more input signals but only one output
signal.
 If any of the input signal is 1, the output signal is 1.
 If all inputs are 0 then output is also 0.

F = A + B

F = 1 if A = 1 or if B = 1, or both A = 1andB = 1.

F = 0 if and only if A = 0 and B = 0

Page 5 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

Graphical symbol of OR Gate

A
A
F B F
B C
(Two Input Lines) B (Three Input Lines)
B
B B B
Truth Table: Truth Table:
B
INPUT OUTPUT INPUT OUTPUT
A B F = A.B A B C F = A.B.C
0 0 0 0 0 0 0
0 1 1 0 0 1 1
1 0 1 0 1 0 1
1 1 1 0 1 1 1
1 0 0 1
It is concluded from the above truth 1 0 1 1
1 1 0 1
table that; the output of an OR gate 1 1 1 1

is FALSE (i.e. 0) only when all the inputs are FALSE, and in all other cases it
is always TRUE.

3. NOT gate ( Inverter)

 An Inverter (NOT Gate) is a gate with only one input signal and one
output signal.
 The output state is always the opposite of the input state.
 Output is sometimes called complement of the input.

F = A or F= 1 if A = 0, F = 0 if A = 1

Page 6 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

Truth Table Graphical symbol of NOT Gate

Input Output
A F = Ā (or A’)
A F = Ā (or A’) Input line Output line

0 1

1 0

It is concluded from the above truth table that; the NOT gate simply
inverts the input.

(ii) Derived gates

These gates are obtained by combining two or more basic gates.

1. NAND gate (compliment of AND gate])

It is obtained by complimenting the output of AND gate.
A Y=A.B
F = A.B
B

Graphical Symbol:
A
F = A.B
B
TRUTH TABLE:
INPUT OUTPUT It is concluded from the above
A B A.B Y= (A.B)’ truth table that; the output of
0 0 0 1 an NAND gate is FALSE
0 1 0 1 (i.e. 0) only when both the
1 0 0 1 inputs are TRUE, and in all
1 1 1 0 other cases it is always TRUE.
Page 7 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

2. NOR gate (compliment of OR gate)

It is obtained by complimenting the output of OR gate
A
F =A+B
B

Graphical symbol:
A
F =A+B
B

Truth Table:

INPUT OUTPUT
A B A+B Y= (A+B)’
0 0 0 1
0 1 1 0
1 0 1 0
1 1 1 0

3. X-OR gate:
It is a special case in OR gate. It is obtained as:
A A’B

F=A B

B AB'

Graphical symbol:
A
Input lines F=A B
B Output lines

Page 8 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

Truth table:
INPUT OUTPUT

A B A’ B’ A’B AB’ Y = A’B + AB’

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

It is concluded from the above truth table that; the output of an X-OR gate
is FALSE (i.e. 0) when both the inputs are SAME, and in all other cases it is
always TRUE.
4. X-NOR gate:
It is obtained by complementing the output of X-OR gate.
A A’B
F=A B

Input line
F=A B
B AB'

Graphical symbol:
A
Input lines F=A B
B Output lines
Truth Table:
INPUT OUTPUT
A B A’ B’ A’B AB’ Y = (A’B + AB’)’
0 0 1 1 0 0 1
0 1 1 0 1 0 0
1 0 0 1 0 1 0
1 1 0 0 0 0 1

Page 9 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

Basic postulates of Boolean Algebra:

Boolean algebra consists of fundamental laws that are based on theorem
of Boolean algebra. These fundamental laws are known as basic postulates
of Boolean algebra. These postulates states basic relations in Boolean
algebra, which follows:

I. if X ≠ 0 then X=1; and if X≠1 then X=0

II. OR relations
a) 0 + 0 = 0

b) 0 + 1 = 1

c) 1 + 0 = 1

d) 1 + 1 = 1

III. AND relations

a) 0 . 0 = 0

b) 0 . 1 = 0

c) 1 . 0 = 0

d) 1 . 1 = 1

IV. NOT Relations

a) 1’ = 0

b) 0’ = 1

Page 10 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

Principle of Duality:
This principal states that we can derive a Boolean relation from another
Boolean relation by performing simple steps. The steps are:-

1. Changing each OR sign to an AND sign

2. Changing each AND sign to an OR sign
3. Replacing each 0 by 1 and 0 to 1.
If exp is 0 + 0 = 0 then 1 . 1 = 1

Basic Theorems of Boolean Algebra

1) Properties of 0 and 1

Sr. Properties Circuit Diagram Truth Table

0 A R
a) 0 + A = A
0 0 0
0 1 1

1 A R
b) 1 + A = 1
A 1 0 1
1 1 1 1

A 0 A R
c) 0 . A = 0
0 0 0 0
0 0 1 0

A 0 A R
d) 1 . x = x
1 1 0 0
1 1 1 1

Page 11 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

2) Indempotence Law
It states that when we sum or product a Boolaen quantity to itself, the
resultant is original quantity.

Sr. Laws Circuit Diagram Truth Table

a) A + A = A A A R
0 0 0
1 1 1

b) A . A = A A A R
0 0 0
1 1 1
Here it is proved that (a) and (b) are duals of each other.

From the truth table it is proved that A + A =A and A.A = A as it holds true
for both values A.
3) Involution Law
It states that complementing a variable twice, or any even number of
times, results in the original Boolean value.

Sr. Laws Circuit Diagram Truth Table

a) (A')' = A A A' (A')'

0 1 0
1 0 1

 By Truth Table it is proved that (A')'= A

 This law is also called double-inversion rule

Page 12 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

4) Complementarity Law
It states that sum of a Boolean quantity with its complement or product
of a Boolean quantity with its complement results into identity

Sr. Laws Circuit Diagram Truth Table

a) A + A' = 1 A A' R
0 1 1
1 0 1

b) A . A' = A A A' R
0 1 0
1 0 0

From the truth table it is proved that, A + A' = 1 and A . A' = A

5) Commutative Law
It tells us, we can reverse the order of variables, that are either ORed together
or ANDed together without changing the truth of the expression.
Law and Circuit Diagram Truth Table
a) A+B = B+A A B A+ B B+ A
0 0 0 0
0 1 1 1
1 0 1 1
1 1 1 1
b) A.B = B.A A B A. B B. A
0 0 0 0
0 1 0 0
1 0 0 0
1 1 1 1
From the truth table it is proved that, A+B = B+A and A.B = B.A
Page 13 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

6) Associative Law
It tells us that we can associate, group of sum or product variables
together with parenthesis without altering the truth of the expression.
Laws, Circuit Diagram and Truth Table
a) A+(B+C) = (A+B)+C
A+B
B+C

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

0 0 0 0 0 0 0
0 0 1 1 0 1 1
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
From the truth table it is proved that, A+(B+C) = (A+B)+C
b) A (B.C) = (A.B) C

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

B

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

0 0 0 0 0 0 0
0 0 1 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

From the truth table it is proved that, A (B.C) = (A.B) C

Page 14 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

7) Distributive Law
It states that, ORing variables and then ANDing the result with single
variable is equivalent to ANDing the result with a single variable with each
of the several variables and then ORing the products. Vice versa with
respect to operators and terms is also true.
Laws, Circuit Diagram and Truth Table
a) A.(B+C) = (A.B) + (A.C)

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

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
From the truth table it is proved that, A.(B+C) = (A.B) + (A.C)

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

(A+B).(A+C)

Page 15 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

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

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

From the truth table it is proved that, A+(B.C) = (A+B).(A+C)

8) Absorption Law

It States that:
Law and Circuit Diagram Truth Table
a) A+ (AB) = A A B A.B A+ (AB)
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1
b) A.(A+B) = A A B A+B A.(A+B)
0 0 0 0
0 1 1 1
1 0 1 1
1 1 1 1

From the truth table it is proved that, A+ (AB) = A and A.(A+B) = A

Page 16 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

9) DeMorgan's Theorem
It states that the complement of a sum / product, equals the product /
sum of the complements.
Laws, Circuit Diagram and Truth Table
a) ( A + B ) ' = A' . B'
NOR Negative AND

A' . B'

A B A' B' A+B (A+B)' A' . B'

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

From the truth table it is proved that, ( A + B ) ' = A' . B'

b) ( A . B )' = A' + B'

NAND Negative OR

( A . B )' A' + B'

A B A' B' A.B (A.B)' A' + B'

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

From the truth table it is proved that, ( A . B )' = A' + B'

Page 17 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

EXAMPLES……

1) Draw the logic circuit diagram for the given Boolean expression:

(x+z) (y'+z) (x'+y+z)

X

Y’

X’
Y’
Z

2) Convert the following logic gate circuit into a Boolean expression,

writing Boolean sub-expression next to each gate.

Ans: F=AB + A(B + C) + B(B + C)

Page 18 of 19
Unit I: Computer Systems and Organization Visit to website: learnpython4cbse.com

Chapter- 3 Boolean Logic and Gates

Q1. Convert the following logic gate circuit into a Boolean expression,
writing Boolean sub-expression next to each gate.

1)
B F

2) A

B
F
C

3) A

B F

4)

Q2. Draw the circuit diagram for the following using AND, OR and NOT
gate(s):
I) F(a,b,c,) = a + bc' II) F(x,y,z,) = xy + yz + xy'

III) f(w,x,y,z) = yz' + wxy' + wxz' + wx'z IV) f(x,y,z) = (x + y). (y + z) . (z + x)

Page 19 of 19