Boolean Algebra

( Notes by B Sampath Kumar, Devanga HSS, Cbe – 2 )

Instructions
 Read the book fully and thoroughly. This is simply notes for understanding
purpose.

 Students are to write down these notes once with pictures ( refer book )
wherever necessary in the assignment note book ( A new one quire long
sized un-ruled note ) using blue or black, ink or gel pen only.

 The answers in bold and in italics are important points, which will fetch you
marks.

 They should submit the note when school opens and assignment mark will be
given for their +1 exams, only if they have completed the assignment note in
all aspects without any omissions whatsoever. Failing to which they will not
be awarded internal marks for all +1 exams including the PUBLIC EXAMS.

 The same is applicable to all the notes and PPTs which are sent by me.
--------------------------------- * -----------------------------------
Boolean algebra :
Boolean algebra is a mathematical discipline that is used for designing digital circuits
in a digital computer. It describes the relation between inputs and outputs of a digital
circuit.

Binary valued quantities:

Every day we have to make logical decisions:

1. Should I carry Computer Science book every day? Yes / No

2. 8-10 = 10 is this answer correct? Yes / No
3. Chennai is capital of India? Yes / No
4. What did I say yesterday? Can’t answer as Yes or No

Thus, sentences which can be determined to be True or False are called “Logical
Statement” or “Truth Functions”. The results True or False are called “Truth
Values”. The truth values depicted by logical constant 1 and 0; 1 means True and 0
means False. The variable which can store these truth values are called “Logical

BSK Page 1
 Boolean Algebra
variable” or “Binary valued variables” or “Boolean Variables” as these can store
one of the two values of True or False.

1 means True
0 means False

Truth Table:
A truth table represents all the possible values of logical variable or statements along
with all the possible results of given combination of truth values.
Logical Operations:
Boolean algebra makes use of variables and operations (functions). The basic logical
operations are AND ( . ) OR ( + ) and NOT, which are symbolically represented by
over bar / single apostrophe respectively. These symbols are also called as “Logical
Operators”.
AND operator
The AND operator is defined in Boolean algebra by the use of the dot (.) operator. It is
similar to multiplication in ordinary algebra. The AND operator combines two or more
input variables so that the output is true only if all the inputs are true. The truth table
for a 2-input AND operator is shown as follows

The above 2-input AND operation is expressed as: Y = A .B

OR operator
The plus sign is used to indicate the OR operator. The OR operator combines two or
more input variables so that the output is true if at least one input is true. The truth
table for a 2-input OR operator is shown as follows

The above 2-input OR operation is expressed as: Y = A + B

BSK Page 2
 Boolean Algebra
NOT operator
The NOT operator has one input and one output. The input is either true or false,
and the output is always the opposite, that is, the NOT operator inverts the input. The
truth table for a NOT operator where A is the input variable and Y is the output is shown
below:

NAND operator
The NAND is the combination of NOT and AND. The NAND is generated by
inverting the output of an AND operator. The algebraic expression of the NAND
function is:

NOR operator
The NOR is the combination of NOT and OR. The NOR is generated by inverting the output
of an OR operator. The algebraic expression of the NOR function is:

BSK Page 3
 Boolean Algebra

Bubbled AND Gate

This is equivalent to NOR Gate

Bubbled OR Gate

BSK Page 4
 Boolean Algebra

XOR Gate : exclusive - OR operator or "encircled plus".

The XOR (exclusive - OR) gate acts in the same way as the logical "either/or." The
output is "true" if either, but not both, of the inputs are "true". The output is "false"
if both inputs are "false" or if both inputs are "true." Another way of looking at this
circuit is to observe that the output is 1 if the inputs are different, but 0 if the inputs
are the same.

XNOR Gate
The XNOR (exclusive - NOR) gate is a combination XOR gate followed by an
inverter. Its output is "true" if the inputs are the same, and "false" if the inputs
are different. In simple words, the output is 1 if the input are the same,
otherwise the output is 0. The logic circuit of XNOR gate is

"included dot" ( see diagram below ) stands for the XNOR.

BSK Page 5
 Boolean Algebra

BSK Page 6
 Boolean Algebra

And, Or , Not are fundamental logic gates.

Nand and Nor are called Universal Logic Gates. ( Beacause the fundamental gate
results can be obtained from these )

~~~~~ * ~~~~~
For +2, +1 Computer science , Computer Applications notes, PPTS and

10th, +1,+2 General English ppts and Apps

Contact :

BSK Page 7