Boolean Algebra

What is Boolean algebra

• Boolean Algebra is used to analyze
and simplify the digital (logic)
circuits. It uses only the binary
numbers i.e. 0 and 1. It is also called
as Binary Algebra orlogical Algebra.
Boolean algebra was invented
by George Boole in 1854.
Main Operation of Boolean
Algebra
• Conjunction – “AND” –
A^B/ A.B/ AB/ A and B.
Consider the statement “A
and B”, denoted A^B . To
analyze this, we first have to
think of all the combinations
of truth values for both
statements and then decide
how those combinations
influence the “and” statement.
Disjuction – “OR”(A+B/ A OR B)

Truth table
• Negation –
1. Commutative law - Any binary
operation which satisfies the
following expression is referred to
as commutative operation
• OR operator → A + B = B + A
• AND operator → A * B = B * A
• Commutative law states that
changing the sequence of the
variables does not have any effect
on the output of a logic circuit.
2. Associative law - Associative Law of
multiplication states that the AND
operation are done on two or more
than two variables.
• For example:
A * (B * C) = (A * B) * C or
(A+B)+C = A+(B+C)
3. The Distributive Law says
that multiplying a number by a
group of numbers added together is
the same as doing each
multiplication separately.
• Example:
• 3 × (2 + 4) = 3×2 + 3×4

So the "3" can be "distributed"

across the "2+4" into 3 times 2 and 3
times 4.
4. Inversion Law –

• This law uses the NOT operation.

The inversion law states that
double inversion of a variable
results in the original variable
itself.
5. Absorption law:
A.(A+B) = A
A + AB = A
6. Idempotent law:
A+A=A
A.A = A
7. Identity law:
A.1 = A
A+0=A
 Principal of Duality Theorem

• The duality principle ensures that "if

we exchange every symbol by
its dual in a formula, we get
the dual result".
• AND OR
• OR AND
• 0 1
• 1 0
• Ex. A+B =0 (BEFORE)
• A.B = 1 (AFTER)
 What is truth table

• Truth table is used represent all

possible input and their result
(output).

A B A.B B.A
0 0 0 0
0 1 0 0
1 0 0 0
1 1 1 1
 Logic Gates

• Logic gates are the basic building

blocks of any digital system.
• The logic gates are the main structural
part of a digital system.
• The relationship between the input-
output binary variables for each gate
can be represented in tabular form by
a truth table.
• All logical operations handle by A.L.U
in computer.
• It is an electronic circuit having one or
more than one input and only one
output
 “AND GATE “

• The AND gate is an electronic circuit

which gives a high output only if all
its inputs are high. The AND
operation is represented by a dot (.)
sign.
 “OR GATE”

• The OR gate is an electronic circuit

which gives a high output if one or
more of its inputs are high. The
operation performed by an OR gate
is represented by a plus (+) sign.
 NOT GATE

• The NOT gate is an electronic circuit

which produces an inverted version
of the input at its output. It is also
known as an Inverter.
 NAND GATE
• The NOT-AND (NAND) gate which is
equal to an AND gate followed by a
NOT gate. The NAND gate gives a high
output if any of the inputs are low.

(AB)’
 NOR GATE
• The NOT-OR (NOR) gate which is
equal to an OR gate followed by a
NOT gate. The NOR gate gives a
low output if any of the inputs
are high.
 Exclusive-OR/ XOR GATE:

• The 'Exclusive-OR' gate is a circuit which

will give a high output if one of its inputs
is high but not both of them. The XOR
operation is represented by an encircled
plus sign.
 EXCLUSIVE-
NOR/Equivalence GATE:
• The 'Exclusive-NOR' gate is a circuit that does the inverse operation to
the XOR gate. It will give a low output if one of its inputs is high but not
both of them. The small circle represents inversion.
 Diagram

What is Half Adder

• A Half-adder circuit needs two binary
inputs and two binary outputs. The
input variable shows the augend and
addend bits whereas the output
variable produces the sum and carry.
• 'x' and 'y' are the two inputs, and S
Truth Table
(Sum) and C (Carry) are the two
outputs.
 Full Adder
• This circuit needs three binary
inputs and two binary outputs.
• Two of the input variable 'x' and 'y',
represent the two significant bits to
be added.
• The third input variable 'z',
represents the carry from the
previous lower significant position.
• The outputs are designated by the
symbol 'S' for sum and 'C' for carry.
 What is Flip-Flops
• Flip-flop is a memory element which is
capable of storing one bit of information
and it is used in clocked sequential
circuits.
• A flip-flop has two outputs, one for
normal value and another for
complement value of the bits stored in it.
• A flip-flop circuit can remain in a binary
state indefinitely (as long as power is
delivered to the circuit) until directed by
an input signal to switch states
 S-R flip-flop
