Module2

Chapter

3
LogicGates and
Boolean Algebra
Syllabus
Digital logic gates, Universal gates, Realization using NAND and NOR gates, Boolean algebra,
De-Morgan's theorems.

Chapter Contents
3.1 Introduction 3.7 Logic Gaes
3.8 NOT Gate or Inverter
3.2 Basic Definitions of Boolean Algebra
Axiomatic Definition of Boolean Algebra 3.9 AND Gate
3.3
Two Valued Boolean Algebra 3.10 The OR Gate
3.4
3.11 Special Type of Gates or Derived Gates
3.5 Basic Theorems and Properties of Boolean
Algebra
3.12 Universal Gates
3.6 Boolean Expression and Boolean Function
 LogicGatesand

...Logical multiplication
DSD (Sem. II / E&Tc / MU) 3-2
not used and
A -B dot is We
Sometimesthis and Bas AB
multiplicationof A
3.1 Introduction : However
logical
denotethe
In the decimal system which is used in our day-to Operator:
addition, OR HIGH(1) output when
day life, the arithmetic operations such as 3.1.4 producesa logic circuit
OR-operation
subtraction, multiplication, division, square, square The the
of a
inputs
equations. or all
root etc. are used tosolve arithmetic one
any
George Boole logical addition. It i
In 1850s, the Irish mathematician HIGH(1). represents
formulating
developed a mathematical system for The "OR"
operator between thetwo variables to
so that problems can (+) sígn
logic statements with symbols denoted by a
manner similar to ordinary
be written and solved in a beadded. circuitthen it is
addedin a logic
algebra. B are to be
algebra and it is extremely If A and
This is called Boolean systems. representedas, ...Logicaladdition
of digital
useful in the design and analysis the A+ B
Boolean algebra is used to write or simplify "A OR B".
read as
logical expressions. Andit is to be

3.1.1 Basic Logical Operations : 3.1.5 Logic

Gates :
which act as the
logical expressions, used in the logic circuits
To solve or simplify the Logic gates are
"logical operators". digitalsystem.
digital circuits we need to use basic building blocks ofany
The three main logic operatorsare : circuit having one or more than
electronic
It is an
1 AND operator. only one output.
one inputs and
2 OR operator. between the input and the output is
NOT operator (Inverter). The relationship
3
based on a "certain logic".
3.1.2 NOT Operator (Inversion) : gates are named as
Depending on this logic, the
etc.
The NOT operation represents a
process of logical OR, NAND, NOR
NOT gate, AND gate,
inversion called as complementing. Truth table :
logic level to the
This operation changes one a logic circuit can be
opposite logic level as shown in Fig. 3.1.1. The operation of a logic gate or
table called "Truth
best understood with the help of a
It is implemented by using an inverter.
LOW(0) HIGH(1) Table".
LOW(0)
HIGH(1)} The truth table consists of all the
possible
(C-1211) Fig. 3.1.1: The NOT operator combinations of the inputs and the corresponding
over the
The NOT operation is denoted by a bar ()
variable which is beinginverted. state of output produced by that logic gate or logic
circuit.
.Ã= NOT A ...Logical inversion.
Boolean expression:
3.1.3 AND Operator :
The relation between the inputs and the outputs or a
The AND operation produces a high (1) output only gate can be expressed mathematically by means of
if all the inputs of a logic circuit are high (1). the Boolean Expression.
multiplication.
The "AND" operator represents logical Let us now discuss the operation of various loglt
two variables to
It is denoted by a dot between the
gates.
be multiplied. i.e.
TechKnouledge
PubIcations
 DSD (Sem. I / E&Tc /MU) 3-3
Logic Gates and Boolean Algebra
3.1.6 Gates, Symbols and Boolean 3 Anumber of axioms or postulates which have not
Expression:
been proved yet they are very useful in practice.
to order to understand Boolean algebra, we need to A set of elements is defined as the collection of
use the gates. objects which have some properties common among
So the symbols and Boolean expressions should be them.
known to us. Table 3.1.1 gives information. If S is a set and A and B are objects then A e S
(C-196) Table 3.1.1:Various logic gates denotes that A is the member of set S.
Sr. Name of gate Boolean Loglcal On the other hand B S is an indication that B is not
No Expresslon Operatlon the member of set S.
NOT gate or inverter
A set is specified as follows:
1. Y Y=A Inversion
A
S = {A, B, C, D }
AND gate This shows that A, B, C and Dare the members of
Y= AB Logical set S.
2
multiplication
A binary operator is a rule which is assigned to a
OR gate
A
pair of elements from S.
3 Y= À+B Logical addition
B
For example, if A-B = Cthen is the logic operator
NAND gate which operates on the pair A, Bto produce C.
4 Y= AB NOT AND 3.2.1 Postulates:

The postulates of a mathematical system such as the

NOR gate
5 A
Y=A +B NOT OR Boolean system are the basic assumptions from
which we can derive or formulate the rules, theorems
Exclusive OR
and properties of the system.
6 A Y= A B Addition/
Subtraction The most important postulates used in Boolean
system are as follows:
Exclusive NOR
7.
A
Y=A B NOT EXOR 1. Closure 2. Associative law
B
3. Commutative law 4 Identity element
5. Inverse 6. Distributive law.
Note: A.and Bare the inputs whereas Ydenotes the output
1. Closure:
3.2 Basic Definitions of Boolean
A set S is said to be closed for a particular binary
Algebra: MU: Dec. 04
operator for every pair of elements of S, that binary
University Questions. operator specifies a rule to obtain a unique element
Q. 1 State and prove the various laws/rules of Boolean of S.

algebra. (Dec. 04, 2 Marks) 2. Associative law:

In order to analyze and design digital circuits it is
For a given set "S" a binary operator * can be said to
necessary to express them mathematically.
beassociative if the following equation is satisfied.
In order to do so we. need to use the Boolean
(A * B) *C = A* (B *C) for all (A, B, C) e S
algebra.
..3.2.1)
Boolean algebra can be defined with the help of the
following : Note that * can be an operator such that (product)
1. A set of elements 2. A set of operators or + (addition) etc.
TechKnouwledge
 to 5
properties 1
3-4 possesS jointly possesS the
DSD (Sem. II /E&Tc/ MU) these operators
Each of logic
propertyymentionedabove.
The obtained by
3 Commutative law: above.
numbersis combini
For a given set "S" abinary operator * is said to be real thetwo
binary operato
field of numbers and
commutative, if the following equation is satisfied. The
...3.2.2) ofreal
A*B = B*Afor all A, Be S the set basis for aithmet.
the
+ and . numbersis
4. ldentity element : of real
This field a field have th
A set S is said to be having
an identity element with andalgebra. postulates of
such
an
operation * on S, if there is operators and
respect to a binary following The
satisfies the followingmeanings: addition.
element x in set S that operator + as
binary
property. ...(3.2.3) Wedefine
the operatoris 0.
1. element for +
X*A = A*x Afor every Ae S identity subtraction.
the + The inverse as
identity element is 0 for
2. additive
The example of the multiplication
3 We define definedas
operationon the set of integers (1). operator is
1, 2, ...} 4. The binary operatoris 1.
I = (.., -2, -1, 0, elementfor 1/A an
every A e. 5. The identity multiplicative inverse
of A as
.:.A+0 = 0+ A = Afor
integers () the element "0"
acts as
6 We define the
Thus for the set of as division.
it is called is th
an identity element.
law that is applicable
distributive
Inverse: 7. The only
5 That means,
with respect to a of " over +.
A set S having an identity element x (A " B) + (A
C)
have an inverse if for A· (B + C) =
binary operator is said to another of Boolean
every A which belongs
to S, there exists Axiomatic Definition
S such that, 3.3
element Bwhich also belongs to Algebra
A*B = X
integers () for which 0 is Definition :
Take the example of set of
analyze and simplify t
the identity element with respect to +
operation that Boolean algebra is used to
means X = 0and * = +. digital (logic) circuits.
would be -A numbers i.e. O and 1 it
Hence the inverse of an element A Since it uses only the binary
= x is satisfied Algebra
because only then the condition A * B also called as "Binary Algebra", or "Logical
as follows: year 1854.
A+ (-A)=0
It was invented by George Boole in the
thc
Given element
| Identity element The rules of Boolean algebra are different from
Another element in the set
Operator of the conventional algebra in the following mann
(C-128) 1. Symbols used in Boolean algebra (usually letters)
6 Distributive law: not represent numerical values.

If *and are two binary operators working ona set S, 2. Arithmetic operations (addition, subtraction, divis
then * is said to be distributive over if the following etc.) are not performed in boolean algebra. A
condition is satisfied. there are no fractions, negative numbers, Squa
A * (B C) = (A*B)· (A *C) ..3.2.4) square root, logarithms, imaginary numbers etc.
Conclusions : 3 Third and most important point is Boolean alge
Field is an example of an algebraic structure. It is a allows only two possible values ("0" to "1") for
set of elements along with binary operators. variable.

