NUMBER SYSTEM &

BOOLEAN ALGEBRA

Presented by
S Mohanty
 Number System
 Why Number System is required?
 What are the basic types of Number System?
- Non-Positional
- Positional
 What are the types of Positional Number system?
- Decimal
- Binary
- Octal
- Hexadecimal
Non-Positional

 Additive approach.
 Symbols are used which represents same
value regardless their position in the number
and they are added to find out the value of a
number.
Positional

 Digits are used to represent different values,

depending upon the position they occupy in
the number.
 The value of each digit can be determined as:
- the digit itself
- the position of the digit in the no.
- the base/radix of the no. system.
Decimal Number System

 Base=10
 At most 10 digits can be used to represent
any decimal no. i.e. 0 to 9.
 Each position of digit in a decimal no.
represents a power of the base (10).
Binary Number System

 Base=2
 At most 2 digits can be used to represent any
binary no. i.e. 0 or 1.
 Each position of digit in a binary no.
represents a power of the base (2).
Octal Number System

 Base=8
 At most 8 digits can be used to represent any
octal no. i.e. 0 to 7.
 Each position of digit in a octal no. represents
a power of the base (8).
 3 bits are used to represent any octal no. in
the computer memory.
Hexadecimal Number System

 Base=16
 At most 16 digits can be used to represent
any hexadecimal no. i.e. 0 to 9 of the decimal
no. and the remaining six digits are denoted
by the letters A, B, C, D, E, F.
 Each position of digit in a hexadecimal no.
represents a power of the base (16).
 4 bits are used to represent any hexadecimal
no. in the computer memory.
Conversion from one number system to
another
 Any base no. to decimal no.
 Decimal no. to any base no. (Division-
Remainder Method)
 Base other than decimal no. to base other
than decimal no.
 Binary to Octal & Vice-versa
 Binary to Hexadecimal & Vice-versa
Binary Arithmetic

 Addition
1. 0+0=0
2. 0+1=1
3. 1+0=1
4. 1+1=0 with a carry 1 to the next higher
column.
Exercise

101 10011 100111

+ 10 +1001 +11011
Subtraction

1. 0-0=0
2. 1-1=0
3. 1-0=1
4. 0-1=1 with a borrow 1 from the next higher
column.
Exercise

10101 1011100
- 01110 - 0111000
Additive Method of Subtraction
(Complementary Subtraction)
 Complement of a no.=
[ (Base)n – 1] – Given no.

where, n-> no. of digits present in a given

no.
Exercise

 Find the complement of following nos.

1. (37)10
2. (6)8
3. (10101)2
Steps in Complementary Subtraction

 Find the complement of subtrahend.

 Add the complement to minuend.
 If there is a carry of 1, then add it to the
obtained result or if there is no carry, re-
complement the sum add a –ve sign to the
result.
Exercise:

 (92)10 – (56)10
 (18)10 – (35)10
 (1011100)2 – (0111000)2
 (010010)2 – (100011)2
 (10101)2 – (01110)2
Multiplication

 0x0=0
 1x0=0
 0x1=0
 1x1=1
Exercise

1010-> Multiplicand 1111

X 1001-> Multiplier x 111
Division

 0/1=0
 1/1=1
Exercise

 100001 / 110= 0101 with remainder 11

Additive Method of Division
(Complementary Subtraction Method)
 Divisor subtracted from Dividend until the
result of subtraction becomes <= 0.
 Total no. of subtractions were performed
gives the value of Quotient.
 If the result of subtraction becomes < 0, then
the last subtraction is ignored and the result
of previous subtraction is taken as the value
of remainder and the last subtraction
operation is not counted for getting the value
of Quotient.
Exercise

 35/5
 33/6
 Boolean Algebra

 Deals with Binary no. system.

 Useful in designing logic circuits which are
used by the processors of computer system
to perform arithmetic operations.
 Developed by English Mathematician
