DMGT Module4 Boolean Algebra

Introduction
 Developed by English Mathematician

George Boole in between 1815 -
1864.
 It is described as an algebra of logic
or an algebra of two values i.e
True or False.
 The term logic means a statement
having binary decisions i.e True/Yes
or False/No.
Application of Boolean algebra
 It is used to perform the logical operations
in digital computer.
 In digital computer True represent by ‘1’
(high volt) and False represent by ‘0’ (low
volt)
 Logical operations are performed by logical
operators. The fundamental logical
operators are:
1. AND (conjunction)
2. OR (disjunction)
3. NOT (negation/complement)
AND operator
 It performs logical multiplication and
denoted by (.) dot.
X Y X.Y
0 0 0
0 1 0
1 0 0
1 1 1
OR operator
 It performs logical addition and
denoted by (+) plus.
X Y X+Y
0 0 0
0 1 1
1 0 1
1 1 1
NOT operator
 It performs logical negation and
denoted by (-) bar. It operates on
single variable.
X X (means complement of x)
0 1
1 0
NAND operator
 Itperforms logical multiplication and
then negates the overall output. It
denoted by (-) bar over the (.)dot
product of the inputs.
NOR operator
It performs logical addition and
then negates the overall output. It
denoted by (-) bar over the
(+)addition of the inputs.
XOR operator
It performs logical operations and
gives an output when the inputs are
exclusively different from each
other. It is denoted by a special
sign as seen below.
XNOR operator
It performs logical operations and
negates the outputs of XOR gate.
Basically, it gives us the exact
opposite output as compared to
XOR gate.
Truth Table
 Truth table is a table that contains all
possible values of logical
variables/statements in a Boolean
expression.
No. of possible combination =

2n, where n=number of variables used in
a Boolean expression.
Truth Table
 The truth table for XY + Z is as
follows:
Dec X Y Z XY XY+Z
0 0 0 0 0 0
1 0 0 1 0 1
2 0 1 0 0 0
3 0 1 1 0 1
4 1 0 0 0 0
5 1 0 1 0 1
6 1 1 0 1 1
7 1 1 1 1 1
Tautology & Fallacy
 If the output of Booean expression is
always True or 1 is called
Tautology.
 If the output of Boolean expression is
Palways
P’ False(PVP’)
output or 0 is called Fallacy.
output (PΛP’)
0 1 1 0
1 0 1 0
PVP’ is Tautology and PΛP’ is Fallacy

Implementation
 Boolean Algebra applied in computers
electronic circuits. These circuits
perform Boolean operations and
these are called logic circuits or logic
gates.
Logic Gate
 A gate is an digital circuit which operates
on one or more signals and produce single
output.
 Gates are digital circuits because the input
and output signals are denoted by either
1(high voltage) or 0(low voltage).
 Three type of gates are as under:
1. AND gate
2. OR gate
3. NOT gate
AND gate
 The AND gate is an electronic circuit that
gives a high output (1) only if all its inputs
are high.
 AND gate takes two or more input signals
and produce only one output signal.
Input Input Output
A B AB
0 0 0
0 1 0
1 0 0
1 1 1
OR gate
 The OR gate is an electronic circuit that
gives a high output (1) if one or more of its
inputs are high.
 OR gate also takes two or more input
signals and produce only one output signal.
Input Input Output
A B A+B
0 0 0
0 1 1
1 0 1
1 1 1
NOT gate
 The NOT gate is an electronic circuit that gives a
high output (1) if its input is low .
 NOT gate takes only one input signal and produce
only one output signal.
 The output of NOT gate is complement of its input.
 It is also called inverter.
Input A Output A
0 1
1 0
NAND gate
• NAND gate is an electronic gate which gives an
output when both of the inputs are not high(1).
• This gate is the inverse of the AND gate studied
before.
NOR gate
• NOR gate is an electronic gate which gives an output
when neither of the inputs are high(1).
• This gate is the inverse of the OR gate studied before.
XOR gate
• XOR gate is an electronic gate which gives an output only when
either of the inputs is high(1), but not both.
• It stands for “Exclusively Or” which defines the function.
XNOR gate
• XNOR gate is an electronic gate which gives an output only
when both of the inputs are either high or low, but it should be
the same.
• It stands for “Exclusively Nor” which defines the function.
Question on Logic Diagram and Truth Table
Principal of Duality
In Boolean algebras the duality
Principle can be is obtained by
interchanging AND and OR operators
and replacing 0's by 1's and 1's by
0's. Compare the identities on the
left side with the identities on the
right.
Example
X.Y+Z' = (X'+Y').Z
Basic Theorems
T1 : Properties of 0
(a) 0 + A = A
(b) 0 A = 0
T2 : Properties of 1
(a) 1 + A = 1
(b) 1 A = A
Basic Theorem
T3 : Commutative Law
(a) A + B = B + A
(b) A B = B A
T4 : Associate Law
(a) (A + B) + C = A + (B + C)
(b) (A B) C = A (B C)
T5 : Distributive Law
(a) A (B + C) = A B + A C
(b) A + (B C) = (A + B) (A +C)
(c) A+A’B = A+B
Basic Theorem
T6 : Indempotence (Identity ) Law

