BOOLEAN ALGEBRA

PART - II
Q.NO. - 1 : Define Logic NAND Function with diagram and Truth Table.
The Logic NAND Function only produces an output when “ANY” of its inputs are not
present and in Boolean Algebra terms the output will be TRUE only when any of its inputs
are FALSE.

Switch Representation of the NAND Function

The truth table for the NAND function is the opposite of that for the previous AND function
because the NAND gate performs the reverse operation of the AND gate. In other words,
the NAND gate is the complement of the basic AND gate.

NAND Function Truth Table

Switch A Switch B Output Description

0 0 1 A and B are both open, lamp ON

0 1 1 A is open and B is closed, lamp ON

1 0 1 A is closed and B is open, lamp ON

1 1 0 A is closed and B is closed, lamp OFF

Boolean Expression (A NAND B) ̅̅̅̅̅

A. B

1
BOOLEAN ALGEBRA

The Logic NAND Function output is only false when all of its inputs are true, otherwise the
output is always true. i.e NAND Function is sometimes known as the Sheffer Stroke
Function and is denoted by a vertical bar or upwards arrow operator, for example,
A NAND B = A|B or A↑B.

Q.NO. - 2: Define Logic NOR Function with diagram and Truth Table.
The Logic NOR Function only produces and output when “ALL” of its inputs are not present
and in Boolean Algebra terms the output will be TRUE only when all of its inputs are FALSE.

Switch Representation of the NOR Function

The truth table for the NOR function is the opposite of that for the previous OR function
because the NOR gate performs the reverse operation of the OR gate. Then we can see
that the NOR gate is the complement of the OR gate.

NOR Function Truth Table

Switch A Switch B Output Description

0 0 1 Both A and B are open, lamp ON

0 1 0 A is open and B is closed, lamp OFF

1 0 0 A is closed and B is open, lamp OFF

2
BOOLEAN ALGEBRA

1 1 0 A is closed and B is closed, lamp OFF

Boolean Expression (A NOR B) ̅̅̅̅̅̅̅̅̅

𝐴 + 𝐵

The Logic NOR Function output is only true when all of its inputs are false, otherwise the
output is always false
The NOR Function is sometimes known as the Pierce Function and is denoted by a
downwards arrow operator as shown, A NOR B = A↓B.

Q.NO. - 3: Define XOR Gate with diagram and Truth Table.

One element conspicuously missing from the set of Boolean operations is that of Exclusive-
OR, often represented as XOR. Whereas the OR function is equivalent to Boolean addition,
the AND function to Boolean multiplication, and the NOT function (inverter) to Boolean
complementation, there is no direct Boolean equivalent for Exclusive-OR. This hasn’t stopped
people from developing a symbol to represent this logic gate, though:

This logic gate symbol is seldom used in Boolean expressions because the identities, laws,
and rules of simplification involving addition, multiplication, and complementation do not apply
to it.
However, there is a way to represent the Exclusive-OR function in terms of OR and AND, as
has been shown in previous chapters:

Q = (A ⊕ B) = A𝐵̅ + 𝐴̅B
The truth table of XOR gate is given below,

3
BOOLEAN ALGEBRA

As a Boolean equivalency, this rule may be helpful in simplifying some Boolean expressions.
Any expression following the AB’ + A’B or A𝐵̅ + 𝐴̅B form (two AND gates and an OR gate)
may be replaced by a single Exclusive-OR gate.

Q.NO. – 4 : Define Logic XNOR Function with diagram and Truth Table.
Basically the “Exclusive-NOR” gate is a combination of the Exclusive-OR gate and the NOT
gate but has a truth table similar to the standard NOR gate in that it has an output that is
normally at logic level “1” and goes “LOW” to logic level “0” when ANY of its inputs are at logic
level “1”.
However, an output “1” is only obtained if BOTH of its inputs are at the same logic level, either
binary “1” or “0”. For example, “00” or “11”. This input combination would then give us the
Boolean expression of:

Q = (̅̅̅̅̅̅̅̅̅̅̅
𝑨 ⊕ 𝑩) = 𝑨 ̅𝑩
̅ + A.B
Then the output of a digital logic Exclusive-NOR gate ONLY goes “HIGH” when its two input
terminals, A and B are at the “SAME” logic level which can be either at a logic level “1” or at a
logic level “0”. In other words, an even number of logic “1’s” on its inputs gives a logic “1” at
the output, otherwise is at logic level “0”.
Then this type of gate gives and output “1” when its inputs are “logically equal” or “equivalent”
to each other, which is why an Exclusive-NOR gate is sometimes called an Equivalence
Gate.

Logic diagram Of XNOR Truth Table Of XNOR

̅𝑩
Giving the Boolean expression of: Q = 𝑨 ̅ + AB

Ex-NOR Gate Equivalent Circuit

4
BOOLEAN ALGEBRA

Q.NO. – 5: Define all the Logic Function and Boolean Notations and their
Truth Table .
The following table gives a list of the common logic functions and their equivalent Boolean
notation.
Logic Function Boolean Notation

AND A.B

OR A+B

NOT 𝐴̅

NAND ̅̅̅̅̅̅
𝐴 .𝐵

NOR ̅̅̅̅̅̅̅̅
𝐴+𝐵

EX-OR (A ⊕ B)

EX-NOR (̅̅̅̅̅̅̅̅̅̅̅
𝑨 ⊕ 𝑩)

Summary of 2-input Logic Gates

The following Truth Table compares the logical functions of the 2-input logic gates above.
Inputs Truth Table Outputs For Each Gate

A B AND NAND OR NOR EX-OR EX-NOR

0 0 0 1 0 1 0 1

0 1 0 1 1 0 1 0

5
BOOLEAN ALGEBRA

1 0 0 1 1 0 1 0

1 1 1 0 1 0 0 1

Q.NO. – 6: Define DeMorgan’s Theorem with diagram and Truth Table .

De Morgan has suggested two theorems which are extremely useful in Boolean
Algebra. The two theorems are discussed below.

Theorem 1
The complement of the sum of two or more variable is equal to the product of the
complement of the variables.

 The LHS of this theorem represents a NOR gate with inputs A and B, whereas the
RHS represents an AND gate with inverted inputs.

 This AND gate is called as Bubbled AND.

6
BOOLEAN ALGEBRA

Table showing verification of the De Morgan's FIRST theorem −

Theorem 2
The complement of the product of two or more variable is equal to the sum of the
complement of the variables.

 The left hand side (LHS) of this theorem represents a NAND gate with inputs A
and B, whereas the right hand side (RHS) of the theorem represents an OR gate
with inverted inputs.

 This OR gate is called as Bubbled OR.

7
BOOLEAN ALGEBRA

Table showing verification of the De Morgan's SECOND theorem −

XXXXXXXXXXXXXXXXXXXXXXXX