TechKnoule
 DSD (Sem. II/E&Tc/ MU)
3-5 Logic Gates and Boolean Algebra
Rules in boolean algebra :
2(b) An identity element with respect to (), designated
There are some rules to be
followed while using a by 1 :
Boolean algebra, these are:
This is because for anyAthe following expression is
1 Variables used can have only two values. Binary 1 for
HIGH and Binary 0 for LOW. always true.
A1 = 1" A = A.
2 Complement of a variable is
Overbar (). Thus complement represented
by a
of variable B is 3(a) Commutative law with respect to' (+):
represented as B. Thus if B = 0 then B = 1 and if A+B = B+ A
B = 1then B = 0. 3(b) Commutative law with respect to ():
3 ORing of the variables is A-B = B"A
sign between them. For represented
by a plus (+)
example ORing of A, B, C is 4(a) (-) is distributed over (+):
represented as A + B + c.
A "(B + C) = (A B) + (A "C)
A Logical ANDing of the two or more variables is
represented by writing a dot between them such as 4(b) (+) is distributed over ():
A.BC.D E. Sometimes the dot may be omitted A + (B -C) = (A + B)· (A + C)
like ABCDE.
5 For every binary element A, there exists an element
33.1 Boolean Postulates and Laws : called complement of A (it is denoted by A) such
MU : Dec. 06, Dec. 07, May 15 that,
University Questions A + A = l and A-
Q. 1 Explain laws of boolean algebra.
Note that if A= 0then A= 1 and if A= 1 then Ã
= 0.
(Dec. 06, Dec. 07, 5 Marks) 6. In a set of binary elements, there always exist atleast
0.2 State and prove laws of Boolean algebra.
two elements A and B such that A + B. If A = 0 then
(May 15, 10 Marks) B= 1 and vice versa.
Boolean algebra is an algebraic structure, which is
3.3.2 Differences between Boolean and
defined by a set of elements and two binary
operators namely (+) and () if and only if it satisfies Ordinary Algebra :
the postulates given below: If we compare Boolean algebra with arithmetic and
1(a) Closure with respect to operator (+) : conventional algebra in the field of real numbers,
When operator (+) ie. OR is used over two binary then the following differences are observed:
elements in agiven set, it produces a unique binary 1. The Huntington's postulates do not include the
element e.g. 1+0 =1,0 +0 = 0. associative law. But this law is applicable to Boolear
1(b) Closure with respect to operator () : algebra and it can be derived for both the operator
When operator ) i.e. AND is used over two binary (+ and -) from the other postulates.
elements in a given set, it produces a unique binary 2. The following distributive law of + over is valid fo
element e.g. 1·0 = 0, 1·1=1 etc. the Boolean algebra. But it is not valid for ordina
2(a) An identity element with respect to (+), designated algebra.
by 0: A+ (B C) = (A + B)· (B + C)
This is because for any A, the following expression is 3. In Boolean algebra, there are no
always true.
subtraction
division operations in Boolean algebra. These
A +0 = 0+A= A present for ordinary algebra.
TechKnowl
Publicat
 Gates and Booleah
DSD (Sem. II / E&Tc / MU)
3-6
Logic
operator
Agebra
3.4.1(c) :NOT
4 Table
The operator caled Complement is present for the Input
Output
Boolean algebra. But it is not available for the
A
ordinary algebra. 1

The ordinary algebra operates on the real numbers,

which consists of infinite elements (integers, negative demonstrate that
numbers, fractions etc). But Boolean algebra works going to valued
Huntington
upon only two elements 0 and 1.
We are now
postulates are
valid for
the two
operators be
Bool
t,
ean
the ahd
(0, 1) and
3.4 Two Valued Boolean Algebra : Algebra. Let S
MU: May 09 NOT.
Closure:
University Questions 1. Tables 3.4.1(a), (b)
Q.1 Explain the following law of Boolean algebra and is obvious from and
The closure of
prove that using truth table. which shows that the
result any operation
(c) 1, and we know that o,
1: Commutative law. OR, NOT) is either 0 or
(AND,
2. Associative law. 1e S.
3. Distributive law. (May 09, 10 Marks)|
ldentity elements :
2.
It is possible to formulate many Boolean algebras on and (b), we can write that,
the basis of elements we choose and the rules of From Tables 3.4.1(a)
=1
operation. 0 +0 = 0 0+1=1+0
1.0=01=0
In this book we are going to deal with only the two 1·1=1
identity elements are
valued Boolean algebra. From these expressions, two as defined
for "
It is called two valued because it has only two established which are 0 for + and 1
elements 0 and 1 with binary operators AND (), OR by postulate 2.
(+) and NOT (inversion). The commutative laws:
3
The following tables show the truth tables for these
The commutative laws are
operators.
0+1 = 1+0 and 0 1=1·0
Table 3.4.1(a): ANDoperator
Inputs Output These laws are satisfied due to the symmetry of
A B AB Tables 3.4.1a) and (b), This is illustrated by using the
following truth table.

1
(C-6135)Table 3.4.2 : Verification of the commutative law
loloE
1 Inputs
Llolo A B BA A+ B B+ A
A B
1 1 0

Table 3.4.1(b) : OR operator

Inputs Output 1 1 1

