Scribd
Upload
17 views19 pages

Digital Computer Unit I Part3 (2022)

The document describes Boolean algebra and switching algebra. Boolean algebra defines a set K with elements a and b, and binary operators + and ., with properties such as commutativity and distributivity. Switching algebra is a special case where K contains only 0 and 1, with + representing OR and . representing AND. It defines canonical forms such as SOP (sum of products) and POS (product of sums) to represent Boolean functions, and methods to convert between forms.

Uploaded by

suhelkhan900500
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views19 pages

Digital Computer Unit I Part3 (2022)

The document describes Boolean algebra and switching algebra. Boolean algebra defines a set K with elements a and b, and binary operators + and ., with properties such as commutativity and distributivity. Switching algebra is a special case where K contains only 0 and 1, with + representing OR and . representing AND. It defines canonical forms such as SOP (sum of products) and POS (product of sums) to represent Boolean functions, and methods to convert between forms.

Uploaded by

suhelkhan900500
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

Boolean Algebra

K be the set of elements defined for algebra. Let


a,b є K.
Postulate1:
a) An operator ’+’ is defined such that if c=a+b
then c є K for every pair of a, b є K.
b) An operator ‘.’ is defined such that if d= a.b then
d є K for every pair of a, b є K.
Boolean Algebra
Postulate2:
a) There exists an element 0 in K such that a+0=a
for each a є K.
b) There exists an element 1 in K such that a.1=a
for each a є K.
Boolean Algebra
Postulate 3: For a, b є K following commutative law
exists.
a) a + b = b + a
b) a . b = b . a
Postulate 4: For a, b, c є K following distributive law
holds.
a) a . ( b + c) = a . b + a. c
b) a + (b . c ) = (a + b) . (a + c)
Boolean Algebra
Postulate 5: For every element a є K, there
exists an element a’ s.t.
a) a + a’ = 1
b) a . a’ = 0
Postulate 6: There are atleast two elements
a, b є K s.t. a ≠ b.
Switching Algebra
In computers we are interested in special kind of algebra
called Switching Algebra in which set K contains only
two elements i.e. 0 and 1. The two binary operators are
‘+’ known as OR operator.
‘.’ known as AND operator.
And the unary operator is known as NOT operator.
Switching Algebra
Definition 1: The set K has two elements 0, 1.
Definition 2: The rules of two binary operations ‘.’ and ‘+’
are given below-
a b a.b a b a+b
0 0 0 0 0 0
0 1 0 0 1 1
1 0 0 1 0 1
1 1 1 1 1 1
Switching Algebra
Definition 3: The complement operation is defined as
0’ = 1 and 1’ = 0
The first five postulates are listed in two parts (a), (b).
One part may be obtained from the other if ‘+’ is
interchanged with ‘.’ and 0 is interchanged with 1.
This important property of Boolean Algebra is known
as the duality principle.
Switching Algebra
Theorems:
1(a) a + a = a Idempotent Law
1(b) a . a = a (Dual theorem)
2(a) a + 1 = 1 Annulment Law
2(b) a . 0 = 0 (Dual theorem)
3(a) a + (a . b) = a Absorption Law
3(b) a . (a + b) = a (Dual theorem)
Switching Algebra
4: a’’ = a Double Negation Law
5(a): a + (a’.b) = a + b Redundancy Law
5(b): a . (a’ + b) = a . b (Dual Theorem)
6(a): (a + b)’ = a’ . b’ DeMorgan’s Law
6(b) (a . b)’ = a’ + b’ (Dual Theorem)
7(a) a + (b + c) = (a + b) +c Associative Law
7(b) a . (b . c) = (a . b) . c (Dual Theorem)
Switching Algebra
Precedence of Operators:
The operator precedence for evaluating the boolean expression is:
1)Scan the expression from left to right
2)First evaluate expressions enclosed in parentheses.
3)Perform all the complement(NOT) operations.
4)Perform all ‘.’ (AND)operations in the order in which they appear.
5)Perform all ‘+’ (OR)operations.
Problem:
x.x’ + y.(x+z)’ + (x.z)
Switching Algebra
Boolean function and Truth Table:
Let z = a’ + b . c a b c a’ b.c z = a’ + b . c
0 0 0 1 0 1
Here a, b, c are 0 0 1 1 0 1
boolean variables 0 1 0 1 0 1
and z is dependent 0 1 1 1 1 1
on them i.e. 1 0 0 0 0 0
z = f(a, b, c) 1 0 1 0 0 0
1 1 0 0 0 0
1 1 1 0 1 1
Switching Algebra
Canonical forms for Boolean Functions:
1) SOP Sum of the product form of the eq.
z = a . b + b . c’ + a’. c’
2) POS Product of the sum form of the eq.
z = (a + b’) . (b’+ c) . (a’+c’)
Switching Algebra
Canonical SOP – f(a, b, c) =a . b’ . c + a’. b . c
Canonical POS- f(a, b) = (a + b’) . (a’ + b)
Canonical SOP- It is represented as Minterm notation
Decimal form a, b, c Minterm Notation
0 000 a’.b’.c’
1 001 a’.b’.c
2 010 a’.b .c’
3 011 a’.b. c
4 100 a. b’.c’
5 101 a.b’.c
6 110 a .b .c’
7 111 a .b .c
Switching Algebra
1) f(a,b,c) = a’.b’.c’ + a’.b.c + a.b’.c

= Σ(0, 3, 5)

The symbol Σ indicates that the OR of minterms are to be taken.

2) f(a, b, c) = a’.b’.c + a’.b.c +a.b’.c +a .b .c

= Σ(1, 3, 5, 7)
Switching Algebra
Canonical POS- It is represented as Maxterm notation
Decimal form a, b, c Maxterm Notation
0 000 a+b+c
1 001 a + b + c’
2 010 a + b’ + c
3 011 a + b’ + c’
4 100 a’ + b + c
5 101 a’ + b + c’
6 110 a’ + b’ + c
7 111 a’ + b’ + c’
Switching Algebra
1) f(a, b, c) = (a + b + c) . (a + b’+ c’) . (a’+ b + c’)
= π(0, 3, 5)
The symbol π indicates that the AND of maxterms are
to be taken

2) f(a, b, c) = (a + b + c’) . (a’+ b + c’) . (a’+ b’+ c)


= π(1, 5, 6)
Switching Algebra
Conversion of SOP and POS form of equations-
1) z = a . b’+ b . c [SOP form]
z’ = (a’+b) . (b’+ c’)
= a’.b’+ a’.c’+ b . b’+ b . c’
= a’.b’+ a’.c’+ b . c’ [Since b . b’ = 0]
(z’)’ = (a + b) . (a + c) . (b’+ c)
z = (a + b) . (a + c) . (b’+ c) [POS form]
Switching Algebra
2) Let z = (a + b’).(a’+c) [POS form]
= a . a’ + b’. a’+ a . c + b’. c
= a . c + b’. a’+ b’. c [SOP form]
Switching Algebra
Conversion of Canonical SOP and POS-
To convert SOP form to POS form change Σ to π and
missing numbers.
Z = f(a, b, c) = Σ(0, 2, 6) [SOP form]
= a’.b’.c’+ a’.b .c’+ a .b .c’
Z’ = Σ(1, 3, 4, 5, 7) = a’.b’.c + a’.b.c + a.b’.c’ + a.b’.c + a.b.c
Z = Z’’ = (a+b+c’) . (a+b’+c’) . (a’+b+c) . (a’+b+c’) . (a’+b’+c’)
Z = f(a, b, c) = π(1, 3, 4, 5, 7) [POS form]

You might also like