CH.

3 BOOLEAN LOGIC

CONTENT – REVIEW
Boolean logic: NOT, AND, OR, NAND, NOR, XOR, truth table, De Morgan’s laws and l
Circuits

● Number system: Binary, Octal, Decimal and Hexadecimal number system; conversion between
number systems.

● Encoding schemes: ASCII, ISCII and UNICODE (UTF8, UTF32)

BOOLEAN LOGIC

● Boolean logic refers to Boolean Algebra which values of variables are the truth values True or
False. These values have two states either on or off denoted by 0 or 1.
● George Boole invented the first way of manipulating symbolic logic, which later became known
as Boolean Algebra. Because of its vast applications in switching theory, developing basic
electronic circuits, and designing digital computers, Boolean algebra has become a vital tool in
computer science.
1. NOT OPERATION:

It handles only a single variable. The operation performed by NOT is known as

complementation.
A A’

0 1

1 0

2. OR OPERATION:
It is also a binary operator that operates on two variables. The result of the OR operator is
also known as logical addition. The symbol is used for OR is plus (+).
The output is true if either one or two inputs are “true”. IF both false it produce false result.
X Y X+Y
 0 0 0

0 1 1

1 0 1

1 1 1

3. AND OPERATION:
It is a binary operator that operates on two variables and the result of the AND operator is
known as logical multiplication. To denote AND operator dot(.) symbol is used.
AND means that A & B. When both inputs are true then it produce true result, otherwise
false.

X Y X.Y

0 0 0

0 1 0

1 0 0

1 1 1

4. NAND OPERATION:
It stands for NOT AND that produce reverse result of AND gate.
 X Y (X.Y)’

0 0 1

0 1 1

1 0 1

1 1 0

5. NOR OPERATION:
It stands for NOT OR. It produces reverse output than the OR gate.

X Y (X+Y)’

0 0 1

0 1 0

1 0 0

1 1 0

6. XOR OPERATION:
It produces high output if the input of 1s is odd, otherwise false.
 X Y X Y

0 0 0

0 1 1

1 0 1

1 1 0

7. EX-NOR OPERATION:

X Y (X Y)’

0 0 1

0 1 0

1 0 0

1 1 1

ic Laws

De Morgan's Law:
First De Morgan's Law states that when two or more input variables (A, B) are OR’ed and then
negated, the result is equal to the AND of the complements of the individual input variables.
(A+B)’ = A’ . B’

To prove this theorem we can use the truth table as given below:
A B A+B (A+B)’ A’ B’ A’.B’

0 0 0 1 1 1 1

0 1 1 0 1 0 0

1 0 1 0 0 1 0

1 1 1 0 0 0 0

Second De Morgan's Law states that when two or more input variables are AND'ed and negated,
then the obtained result will be equal to the OR of the complements of the individual variables.
(A.B)’ = A’+B’
Using the truth table, we can prove this as follows:
A B A.B (A.B)’ A’ B’ A’+B’

0 0 0 1 1 1 1
 0 1 0 1 1 0 1

1 0 0 1 0 1 1

1 1 1 0 0 0 0

WORKSHEETS
LEVEL-1

1. The input to the following digital circuit are as

shown below.

Answer the following:

a) Write expression for the output Y.

b) Which logic gates are used in the given digital circuit?

2. State De Morgan’s theorems of Boolean algebra. Give proof for any one theorem.

3. Draw the equivalent logic circuit for the following Boolean Expression:
A.(B+C )̅

4. Name the law shown below and verify it using a truth table:
A+B.C=(A+B).(A+C)

5. Which are the universal gates ? Why are they called universal gates?

6. Name the following law and verify them using a truth table:

a. x + x’ = 1

b. x+y=y+x

c. x + (y + z ) = (x + y ) + z