A B A +B
A B= B"A A+ B=B+A
0
4. The distributive law:
1 1
(a) The distributive law of A · (B +
1 C) = (A B) + (A C
can be proved by using the truth
1 1 tables as shoW
below.
 DSD (Sern. III /EE&Tc/ MU)
3-7
Logic Gates and Boolean Algebra
staternent i.e.
(C-6136) Table 3.4.3: Verification of the distributive law Similarly we can verify the other
Inputs
B+C A-(B+C) AB AC AB + AC
A + (B + ) = (A + B) + C
B C
of
Basic Theorems and Properties
A
3.5
1

1 loooo-o Boolean Algebra :

1

3.5.1 Duality :
1 1 following
According to the duality theorern the
1
1 1 1
Boolean
1 1 conversions are possible in a given
A (B+ C) = AB + AC expression:
operation.
(b) The distributive law of + over " can also be proved 1. Change each AND operation to an OR
AND operation.
using the truth tables in the similar way. 2 Change each OR operation to an
expression.
Inverse: 3. Complernent any 1 or 0 appearing in the
5. creating new
Erorm Table 3.4.1(b) it is easily seen that, Duality theorem is sometimes useful in
expressions.
expressions from the given Boolean
A+ =1 ie. 0 +1= 1and 1 +0 =1 A + 1 = 1then
For example if the given expression is
Andfrorm Table 3.4.1(a) it can be shown that, operation
replace the OR (+) operation by AND()
the dual of the
A A =0 ie. 0.1=0 and 1.0 = 0 and take complement of1 to write
This verifies postulate 5. given relation as,
A0 = 0
Postulate 6 says that there exists at least two
elements A and B such that A # B. As Boolean The dual of A (B + C) = AB + AC is given by,
algebra has two distinct elements 0 and 1 (A and B), A+ (B "C) = (A + B) · (A + )
this postulate is getting satisfied because
constructing
0+1(A B). It is possible to verify this theorem by
truth tables for both the sides of equations.
7. Ass0ciative Law: MU: Dec. 16
3.5.2 Basic Theorems:
This law states that the order in which the logic
University Questions
operations are performed is not important because
Q. 1 State basic theorems of Boolean algebra.
for any order the effect is the same.
(Dec. 16, 5 Marks)
i.e. (A B) C = A" (B -C)
And (A +B) + C = A+ (B + C) 1 AND Laws :
These laws are related to the AND operation
The associative laww can be verified by referring to the
following truth table. therefore they are called as "AND" laws. The AND
laws are as follows :
(C6137) Table 3.44 : Verification of the associative law
1. A
.0= 0:
Inputs B-C A(B C) AB A B)C
ABC That means if one input of an AND operation is
1
permanently kept at the LOW (0) level, then the
1 output is zero irrespective of the other variable.
1 1 1
1 2 A1=A:
1 1
That means if one input of an AND operation is
1
1
11 1
HIGH (1) permanently then the output is always
A (B C) =(A· B)· C equal to the other variable.
Tech Kaswkedge
PubiIt ations
 Logic Gates and Boolean Algebr
ie
DSD (Sem. IlII/ E&Tc/ MU) 3-8 the input
equal to
will be
Output also
So if A= 0, then Y= 0"1=0ie. Y= Aand if A= 1, the and for
respectively. i.e. Y= A
then Y=1·1=1 so Y= A. + 0=
0
A = 0. Y = 0
For A.
3.A A=A: 1ie. Y =
Y= 1+1 -
That means if both the inputs in an AND operation A+ "OR"
have the same value either "0" or "1" then the output 4. the result of an
states that complementis alwayS
operatio
will also have the same value as that of the input. This law
variable andits =1
(HIGH),
AÅ=0:
on a
and Y=0 + 1 whereas
4
then A = 1
If A = 0 =1+0=1,
This law states that the result of an "AND" operation and Y
=1 then A= 0
A
on avariable (A) and its complement (A) is
always
Summary of OR Laws:
LOW (0). 3. A+A = A
1. A+ 0= A
whereas if A= 1 A+A = 1
If A=0 then A = land Y = 01=0 4
2. A+1 =1
then A=0 and Y=1·0=0.
INVERSION Law :
Summary of AND Laws:
3
operation. The inversion I
This law uses the "NOT" a douhl
1. A"0 =0 3 A"A =A if a variable is subjected to
states that variah.
it will result in the original
2 A"1=A 4. A -A = 0 inversion then
itself i.e.
2 OR Laws :
they are
These laws use the OR operation. Therefore A
called as OR laws. The OR laws are as follows:
illustrated in Fig. 3.5.1 whick
Inversion law is being
(A) = 0..yY =A
1. A+0= A: shows that if A= 0then A = 1and
That means if one variable of, an "OR" operation is and (Ä) =1
whereas if A=1 then A = 0
LOW (0) permanently, then the output is always .. Y = A.
equal to the other variable. A=0
A=0 Y=(A) =0 A=1 =° Y=(A) =1
B=0 permanently therefore for A= 0, Y= 0 + 0= 0
i.e. Y= Aand for A= 1,Y= 1+0=1 i.e. Y= A.
(B-481) Fig. 3.5.1: 1Ilustration of inversion law :A = A
2 A+1=1: Table 3.5.1: Collection of Boolean laws
That means if one variable of an "OR" operation is Sr.
HiGH (1) permanently, then the output is HIGH (1) Name Statementofthe aw
No.
permanently irrespective of the value of the other
1. Commutative Law A-B=BA
variable.
A+B= B+A
Here B = 1 permanently, so if A = 0 then
2. Associative Law (A-B)· C=A" (B C)
Y=0 + 1 = 1 and if A= 1then Y= 1 +1= 1.
(A+ B) +C=A+ (B+C)
Thus output rernains HIGH (1) always, irrespective of
the value of A.
3. Distributive Law A (B+ C)= AB + AC
A AND Laws A0= 0
3 A+A=A: A"1=A

This law states that if both the variables of an OR A A=A A

operation have the same value either "0" or "1" then A=0

TechKnouled
 Algebra
DSD (Sem. III /E E&Tc / MU) Logic Gates and Boolean
3-9
table
verified by writing a truth
This theorem can be
Sr. Name Statement of the law as shown in Fig. 3.5.3.
NO.
OR Laws AB A A+ B
A +0 = A A B

A+1= 1
<oo- 1 1 1

1 1
A+A = A 1 1

1
A+A =1
Inversion Law A =A
LHS AB= A+B RHS
6
=A + B
Verification of the theorem AB
Other Important A + BC = (A+ B) (A + C) (C-6138) Fig. 3.5.3 :
7
Laws NOR= Bubbled AND:
A+ AB =A+B Theorem 2: A+B =A "B:
of
in Fig. 3.5.4. The LHS
A + AB =Á+B This theorem is illustrated
NOR gate with inputs A
A + AB=A this theorem represents a
represents an AND gate with
and B whereas the RHS
A+AB = A + B
inverted inputs.
Thus
De-Morgan's Theorems : called as "Bubbled AND",
35.3
X
MU: Dec. 15, May 16, May 18, May 19
Such an AND gate is
we can state
De-Morgan's second theorem as a
NOR

bubbled AND function.

University Questions function is equivalent to a
State and prove De-Morgan's laws.
Q. 1 NOR = Bubbled AND
(Dec. 15,10 Marks) Y=
A
o. 2 State and prove the De Morgan's theorem A Y=A+B

(May 16, May18, May 19, 6 Marks) B B Bubbled AND

NOR
The two theorems suggested by De-Morgan and De-Morgan's second
(B-484) Fig. 3.5.4: Illustrationof
which are extremely useful in Boolean algebra are as theorem
follows: writing a truth table
This theorem can be verified by
Theorem 1: AB =A +B: NAND = Bubbled OR: theorem statement. This
for both the sides of the
which shows that
This theorem states that the, complement of a truth table is shown in Fig. 3.5.5,
product is equal to addition of the complements. LHS = RHS.
AB
This rule is illustrated in Fig. 3.5.2. The Left Hand Side B A+B A B

(LHS) of this theorem represents a NAND gate with 0 1 1

of
inputs A and B whereas the Right Hand Side (RHS)
1
1 1
inverted
the theorem represents an OR gate with 1 1

inputs.
Thus we LHS A+ B=AB RHS
Such an OR gate is called as "Bubbled OR".
can state De-Morgan's first theorem
as a NAND (C-6139) Fig. 3.5.5: Truth table to verify De-Morgan's
theorem
operation isequivalent to abubbled OR operation.
NAND = Bubbled OR 3.6 Boolean Expression and Boolea
Function :
Y= A+B
Y= AB A
B Boolean algebra deals with binary variables and l
NAND
Bubbled OR
operations. A Boolean function is described by
theorem algebraic expression called Boolean expression w
(B-482) Fig. 3.5.2 : Ilustration of De-Morgan'sfirst
Tech Knoul
Publicat
 Logic Gates and Boolean Algeb

DSD (Sem. III /E&Tc/ MU) Boolean

3-10 Reducingthe
consists of binary variables, the constants 0 and 1 Exampleson
3.6.2 Expression:
and the logic operation symbols. expressione.
following Boolean
the
Consider thefollowing example: Ex, 3.6.1: ProveA +AB=A
1.
F(A, B, C, D) = A+ BC +ADO A+AB=A +B
2 + C) =A+ BC
Boolean Boolean ..3.6.1)
3 (A+B)(A
function expression
(C-6140)
Soln. :
Here the left side of the equation represents the A+ AB=A:
Toprove that B)
output Yof a logic circuit. So we can state Equation 1.
= A+ AB = A(1 +
LHS
=A"1 But
(3.6.1) as,
But (1 + B)
= 1 . LHS A·1*|
RHS
Y = A + BC + ADC ..3.6.2) LHS = A=
Another example of Boolean function is as follows : A+ AB = A
...Proved.
F(A, B, C) = A + BC ...3.6.3)
A+ AB=A +B:
...3.6.4) 2 To prove that
or simply Y= A+ BC AB
LHS = A +
3.6.1 Truth Table Formation : = A+ AB + AB ...since A=A+AB
.