(a) A + A = A
(b) A A = A
T7 : Absorption (Redundance) Law

(c) A + A B = A
(d) A (A + B) = A
Basic Theorem
T8 : Complementary Law
(a) X+X’=1
(b) X.X’=0
T9 : Involution
(a) x’’ = x
T10 : De Morgan's Theorem
(a) (X+Y)’=X’.Y’
(b) (X.Y)’=X’+Y’
Questions on Boolean Laws
Representation of
Boolean
expression
Boolean expression can be
represented by either
(i)Sum of Product( SOP) form or
(ii)Product of Sum (POS form)
e.g.
AB+AC  SOP (A+B)
(A+C)  POS
In above examples both are in SOP and POS respectively
but they are not in Standard SOP and POS.
Canonical form
(Standard form)
 In standard SOP and POS each term of

Boolean expression must contain all the
literals (with and without bar) that has
been used in Boolean expression.
 If the above condition is satisfied by
the Boolean expression, that
expression is called Canonical form of
Boolean expression.
Canonical form
(Standard form) Contd..
In Boolean expression AB+AC the

literal C is missing in the 1st term
AB and B is missing in 2nd term
AC. That is why AB+AC is not a
Canonical SOP.
Canonical form of Boolean
Expression (Standard form) Contd..
Convert AB+AC in Canonical SOP

(Standard SOP)
Sol. AB + AC
AB(C+C’) + AC(B+B’)
Distributive law
ABC+ABC’+ABC+AB’C
ABC+ABC’+AB’C
Convert (A+B)(A+C) in Canonical

POS (Standard POS)
Sol. (A+B).(A+C)
(A+B)+(C.C’) . (A+C)+(B.B’) (A+B+C).(A+B+C’).
(A+B+C)(A+B’+C) Distributive law
(A+B+C).(A+B+C’)(A+B’+C) Remove duplicates
Minterm and Maxterm

Individual term of Canonical Sum of Products
(SOP) is called Minterm. In otherwords minterm
is a product of all the literals (with or without
bar) within the Boolean expression.
Individual term of Canonical Products of Sum

(POS) is called Maxterm. In otherwords
maxterm is a sum of all the literals (with or
without bar) within the Boolean expression.
Minterms & Maxterms for 2 variables
(Derivation of Boolean function
from Truth Table)
x y Index Minterm Maxterm

0 0 0 m0 = x’ y’ M0 = x + y
0 1 1 m1 = x’ y M1 = x + y’
1 0 2 m2 = x y’ M2 = x’ + y
1 1 3 m3 = x y M3 = x’ + y’
The minterm mi should evaluate to 1 for
each combination of x and y.
The maxterm is the complement of the
minterm
Minterms & Maxterms for 3
variables
x y z Index Minterm Maxterm
0 0 0 0 m0 = x y z M0 = x + y + z
0 0 1 1 m1 = x y z M1 = x + y + z
0 1 0 2 m2 = x y z M2 = x + y + z
0 1 1 3 m3 = x y z M3 = x + y + z
1 0 0 4 m4 = x y z M4 = x + y + z
1 0 1 5 m5 = x y z M5 = x + y + z
1 1 0 6 m6 = x y z M6 = x + y + z
1 1 1 7 m7 = x y z M7 = x + y + z
Maxterm Mi is the complement of minterm mi
M = m and m = M
Purpose of the
Index
 Minterms and Maxterms are designated with an index
 The index number corresponds to a binary pattern
 The index for the minterm or maxterm, expressed as
a binary number, is used to determine whether the
variable is shown in the true or complemented form
 For Minterms:
 ‘1’ means the variable is “Not Complemented” and
 ‘0’ means the variable is “Complemented”.
 For Maxterms:
 ‘0’ means the variable is “Not Complemented” and
 ‘1’ means the variable is “Complemented”.
Questions on Canonical Form
Questions on SOP and POS

DMGT Module4 Boolean Algebra

Uploaded by

Copyright:

Available Formats

DMGT Module4 Boolean Algebra

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DMGT Module4 Boolean Algebra

Uploaded by

Copyright:

Available Formats

Introduction

 Developed by English Mathematician

No. of possible combination =

PVP’ is Tautology and PΛP’ is Fallacy

T6 : Indempotence (Identity ) Law

T7 : Absorption (Redundance) Law

 In standard SOP and POS each term of

In Boolean expression AB+AC the

Convert AB+AC in Canonical SOP

Convert (A+B)(A+C) in Canonical

Minterm and Maxterm

Individual term of Canonical Products of Sum

x y Index Minterm Maxterm

You might also like