Gorge Boole during mid of 18th century.
Fundamental Concepts of Boolean
Algebra
 Use of Binary digits
 Logical Addition operation
 Logical Multiplication
 Complementation
 Operator Precedence
Operator Precedence
 The Algebraic Exp. should be scanned from
Left to Right.
 Expressions enclosed within parentheses are
evaluated first.
 All complement operations are performed
next.
 All ‘AND’ or ‘.’ operations are performed next.
 All ‘OR’ or ‘+’ operations are performed in the
last.
Examples of Operator Precedence

 A+B.C= (A+B). C
= A+(B.C)
If A=1, B=0, C=0 then first exp produces 0
and second exp produces 1.
Justify which exp is correct.
Postulates of Boolean Algebra
 A=0 iff A!=1
 A=1 iff A!=0
 A+0=A
 A.1=A
 A+B=B+A (Commutative Law over Addition)
 A.B=B.A (Commutative Law over Multiplication)
 A+(B+C)= (A+B)+C (Associative Law over Addition)
 A.(B.C)=(A.B).C (Associative Law over Multiplication)
 A.(B+C)=(A.B)+(A.C) (Distributive Law over Multiplication)
 A+(B.C)=(A+B).(A+C) (Distributive Law over Addition)
 A+A’=1
 A.A’=0
Principle of Duality

 Any theorem in Boolean Algebra has its dual

results by interchanging ‘+’ with ‘.’ and ‘0’ with
‘1’.
 1+1=1 0.0=0
 1+0=0+1=1 0.1=1.0=0
 0+0=0 1.1=1
Theorems of Boolean Algebra
1. Idempotent Law
(a) A+A=A
(b) A.A=A

2. (a) A+1=1
(b) A.0=0

3. Absorption Law
(a) A+A.B=A
(b) A.(A+B)=A

4. Involution Law
(A’)’=A

5. (a) A.(A’+B)=A.B
(b) A+A’.B=A+B

6. De Morgan’s Law
(a) (A+B)’=A’.B’
(b) (A.B)’= A’+B’
Basic Boolean Identities

Sr. No Identities Dual Identities

1 A+0=A A.1=A
2 A+1=1 A.0=0
3 A+A=A A.A=A
4 A+A’=1 A.A’=0
5 (A’)’=A -
6 A+B=B+A A.B=B.A
7 (A+B)+C=A+(B+C)(A.B).C=A.(B.C)
8 A.(B+C)=A.B+A.C A+(B.C)=(A+B).(A+C)
9 A+(A.B)=A A.(A+B)=A
10 A+(A’.B)=A+B A.(A’+B)=A.B
11 (A+B)’=A’.B’ (A.B)’=A’+B”
Boolean Functions

 A Boolean Function is an expression which is

formed with binary variables, two binary
operators i.e. OR and AND, a unary operator
i.e. NOT, parentheses and equal sign.
 Example: W=X+(Y’.Z)
Examples

1. x+x’.y
2. x.(x’+y)
3. x’.y’.z+x’.y.z+x.y’
4. x.y+x’.z+y.z
5. (x+y).(x’+z).(y+z)
Complement of a Function

 The complement of Boolean Function is

obtained by interchanging 0s and 1s in the
truth table.
 Algebraically, the complement of a function
can be derived by De Morgan’s Theorem
which means by interchanging the OR and
the AND operators and complementing each
term/ literal.
Example:

 F= x’.y.z’+x’.y’.z
 F1= x.(y’.z’+y.z)
Canonical Forms for Boolean
Algebra
 Minterms(mj)- AND terms
 Maxterms(Mj)- OR terms
 Sum-of Products (SOP):
(a) Construct the TT for the given Boolean Function.
(b) Form a minterm for each combination of the
variables which produces 1 in the function.
(c) The desired exp. is sum (OR) of all the minterms
obtained in step-2.
Contd…

 Product-of Sums (POS):