It is possible to convert the switching equation into a A)

LHS = A+ B(A +
truth table. For example consider the following
switching equation. But (A + A) = 1
f (A, B, C) = A + BC =A +B
LHS = A+ (B " 1)
It shows that there are three inputs A, B, andCand LHS = RHS
one output f (A, B, C) or simply F.
= A+B ... Proved.
.. A +AB
The output will be high (1) if A = 1or BC = 1 or both
are 1 due to the (+) i.e. OR function present between C) = A+BC:
3 To prove that (A + B) (A +
A
and BC.
LHS = (A + B) (A + C)
The truth table for this equation is shown by .. LHS = AA + AC + BA + BC
Table 3.6.1. The number of rows in the truth table is
2" wheren is the number of input variables (n = 3 for .....According to the distributive law.
the given equation). But AA = A,

Hence there are 2 = 8possible input combinations .. LHS = A+ AC+ BA+ BC

of inputs from ABC = 000 toABC = 111, .. LHS = A
(1+ C) + AB + BC
(C-6141) Table 3.6.1:Truth table for f(A, B, C) = A + BC
Inputs Output But (1 + C) = 1
B C
.:. LHS = A + AB + BC = A(1 + B) + BC
1 But (1 + B) = 1
1
Eight possible Value of output F LHS = A+ BC
1 corresponding to each
Combinations
1 0 1 Thus (A +B) (A +C) = A+ BC
of inputs combination of inputs .. Proved.
1 1
1 1

1 1 1 1 Ex. 3.6.2 : Solve the following function using Boolean

laws
If there are two inputs (n = 2), then there are 2 =4
combinations of inputs. For four inputs (n = 4), there F=A+BD +DCA +AC
are 2 = 16 combinations. May 06, 5 Marks
RTechKnowledge
 Boolean Algebra
DSD Sem. III /EE&TC /MU) Logic Gates and
3-11

Soln.:
AB = +B
But
...De-Morgan's first theorem
F = A + BD + DCA+ AC
BD.6
= A + AC + BD + DCA y = AD. CD +
BDCD
= A (1 + ) + BD + DA .
y = (A + D)CD +
= A + DC + BD [1 +C= 1] = (A+ D) CD + BCD

= A + DC+ BD[:A + B= A +B] = ACD + CDD + BCD

Simplify the following equations: .. DD = 0]
Ex.3.6.3:
= ACD +0 + BCD
A-B+AC= AB + BC+A.c
Dec. 06, 5 Marks = CD (A + B)
ABCD + ABCD
Soln.: A..B+A:C= AB + BC+ A..C
3 y = ABCD + ABCD +
B)
LH.S. = AB + AC = ABC (D + D) + ACD (B +
= AB (C + 1) + AC (B + 1) = ABC+ ACD

1]
[since (C+ 1) = 1 and (B + 1) = 1] ..." D + D =1and B+ B =
= ABC+ AB + ABC + AC = A(BC + CD)
AB + BC+
= C(A + AB) + B (AC + A) Ex, 3.6.5: Using Boolean algebra prove that
= C(A + B) + B (A + C) AC= AB + AC.
Marks
Dec. 08, 4 Marks, Dec. 17, 10
= AC + BC + AB + BC Soln. :

= AB + BC + AC 1. AB + BC + ÁC = AB + AC

(: A + A = A using OR law) LH.S. = AB + BC + AC

Ex. 3.6.4: Simplify using Boolean algebra: = AB + BC (A + A) + AC

1. y= (A+ BC) (B + CA) .."A+ A = 1]
2. y= AD + CD BD +CD = AB + ABC + ABC + AC
3. y= ABCD +ABCD +ABCD +ABCD = AB (1 + C) + AC (B + 1)
May 07, 9 Marks
Soln. :
But (1 + C) = 1 and (B + 1) = 1

1 y = (A + BC) (B + CA) LH.S = AB + AC = R.H.S ...Proved.

= AB + A - AC + B. BC + ABCC Ex. 3.6.6: Prove thefollowing using Boolean theorems:

= AB + AC + BC+0
1. [c+Co) c+Gõ] [AB +AB+AeBl
[AA = A, B-B = B, C-C = 01 2. BC+ABC+AB+ ABC
=AB+AO+BC
= AB + AC + BC May 10, 6 Marks, May 14, 5 Marks.
Dec. 17, 10Marks
2. y = AD + CD . BD + CD Soln. :

y = AD + CD + BD + CD 1. c+TD) (C +CD] AB + +AeB =C

Tech Knowledge
PublIration
 Logic Gates and Boolean Algebra

DSD (Sem. III / E&Tc /MU) 3-12 + BB

+AB + AB
= A
AB + 0
LH.S. =(C + D) (C + D) AB + B+Ae B =
0+AB+
B
= (C+ D) (C+ D) [AB + + + AB] Z = A
expression
[ A+ÃB = A+ B, A+ AB = A +B]
Simplify the
following USIng
Ex, 3.6.8 : Boolean algebra : 6,7)
=(CC + CD + CD + D) [A (B + B) + A (B + B)] Em(0, 1, 2,3, 4,5,
=
Y(A, B,C) Dec. 18, 5 Marks
= (C + CD+ CD) (A + A)
[: B+ B= 1, C.C=Cand DD = 0) B.
Soln. : ABC+ A
= C(1 + D+ D) [: A+ =1)
Y(A, B,C) = ABC+ ABC
(': 1+D+ D=1) ABC +
C) + A B (C+C) + AB (+
..Proved. + +
= AB(+ )
LH.S. = R.H.S
=1)
...(. C+
ABC + ABC+ ABC + ABC = AB + AC+ BC A B + AB
2 = AB + AB +
LH.S. = ABC+ AB C+ABC + ABC A(B +B) + A (B + B)
=
= AB C+ A B(C +C) ..(B + B = 1)
+A
= AB C+ A(B + BC) = 1
of a Function:
[: C+C = 1] 3.6.3 Complement
We
complement of afunction F is denoted by F.
= ABC+ A (B + C) The
by 0's
|: A+ AB = A + B] obtain F by replacing O's by 1's and 1's
can
of F.
= BC+ AB + AC = C(A + A B) + AB
A while calculating the value
complement of a function
It is possible to derive the theorems. We can
= C(A + B) + AB['" A+ AB = A + B] algebraically using De Morgan's
three or more
= AC+ BC + AB extend De Morgan's theorems to
variables as welI.
.. LH.S. = R.H.S ...Proved.
first theorer
The three variable form of De Morgan's
Ex, 3.6.7: Whích of the following expression is derived as follows:
equivalent to
LHSS = (A +B + C)
Z=A(AB) B(AB)
1. Z=A DB 2. Z= A B Let B+C = D
3 Z= A+B 4.Z =A.B
:. LHS = (A+D)
Prove it. Dec. 18, 5 Marks

Soln. : = A.D ...As per De Morgan's theorer

Ans. : (0)
= A (B+ C)
Proof: Z = A (AB) · B (AB)
A · (B C)
= A
(AB) + B (AB)
= [A ( + B)J + B[ + B . (A + B+C) = AB.C ...Prove

TechKnowlede
 nsp (Sem. III /E&Tc / MU)
3-13 Logic Gates and Boolean Algebra
On the same lines we can
derive the De Morgan's We have to use different laws,
rules and theorems to
theorems for any
number
of
variables. These
theorenms in the analyze the digital circuits.
generalized form can be stated as
follows : mentioned earlier, in
By connecting the gates
perform
B+C +D different ways, we can build circuits that can
1. (A + ..... + G) = A. B.C.D. . . . G with the
arithmetic and other functions associated
2 (A BC.D. G) = A + B + C+ D
.....
human brain.
Ex. 3.6.9: Find the
+...... G
complements of the following
functions: Because they simulate mental processes, gates are
often called as logiccircuits.
F,=ABC +ABC and F, =A (BC+ BC)
3.7.1 Classification of Logic Gates :
Soln. :
are classified
ABC As shown in Fig. 3.7.1, the logic gates
1. F, =ABC + into three categories namely, the basic gates,
the
universal gates and the special purpose gates.
.:. F, = (ABC+ ABC)
Logic Gates

= (AB C)"(ABC)
Special Purpose
Basic Gates Univorsal Gates Gates
.:: F, = (A + B+ C)·(A +B+C)
...Ans. NOT gate EX-OR gate
NAND gate
. AND gate " EX-NOR gate
NOR gate
"OR gate
2. F, = A(BC+ BC)
(B-448(a)) Fig. 3.7.1l: Classification of gates
.:. F, = [A (BC+ BC)] NOT Gate or Inverter:
3.8

= A+ (BC + BC)] Definition :

The NOT gate is a logic gate that produces an

= A+ (B C) (BC) inverted version or "complement" of its input. It is
also known as an Inverter.
.:. F, = A + (B +C) (B + C) ...Ans.
Logical symbol and Truth Table:
3.7 Logic Gates : The NOT gate or Inverter is a logic gate having one
Definition: input (A) and one output (). Its symbol and truth
table are shown in Fig. 3.8.1.
Logic gates are the logic circuits which act as the -Bubble represents inversion

basic building blocks of any digital system. Symbol : Input A o o Output Y

Boolean equation :Y=
It is an electronic circuit having one or more than
"Truth table (a)
one inputs and only one output. Input A Output Y A=0 Y=A=1
The relationship between the input and the output is 1
A=1
1
based on a "certain logic".
Depending on this logic, the gates are named as (b) (c) Equivalent circuits
(B-450) Fig. 3.8.1 : Symbol, truth table and equivalent circuit
NOT gate, AND gate, OR, NAND, NOR etc. of a NOT gate
TechKnowledge
PubiCatlons
 and Boolean
Logic
Gates Algebra
boththe
DSD (Sem. IlI / E&Tc /MU) 3-14 and onlyif inputs
low(0)if
will be
Boolean expression : Its output
simultaneouslylow(0).
are
lhe expression relating the inputs Aand output (Y)
expression. symbolof atwo input
od an inverter is called as its Boolean Logical symbol :
logical
the
The Boolean expression for an inverter is,
Fig. 3.10.1(a) shows
Y = A OR gate.
two
3.9 AND Gate : Truth table :
the truth
table for a
LOW(0) if and
input
3.10.1(b) shows Yis
It performs the Fig. output
AND is one of the logic operators. Note that
the
OR gate. (0).
logical multiplication on its inputs. are LOW
both the inputs (1), then
only if all the inputs onlyif are HIGH
The output is high (Y = 1) if and or both
the inputs
to the AND gate are high (1). If anyone
HIGH (1). Output
one or more inputs are Output Yis Inputs
The output is low (0), if any
two or more inputs and A
low (0). AND gate can have
only one output. 1
1

Logical symbol and Truth Table : -Y(Output) 1

input AND gate is as

The logical symbol of atwo 1 1 1

shown in Fig. 3.9.1(a). (b) Truth table

input AND gate is shown in (a) Logical symbol
The truth table of a two
output is HIGH (1) only input ORgate
Fig. 3.9.1(b). Note that the (B-460)Fig. 3.10.1:
Two
when both the inputs are HIGH (1).
Inputs Output Boolean equation :
A expression fora two input OR gate is,
The Boolean
oo
Y = A+ B
-Y (Output) 1
Derived
Special Type of Gates or
Inputs
3.11
(b)Truth table Gates :
(a) Logical symbol
gates.
EX-OR and EX-NOR gates are special type of
(B-453) Fig. 3.9.1
as haif adder,
Boolean expression: They can be used for applications such
output
The expression relating the inputs (A, B) and full adder and subtractors.

( of a gate is called as the Boolean expression. These gates are also called as the derived gates.
The Boolean expression for an AND gate is, 3.11.1 The EX-0R Gate :
Y = AB

and Truth table:

where the "dot" between A and B represents | Symbol
multiplication. The exclusive-OR gate is abbreviated as EX-OR gate
3.10 The OR Gate : or sometimes as X-OR gate.
An EX-OR gate can have two or more than two input
An "OR" gate performs the logical addition on its terminals and one output terminal as shown in
inputs therefore its output will be high (1) if any one
Figs. 3.11.1(a) and (b).
or both the inputs are high (1).
TechKnowledge
 pSD (Sem. III / E&Tc / MU)
3-15 Logic Gates and Boolean Algebra
Y=A9B.
Symbo! of atwo input EX-OR gate
(a) Inpus
A
Output
Y

gate
(a) Symbol of a two Input EX-NOR
1 1

A
1
B Y-A@ BOCO D
Symbol of a four input EX-OR gate (c) Truth table of a
(b) two input C
EX-OR gate D

(B-475) Fig. 3.11.1 (b) A four nputEX-NOR gate

The truth table of atwo input EX-OR gate is Inputs Output

shown in
a 3 11.1(c), which shows that, A Y
when both the inputs 1
are at identical logic levels (A = B), the
output is low 1
(0)i.e. Y =0 for A = B = 0 or A = B= 1, and the 1

output is high (1) when A B 1 1

Boolean expression:
(c) Truth table of a two Input
EX-NOR gate
The Boolean expression for the two input
EX-OR gate (B-478) Fig. 3.11.2
ie V= A B. The alternate Boolean
expression fora
hwo input EX-OR gate can be as follows : Boolean expression :

Y = AB + AB The Boolean expression for an EX-NOR gate is given

Applications of EX-OR: by,
Y = AB or Y= AB+ AB
Some of the applications of an EX-OR gate are as follows:
= AO B
1. As amagnitude comparator.
2 In the binary to gray code converter. Applications of EX-NOR:

3. In the adder and subtractor circuits. 1 As even parity generator.

2. As a comparator.
4 In the parity generator.
3. As even parity checker.
5. As a modulo-2 adder.
3.11.3 Realization of Switching Functions :
3.11.2 The EX-NOR Gate :
The Boolean expression is also called as a switching
Symbol and Truth table : function. A switching function can be realized or
The word EX-NOR is a short form of exclusive-NOR. described in three different ways:
Exclusive-NOR means NOT-exclusive OR, So EX-NOR 1. Switching equations.
2. Truth tables.
gate is equivalent to an EX-OR gate followed by a
NOT gate. 3. Logic diagrams.
The symbol for a two input EX-NOR gate is as shown 3.11.4 To Draw a Logic Circuit from Boolean
in Fig. 3.11.2(a) and its truth table is given in Equation:
Fig. 3.11.2(c), which shows that the output of an EX First we develop the switching equations necessary
NOR gate is high (1) if both the inputs are identical
for realization of acombinational logic function.
(A = B) and the output is low (0) if the inputs are not Then each term in this equation is represented by
identical (A # B). logic gate.
 LogicGates

DSD (Sem. II / E&Tc / MU) 3-16

4
All these logic gates are then connected to each
other to form the logic diagram. 3.11,2
P.
This is called realization of switching functions using (C-160)Fig. expression
given
Boolean Use one
logic diagram. Following examples willillustrate the Sketchthe
ORgate
only:
Ex. 3.11.3: one
concept. ANDgate
AC
Ex. 3.11.1: Draw the combinational circuit using the basic Y= AB+
gates to obtain the following output : AC
Soln. :
= Y= AB +
Y= AB + BC + AB expression
Given C)
Soln. : A (B +
.: Y = expressed using logic gates a
This circuit has three inputs A, B, C and one output. expression can be
Step 1 :mplement the three individual terms : This 3.11.3.
shown in Fig. P.
A(B+ C)
Term 1: AB

B+C
Term 2: 3.11.3
(C-161)Fig. P.
ciruit for thefunction
Ex, 3.11.4: Draw thelogic
f=A BCD+ABCD+ABCD+ABC
A
-
function using Boolea
Term 3:
B
then simplify the
circuit.
simplified
(C-158) Fig. P. 3.11.1(a) Algebra and draw the
Dec. 09, 10 Marks
circuits :
Step 2:Logically add the outputs of the three
A AE Soln. :
+ ABCD + ABCD
B OR = Logical adding f = AB CD+ABCD
BC BCD +A BCD
Y= AB + BC + A B = ABCD + A
ABCD
= CD [AB+ AB]+
AB =CD [A B] + A BCD

(C-159) Fig. P. 3.11.1(b) Simplified circuit :

B

Ex. 3.11.2: Sketch the following equation. Use one AND D

gate and one OR gate only :
Y= (A + B) (A + C)
Soln. :

Y = (A + B) (A + C)
= AA + AB + AC + BC
= A+ AB + AC + BC ...(" A.A = A)
= A (1 + B + C) + BC

.Y = A+BC .. (: 1+B +C= 1)

This expression can be expressed using logic gates as
shown in Fig. P. 3.11.2. (C-2992) Fig. P. 3.11.4
 Algebra
DSD (Sem. IIII /E&Tc / MU) Logic Gates and Boolean
3-17

Ex.3.11.5. Prove that ABC + ABC + ABC + ABC = AB + (AOB)

AC + BC and represent using

gates. CD(ADB) f= CD(AOB) + ACD
Dec. 04, 10 Marks
D

Soln.:
ABC + ABC + ABC + ABC= AB + AC + BC

LH.S. = ABC + ABC + ABC + (C-3343) Fig. P. 3.11.6

Expression for a
= AB (C+ C) + ABC + 3.11.5 To Write a Boolean
Logic Circuit :
= AB + ABC + ABC
given to us and we
Sometimes a logic diagram is
equation or Boolean
= A(B + BC) + [: C+C= 1] have to write the switching
outputs.
equation relating the inputs and
= A(B + C) + ABC [: B + BC = B + C] The procedure for this is as
follows :

1. Start from the input side.

= AB + AC + ABC = AB + C (A + AB)
of each input
2. Write the equation at the output
= AB + C(A + B) : A + AB = A + B] gate.
3 Repeat this process and
progress towards the
= AB + AC + BC = RH.S. output.
The expression can be implemented as follows:
4. Write the switchingequation for output.
in the following
This procedure is demonstrated
AB
éxamples.
for the ogic
Ex. 3.11.7: Obtain the Boolean equation
BC circuit shown in Fig. P. 3.11.7(a).
y= AB + AC + BC
B
Inputs Y(Output)
AC

(C-162) Fig. P. 3.11.7(a)

(C-3342) Fig. P. 3.11.5
Soln. :
Ex. 3.11,6: Draw the logic circuit for the function Step 1:Equations for input gates :
f= ABCD + ABCD + ABC D + ABCD then Gates- 1 and 2 are the input gates.
A Y,= AB
simplify the function using Boolean algebra
and draw the simplified circuit.
(C-163) Fig. P. 3.11.7(b)
May 05, 8 Marks
Step 2: Equations for output gate :
Soln.: Gate - 3 is the output gate.
Y,
f = ABCD + ABCD + D + ABCD
Yz
=CD (AB +AB) +ACD (B + B) (C-163(a)) Fig. P. 3.11.7(c)
Y =Y, +Y,
= CD (A B) + ACD
.:. Y = (A - B) + C
[AB + AB = A B= B+ B= 1]
This is the final expression.
TechKnow
 Logic Gal
are
gates ? Why
DSD (Sem. IlI / E&Tc / MU) 3-18 universal
basiclogic gate
hey so
Ex. 3.11.8: Write the Boolean expression for the logic Q. 3
VWhat are
the
Designany
one (Dec. 19, UsinMarks)
g on
called?
circuit shown in Fig. P. 3.11.8. universalgates.

A
Di Definition:

The logic
gate
using

expressionis
which we can reaize
knoWn as a
universal

called as
gate.
Boolean
The NAND
and NOR gates are
possible to implement"Universa
(C-164) Fig. P. 3.11.8: Given circuit because it is of only
Soln. :
Gates"
Boolean
expression with
the help NAND
Step 1 : Equations for input gates : only NOR gates. logical circuit
can build any with the
Input gates are 1, 2, 3. Therefore a user gates.
NANDgates oronlyNOR
.. Y, =A help ofonly a user will have to
advantage because
This is a great only NAND or NOR gate ICs with
Y, = B of
make a stock
And Y, = C him.
Gate :
Step 2: Equation for gate - 4: 3.12.1 The NAND
Y4 = Y,Y, = A. B
Logical symbol :
wh:
Step 3: Equation for gate -5:
NAND can be split as NOT-AND
The term
Y =Y, + Y, = (A: B) + C ...Ans. the NAND operation can
means that
AND nt.
Ex, 3.11.9: Prove that a dual of exclusive OR is also its implemented with the combination of an
complement Dec. 08, 4 Marks inverter.
Soln. :
and a NOT gate i.e.
to an AND gate
The Boolean expression for EX-OR gate is, Thus a NAND gate is equivalent
3.12.1(6).
Y = A B followed by an inverter as shown in Fig.
Bubble represents
ie. Y = AB + -inversion

Dual of EX-OR gate Y = (A + B)·(A + B) Y(Output)

= A + AB + B + BB
(a) Logical 'symbol (b) Equivalent circuit
= 0 +AB + AB +0 :A 0]
nputs Output
.: Y = AB + AB = A B
...Hence proved.
3.12 Universal Gates:
MU: May 05, May 06, Dec. 09, Dec. 19
1
University Questions
Q. 1 What are uníversal gates? (c) Truth table
(B-467) Fig. 3.12.1 :Two input NAND gate
(May 05, Dec. 09, 2 Marks)
The symbol of a two input NAND gate is shown in
Q. 2 List the different universal gates and justify why are
they so called ?
Fig. 3.12.1(a) where a bubble (o) on the output side
(May 06, 2 Marks)
represents inversion.
Tech Knowledgë
PudIcatlons
 DSD (Sem. /E&TC/ MU)
3-19 Logic Gates and Boolean Algebra
Truthtable:
connected
As both the inputs of the NAND are
The truth table of atwo input together, we can write that,
NAND gate is
Fig. 3.12.1(c), which shows that the output is shown
in
low(0) if Input = A = B = A
and only if both the inputs are high (1)
simultaneously. So output is given by,
es all other input Y = A.B=AA
combinations the output voltage ..since A= B= A
willbe high (1).
A NAND gate is called as "Universal Gate" But A· A = A Y= A
can construct AND, OR and NOT because
gates using only This expression is the Boolean expression for an
NAND gates.
inverter. Hence Fig. 3.12.2(a) is an inverter.
Boolean expression:
2. AND gate using NAND :
TheBoolean expression for the two input NAND gate Y = A.B ..AND gate
is, Y= AB Y = A"B ...Double inversion
Mhere the line (bar) over the expression A. B
represents an inversion. ..Y = A.B= A·B ...3.12.1)

3.12.2 Universality of NAND Gate: Equation (3.12.1) can be realized using only NAND
gates as shown in Fig. 3.12.2(b).
MU: May 14, Dec. 16, Dec. 17, May 18, Dec. 19 AB
University Qåestions
Input
0.1 Implement EX-OR gate using NAND.
(May 14, 5 Marks) (B-506) Fig. 3.12.2(b) : AND gate using NAND
Q. 2 Prove that NAND and NOR gates are universal 3. OR gate using NAND:
gates. (Dec. 16, Dec. 17, May 18, 10 Marks) Y = A + B ... OR gate
Q.3 What are the universal gates ? Why are they so
Y = A+ B Double inversion
called ? Design any one basic logic gate using only
universal gates. (Dec. 19, 5 Marks) .:. Y A.B .. De Morgan's law
In this section we are going to illustrate the This is the required expression.
conversion of each logic function into an expression So Y = A+B
using only NAND gates.
= A-B and Fig. 3.12.2(0) shows the realization.
Note : ANAND gate is expressed mathematically as

Y=AB
A
Y= A+B
Hence we have to bring the given Boolean
expression into this form.

1. NOT gate (!nverter) using NAND gate :

Fig. 3.12.2(a) shows the realization of a NOT gate (B-507) Fig. 3.12.2(c): OR gate using NAND gates
(inverter) using a two input NAND gate.
4. NOR gate using NAND :

Input -Y (Output) Y = A+ B ... NOR gate

= A·B...as per De Morgan's theorem

(B-505) Fig. 3.12.2(a) : NOT using NAND
TechKnouwledge
Pubcat Ions
 LogicGatesall
EX-NOR
expressionfor in terms
DSD (Sem. lII /E&Tc /MU) 3-20 3.12.2(0
the
required
gates. Fig.
shows
This is NAND
Y = A.B ..Double inversion
only
of
realization.
This is the required expression. A

=À+B
using only NAND gates
3.12.2():EX-NOR
(B-508) Fig. 3.12.2 (d) : NOR gate using only NAND gates (8-510) Fig.
NOR Gate :
Fig. 3.12.2(d) shows the realization of NOR gate using 3.12.3 The
NAND gates. Logical symbol :
universal gate.
This is another which
..A +B = A.B
be split as NOT-OR means
can
EX-OR gate using NAND : The word
NOR implemented with u
5
operation can be
Y = A B
that a NOR gate and a NOT gate
i.
combination of an OR
equivalent to an OR gate
= AB + AB ... EX-OR gate Thus a NOR gate is
inverter. 3.12.3(b)
inverter as shown in Fig.
Y = A B + AB ...Double inversion followed by an i
two input NOR gate is shown
The symbol of a sida
Let X = AB andZ= AB.
where a bubble (o) on the output
Fig. 3.12.3(a),
..Y = X+ Z represents inversion.

Using De Morgan's theorem X+Z = X.Z Truth table :

input NOR gate is shown in
.:.Y = X-Z =(AB )·( AB) The truth table ofa two
that "the output ofa NOR
This is the required expression for EX-OR using only Fig. 3.12.3(c), which shows
its inputs are low (0
NAND. Fig. 3.12.2(e) shows the realization. gate is high (1) if and only if all
simultaneously".
is low (0) if any
The output of a two input NOR gate
Y= (AB)· (AB)
=A B one or all the inputs are at high (1) level.
Symbols:
A

-D Bubble represents
-inversion

Y(Output)
(c) Truth table
Inputs Output
(B-509) Fig. 3.12.2(e) :EX-OR using NAND gates
A B Y
6 EX-NOR using NAND :
(a) Logical symbol
1
Y = AOB= AB + AB
R.
= X+Z ..EX-NOR gate 1

Taking double inversion of RHS, (b) Equivalent circuit

(B-471) Fig. 3.12.3 : Atwo input NOR gate
Y = X+ Z= X.Z .De Morgan's theorem NOR gate, like NAND gate can be used as a universal
gate.
:.Y = ( AB)·( AB )
Tech Knouwledge
P blcations
 /
(Sem. III /E&Tc IMU) Algebra
pSD
3-21
Logic Gates and Boolean
Booleanexpression:
expression for
This is the required expression.
The Boolean the two input A Y
isgivenby, NOR gate
only NOR gates
Y = A+ B (B-512) Fig. 3.12.4(b) : OR using
OR gate using
Fig. 3.12.4(b) shows the realization of
3.12.4 Universality of NOR Gate: only NOR gates.
MU:Dec. 16, Dec. 17, May 18 .. Y = A + B =A +B
University Questions
3 AND using only NOR gates :
Q.1 Prove
that NAND and NOR gates are Y = A .B . .AND gate
gates. (Dec. 16, Dec. 17, May 18, 10universal
Marks) Y = A.B ...Double inversion
this section we are going to
In
implementation of illustrate the
every logic operation using only . Y = A+ B
...De Morgan's theorem
NOR gates.
This is the required expression, Fig. 3.12.4(c) shows
to do so, the
In order Boolean expression of the the realization of AND gate using NOR gates only.
given logic circuit must be first
Converted into the
NOR format which is as follows
: A-8
Y = A+ B

Theimplementation of various logic functions using

only NOR gates is illustrated in Fig. 3.12.4.
(B-513) Fig. 3.12.4(c):AND gate using only NOR gates
4 NOT 9gate (inverter) using NOR: 4. NAND gate using only NOR gates :
Fig. 3.12.4(a) shows the realization of a NOT gate
Boolean expression for a NAND gate is,
using only NOR gate.
As both the inputs of the NOR gate are connected Y = A.B
together, we can write that. =A+ B .using De Morgan's theorem
A = B=A Take double inversion of RHS to get,
So output of NOR is given by,
Y = A+ B
Y = A + B
This is the required expression. Fig. 3.12.4(d) shows
= A+A the realization of NAND gate using only NOR gates.
But A+ A= A

Y = A Y= AB

This is the Booiean expression of an inverter. So

Fig.3.12.4(a) indeed represents an inverter. B
A (B-514) Fig. 3.12.4(d) : NAND gate using only NOR gates
Input -Y (Output)
5. EX-OR using only NOR:

(B-511) Fig. 3.12.4(a) : NOT gate using NOR gate Y = A B= AB+ AB ..EX-OR gate
2. OR using NOR:
Let X= AB and Z = AB
Y = A+B . OR gate
:.Y = X + Z
Y = A+ B ..Double inversion Y = X+Z ...Double inversion.
TechKaowledge
Pubiati0ns
 Logic

3-22 A
DSD (Sem. lI /E&Tc / MU)

:.Y = X.Z ...De Morgan's theorem

Y=(À +B)
= (AB )"(AB) =AOB
A+ B

But AB = (A + B) and AB = (A + B) EX-NOR

using only NOR gates
3.12.4():
...De Morgan's theorem
(B-516) Flg.
3.12.5 Solved Examples:
.. Y = (A+ B) (A + B)
expression =AB
sketch realize the
Morgan's theorem With
..Y = (A + B) + (A + B)...De Ex, 3.12.1: CD by :
NANDgates only
Take double inversion of RHS we get, 1 NORgatesonly.
2
Y = (A +B) + (A+ B)
Soln. :
gates only.
This is the required expression. Fig.
3.12.4(e) shows
1 Using NAND ..Giv
AB + CD
gates. Y =
the realization of EX-OR gate using only NOR and CD N
AB = M
A A+B Let
Y= (A+ B) +(Ã + B) M+ N
Y =
=À B sides
inversion of both the
Take double
N=M.N
B .. Y = M+
second a
gates ..As per De-Morgan's
(B-515) Fig. 3.12.4(e):EX-OR using only NOR
AB
6. EX-NOR using only NOR gates :
Boolean expression for an EX-NOR gate is,
B Y= (AB) (CD)
Y = AB + AB = X+Z
C
Take double inversion of RHS to get,
D

(C-186) Fig. P. 3.12.1(a)

Y = AB + AB
expression
Substitute the value of M and N this
= (A B) · (AB) ..De Morgan's theorem shown in Fig. P. 3.12.1(a).
2. Using NOR gates only Y = AB + CD
.:.Y = (A + B) · (A + B)
Take double inversion .. Y= AB + CD = M+
...Using De Morgan's theorem
.:. Y = M.N=(AB)-CD)
.. Y = (A + B) + (A + B) Now let us use the De-Morgan's first laW ie.
...Using De Morgan's theorem A-B = A + B

Take double inversion of RHS to get,

AB = A+ Band CD -+ õ
Y = (A + B) + (A + B) Y= ( + B) (C+ D)
This is the required expression. Fig. 3.12.4() shows Now let A+B = Pand +D =0
the realization of EX-NOR gate using only NOR
gates.
Tech Knowled
 DSD(Sem. III,
I/E&Tc / MU)
3-23 Logic Gates and Boolean Algebra
-Morgan's first
Use De- law again to write expression, implement it
Ex. 3.12.3 : Reduce the following
Y = P +õ implement it
using basic logic gates and then
using only NAND gates.
Y=( B) + (+ D) Y=( AB + A+B)A B
Take double inversion of RHS to write Soln. :
bracket we
Using De-Morgan's theorems inside the
Y = A + B+ + get,
..Ans.
The logic diagram for this expression is
Fig. P. 3.12.1(b). shown in Y = (A + B +A .B)AB
A
= A AB + BAB + A ABB = 0+ AB +0
A+B
..since A A=0and B B = 0 and B -B = B

.:. Y = AB ...Ans.

This equation is realized as shown in Fig. P. 3.12.3(a).

Now replace the inverter and the AND gate by their
G+D NAND equivalent to get the circuit shown in
Fig. P. 3.12.3(b).
A
(C-187) Fig. P. 3.12.1(b)
Y= AB
Ex. 3.12.2: Realize the following expression using only

NOR gates : Y= (ABC + BC) c.

Soln. :
The given equation is, (a) Realization using the basic gates

Y = (ABC + BC)C AB

.:.Y = ABCC +BCC

= ABC + 0 ...since CC = 0 and C. C=C (b) Realization using the NAND gates
(C-192) Fig. P. 3.12.3
..Y = ABC = ABC Realize expression using minimum NAND
Ex.3.12.4:
gates only :
Using De-Morgan's first theorem we get,
y= AB +AC +C +AD+AB C+ABC
May 10, 4 Marks
Y = A + B+ C
Soln. :
This expression can be realized using NOR gates as y = AB + AC +C+ AD + AB C+ ABC
shown in Fig. P. 3.12.2.
A - AB(1 + ) + A +C(1 +AB) + AD
A
= AB + AC+ C + AD
B -Ã+ B+G
Y=A | 1 + C=1 and 1 + AB = 1]

=AB +C+ A+AD A+AB = A + B]

C
= A(B + D + 1) +C
(C-189) Fig. P. 3.12.2
TechKnowledge
PubIIcatiDns
 LUy

Specifyits symbol
DSD (Sem. IlI /E&Tc / MU) 3-24
Explainthe
OR gate. and wr
Q. 4 truthtable.
..y = A+C |: 1+ B+ D = 1] Specify its
Explainthe
EX-OR gate. symb0
Realization using NAND gates only : Q. 5 truth table.
writeits
y = A+C NANDgate. Specify its symbol and
Explain the
Q. 6 its truth table.
y = A. Specify its symbol
NOR gate. and
A Explainthe
Q:7 its truth table.
universalgates

D 0.8

Q. 9
Explainand

Name the
mention the

universal and
derivedgates
NOR gates called
(C-2993) Fig. P. 3.12.4 Why are NAND and unive
Q. 10
Ex, 3.12.5: gates ?
Implement Y=A +BC using nly NOR gates. table of
following:
May 16, 5 Marks Q. 11 Write the truth gate
Three input EX-OR
Soln. : 1 gate.
Three input EX-NOR
Step 1: Implementation using NOR gates : 2
State AND laws.
Taking double inversion of R.H.S. Q. 12
State OR laws.
Q. 13
A + BC theorems.
Y =
Q. 14 State De Morgan's
AND-OR-NOTlogic?
Q. 15 What is
= BC .(De-Morgan's theorem) Define truth table.
Q. 16
Boolean expressions for the followinn.
Q. 17 Write the
= + BC =Ã+ B + =Ã+B+C 1 OR gate
2. EX-NOR gate
two input EXNn
Implementation using NOR gates is as shown in Q. 18 Explain with circuit diagrams a
Fig. P. 3.12.5.
gate using only NOR gates.
gates using NAN
Q. 19 Draw the equivalent circuit of all
gate.
Q. 20 Draw the equivalent circuit of all gates using NO
gate.
Y= Q. 21 Define 'truth table'. What is a logic gate ? Class
the logic gates.
Q. 22 State the rules of Boolean algebra.
(C-s497) Fig. P. 3.12.5: Implementation using NOR gates
Q. 23 State and explain the commutative law.
Review Questions Q. 24 State and explain the associative law.

Q. 25 State and explain the distributive law.

Q. 1 Explain with circuit diagrams a two input EX-NOR
gate using only NAND gates. Q. 26 Write a note on: Duality theorem.
Q. 2 Write the applications of EX-OR gate. Q. 27 State and prove De-Morgan's first and secon
theorem.
Q. 3 Explain the AND gate. Specify its symbol and write
its truth table. Q. 28 Explain the rules of Boolean algebra.

R TechKnowledgi