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
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 Ā
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) TAUTOLOGY: If the result of a logical statement or expression is always true
or ‘1’. it is known as Tautology.
b) FALLACY: If the result of a logical statement or expression is always False or
‘0’. it is known as Fallacy.
LOGIC GATES:
A logic gate performs a logical operation on one or more logic Inputs and
produces a single logic output.
(i) Basic or Fundamental gates- There are some basic gates which are not
constructed from others gates. These are-
a) AND gate-
b) OR gate –
c) NOT gate( Inverter) –
(ii) Derived gates - These gates are obtained by combining two or more basic
gates.
a) NAND gate (compliment of AND gate])-
Truth Table: the output of an NAND gate is FALSE (i.e. 0) only when both the
inputs are TRUE, and in all other cases it is always TRUE.
b) NOR gate (compliment of OR gate) - It is obtained by complimenting the
output of OR gate.
c) XOR gate: It is a special case in OR gate. It is obtained as
Truth table- he output of an XOR gate is FALSE (i.e. 0) when both the inputs
are SAME, and in all other cases it is always TRUE.
d) X-NOR gate: It is obtained by complementing the output of XOR gate.
DeMorgan's Theorem
It states that the complement of a sum / product, equals the product / sum of the
complements.
EXAMPLES......
Draw the logic circuit diagram for the given Boolean expression:
(x+z)(y'+z)(x'+y+z)
Solution:
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)