(a) Construct the TT for the given Boolean
Function.
(b) Form a maxterm for each combination of
the variables which produces 0 in the
function.
(c) The desired exp. is product (AND) of all
the maxterms obtained in step-2.
Exercise:

1. Express the Boolean Function into SOP:

F= A+B’.C
2. Express the Boolean Function into POS:
f=x.y + x’.z
Logic Gates

 All operations within a computer system

carried out by means of combination of
signals passing through built-in circuits,
known as Logic Gate.
 Logic Gates are electronic ccts, operate on
one or more inputs and produce standard
outputs.
 Logic Gates are building blocks of all the
circuits in a computer.
AND Gate
 Logical Multiplication operation.
 Generates an o/p 1, iff all inputs are 1.
 Truth Table:
A B C=A.B
0 0 0
1 1 0
1 0 0
1 1 1
 Logic Diagram:
OR Gate
 Logical Addition operation.
 Generates an o/p 1, iff any input is 1.
 Truth Table:
A B C=A+B
0 0 0
1 1 1
1 0 1
1 1 1
 Logic Diagram:
NOT Gate

 Complementation operation (Unary operation).

 Generates an o/p which is the reverse of the
input.
 Truth Table:
A A’
0 1
1 0
Logic Diagram:
NAND Gate
 Complemented AND Gate.
 Generates an o/p 1, iff all and any one input is 0 and
generates an o/p 0, iff all inputs are 1.
 Truth Table:
A B C=(A.B)’=A’+B’
0 0 1
1 1 1
1 0 1
1 1 0
 Logic Diagram:
NOR Gate
 Complemented OR Gate.
 Generates an o/p 1, iff all inputs are 0 and
generates an o/p 0, iff any input is 1.
 Truth Table:
A B C=(A+B)’=A’.B’
0 0 1
1 1 0
1 0 0
1 1 0
 Logic Diagram:
Exclusive-OR Gate
 Denoted by
 Generates an o/p 1, iff both inputs are different and
generates an o/p 0, iff both inputs are same.
 Truth Table:
A B C=(A B)=A’.B+A.B’
0 0 0
1 1 1
1 0 1
1 1 0
 Logic Diagram:
Exclusive-NOR Gate
 Denoted by ‫סּ‬
 Generates an o/p 1, iff both inputs are same and
generates an o/p 0, iff both inputs are different.
 Truth Table:
A B C=(A ‫ סּ‬B)=(A B)’=(A’.B+A.B’)’=A.B+ A’.B’
0 0 1
1 1 0
1 0 0
1 1 1
 Logic Diagram:
NAND as Universal Gate

 The following logical operations can be

performed with the implementation of NAND
Gates:
 NOT Gate
 AND Gate
 OR Gate
 Ex-OR Gate
 Ex-NOR Gate
NOR as Universal Gate

 The following logical operations can be

performed with the implementation of NOR
Gates:
 NOT Gate
 AND Gate
 OR Gate
 Ex-OR Gate
 Ex-NOR Gate
Assignment-2
Exercise:
 Draw the logic circuit of EX-OR operation by
using NOT, AND, OR gates.
 Draw the logic circuit NOT, AND, OR, EX-
OR, EX-NOR operations by using NAND
gates only.
 Draw the logic circuit NOT, AND, OR, EX-
OR, EX-NOR operations by using NOR gates
only.
Assignments
 Write the procedures/steps to convert any
base no. system to decimal no. system along
with examples.
 Write the procedures/steps to convert any
decimal no. system to any base no. system
along with examples.
 Write the procedures/steps to convert any
base other than decimal no. system to any
base other than decimal no. system along
with examples.
Contd…

 Prove all the enlisted theorems of Boolean

Algebra in the previous slide by using
Boolean Postulates or Perfect Induction
Method.
 Prepare a presentation upon this topic for my
next class. Note that each presentation topic
should be different among syndicates.