• S-R flip-flop stands for SET-RESET flip-
flops.
invalid
• The SET-RESET flip-flop consists of two
NOR gates and also two NAND gates.
• These flip-flops are also called S-R
Latch.
• The design of these flip flops also
includes two inputs, called the SET [S]
and RESET [R]. There are also two
outputs, Q and Q'.
 Clocked S-R Flip-Flop

• The operation of a basic flip-flop can be

modified by providing an additional
control input that determines when the
state of the circuit is to be changed.
• The limitation with a S-R flip-flop using
NOR and NAND gate is the invalid state.
• A clock pulse is given to the inputs of
the AND Gate. If the value of the clock
pulse is '0', the outputs of both the
AND Gates remain '0'.
 MCQ Based …..

Q1. In boolean algebra, the OR

operation is performed by which
properties?
a) Associative properties
b) Commutative properties
c) Distributive properties
d) All of the Mentioned..
Q2. The expression for Absorption law is
given by
a) A+AB = A..
b) A+AB = B
c) AB+AA’ = A
d) None of the Mentioned
Q3. 5. A(A + B) = ?
a) AB
b) 1
c) (1 + AB)
d) A..
Explanation:
A(A + B) = AA + AB = A + AB = A(1 + B)
= A*1 = A.
• Q4. DeMorgan’s theorem states that
a) (AB)’ = A’ + B’..
b) (A + B)’ = A’ * B
c) A’ + B’ = A’B’
d) None of the Mentioned
• Explanation: The DeMorgan’s law
states that (AB)’ = A’ + B’ & (A + B)’ =
A’ * B’.
Q5. The boolean function A + BC is a
reduced form of
a) AB + BC
b) (A + B)(A + C)..
c) A’B + AB’C
d) (A + C)B
Q6. Boolean algebra is also called
a. switching algebra,
b. arithmetic algebra
c. linear algebra
d. algebra
Q7. According to boolean algebra
absorption law, which of
following is correct?
a. x+xy=x
b. (x+y)=xy
c. xy+y=x,,
d. x+y=y
e. None of these
Q8. A Boolean function may be
transformed into
a. logical diagram,.
b. logical graph
c. Map
d. Matrix
e. None of these
Q9. Boolean algebra is defined as a
set of
a. three values
b. two values.
c. four values
d. five values
e. None of these
Q10. Complement of function
(A+B+C)' using theorem and laws
is
A. (A')+B+C
B. (A+B)'+C
C. A+B+C
D. A'B'C‘..
E. None of these
Q11. In Boolean algebra 0 is a
a. commutative property
b. Additive identity,,
c. associative identity
d. identity element
e. None of these
Q12. Symbol representing AND operation
a. (+)
b. (.)
c. (-)
d. (/)
e. None of these
Q13. Boolean algebra is an algebraic structure with two arithmetic operations
f. addition and subtraction
g. subtraction and multiplication
h. addition and multiplication
i. addition and division
Q14. X*(y.z)=(x*y).(x*z) is the
a. commutative property
b. distributive property..
c. associative property
d. identity element
e. None of these
Q15. A universal logic gate is one which
can be used to generate any logic
function. Which of the following is a
universal logic gate?
a) OR
b) AND
c) XOR
d) NAND..
Q16. Which of following are known as
universal gates?
a) NAND & NOR,,
b) AND & OR
c) XOR & OR
d) None of the Mentioned
Q17. A single transistor can be used to build
which of the following digital logic gates?
a) AND gates
b) OR gates
c) NOT gates..
d) NAND gates
Q18. Exclusive-OR (XOR) logic gates can
be constructed from what other
logic gates?
a) OR gates only
b) AND gates and NOT gates
c) AND gates, OR gates, and NOT
gates..
d) OR gates and NOT gates
Q19. The basic logic gate whose
output is the complement of the
input is the:
a) OR gate
b) AND gate
c) INVERTER gate
d) Comparator
Q20. The AND function can be used to
___________ and the OR function
can be used to _____________
a) Enable, disable,,
b) Disable, enable
c) Synchronize, energize
d) Detect, invert
 Diagram

What is Half Adder

• A Half-adder circuit needs two binary
inputs and two binary outputs. The
input variable shows the augend and
addend bits whereas the output
variable produces the sum and carry.
• 'x' and 'y' are the two inputs, and S
Truth Table
(Sum) and C (Carry) are the two
outputs.
 Full Adder
• This circuit needs three binary
inputs and two binary outputs.
• Two of the input variable 'x' and 'y',
represent the two significant bits
to be added.
• The third input variable 'z',
represents the carry from the
previous lower significant position.
• The outputs are designated by the
symbol 'S' for sum and 'C' for carry.