DEPARTMENT OF COMPUTER SCIENCE &
INFORMATION TECHNOLOGY
Logic Design & Switching Theory
Course Code: CS-251
Semester: Spring 2020
Teacher Name: Talha Akhtar
Course Contents
Introduction of Subject
1. Digital fundamentals and Analog Quantities
2. Basic Logic Function & Boolean Algebra
3. Numbers Systems, Operations and Codes
4. Logic Gates
5. Fundamental Theorems of Boolean Algebra
6. Minimization of Boolean Functions
7. Karnaugh map
8. Simplification of Boolean Functions, POS
9. Function of Combinational Logic
10.Latshes, Flip-Flops, and Timmer
Boolean Algebra
Boolean algebra is a convenient and systematic way of expressing
and analyzing the operation of logic circuits.
Boolean algebra is the mathematics of digital logic.
A variable is a italic uppercase letter or word used to represent
action.
Any single variable can have only a 1 or 0.
The complement of the variable A is 𝐴 if A = 0 then 𝐴 = 1
A literal is a variable or the complement of a variable.
Boolean Algebra
Boolean Addition
It is equivalent to the OR operation.
0+0=0
0+1=1
1+0=1
1+1=1
Boolean Algebra
Boolean Addition
Some Examples of sum terms are
A+B
𝐴+𝐵
𝐴+𝐵+𝐶
𝐴 + 𝐵 + 𝐶 + 𝐷
e.g. 𝐴 + 𝐵 + 𝐶 + 𝐷 = 0
If A =0 , B = 1, C = 0, D = 1
𝐴 + 𝐵 + 𝐶 + 𝐷=0 + 1 + 0 + 1=0+0+0+0
=0
Problem
determine the value of A and B that the sum term 𝐴 + 𝐵 = 0
Boolean Algebra
Boolean Multiplication
Boolean Multiplication is equivalent is equivalent to the AND
operation.
0.0=0
0.1=1
1.0=0
1. 1 = 1
In Boolean algebra, a product term is the product of literals.
The product term is produced by AND operations.
Boolean Algebra
Boolean Multiplication
A product term is equal to 1 only if each of the literal in term is 1.
A product term is equal to zero if one or more term are 0.
𝐴𝐵𝐶𝐷 =1
If A = 1, B= 0, C= 1, D = 0
𝐴 𝐵 𝐶 𝐷 = 1 . 0 . 1. 0 = 1
Related problem
Determine value of A and B that make the product term 𝐴 𝐵 = 1
Laws and Rules of Boolean Algebra
In pure mathematics, there are certain well-developed rules and
laws that must be followed in order to properly apply Boolean
Algebra.
Commutative Laws
The commutative Law of addition for two variable is written as:
A+B=B+A
In logic circuit addition and OR operation is same.
Laws and Rules of Boolean Algebra
Commutative Laws
Laws and Rules of Boolean Algebra
Associative Laws
The associative law of addition is written as following for three
variables:
A + (B + C) = (A + B) + C
The logic is OR more than two variable.
Laws and Rules of Boolean Algebra
Associative Laws
The associative law of multiplication is written as following for
three variables:
A(BC) = (AB)C
Laws and Rules of Boolean Algebra
Distributive Laws
The distributive law of multiplication is written as following for
three variables:
A(B + C) = AB +AC
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
1. A + 0 = A 7. A . A = A
2. A + 1 = 1 8. A . 𝐴 = 0
3. A . 0 = 0 9. 𝐴 = A
4. A . 1 = A 10. A + AB = A
5. A + A = A 11. A + 𝐴B = A + B
6. A + 𝐴 = 1 12. 𝐴 + 𝐵 𝐴 + 𝐶 = 𝐴 + 𝐵𝐶
Boolean expression Rules 1 through 9 will be viewed in terms of
their application to logic gates. Rules 10 to 12 will be derived in
terms of the simpler rules.
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
A B 𝐴B A + 𝐴B A+B
0 0 0 0 0
0 1 1 1 1
1 0 0 1 1
1 1 0 1 1
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
A B AB A + AB
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
Laws and Rules of Boolean Algebra
Rules of Boolean Algebra
Rule : (A + B)(A + C) = A + BC
= AA + AC + AB + BC
= A + AC + AB + BC (Rule AA = A)
= A(1 + C) + AB + BC
= A. 1 + AB + BC (Rule 1 + C = 1)
= A (1 + B) + BC (Rule 1 + B = 1)
= A + BC
Laws and Rules of Boolean Algebra
DeMorgan’s Theorems
The complement of a product of variable is equal to the sum of the
complements of the variables.
𝑋𝑌 = 𝑋 + 𝑌
The complement of two or more ORed variable is equivalent to the
AND of the complement of the individual variable.
𝑋 + 𝑌 = 𝑋𝑌
Laws and Rules of Boolean Algebra
DeMorgan’s Theorems
𝑋𝑌 = 𝑋 + 𝑌
𝑋 + 𝑌 = 𝑋𝑌
Laws and Rules of Boolean Algebra
DeMorgan’s Theorems
Example
Apply DeMorgan’s theorem to the expression 𝑊𝑋𝑌𝑍 and
𝑊 + 𝑋 + 𝑌 + 𝑍
Solution
𝑊𝑋𝑌𝑍 = 𝑊 + 𝑋 + 𝑌 + 𝑍
𝑊 + 𝑋 + 𝑌 + 𝑍=𝑊𝑋𝑌𝑍
Problem Apply DeMorgan’s theorem to the expression 𝑊 𝑋 𝑌 𝑍
Solution
𝑊 𝑋 𝑌 𝑍 = 𝑊 + 𝑋 + 𝑌 + 𝑍 = 𝑊 + 𝑋 + 𝑌 + 𝑍 (rule 𝑊 = W)
Laws and Rules of Boolean Algebra
DeMorgan’s Theorems
Example Apply DeMorgan’s theorem to the expression
𝐴 + 𝐵𝐶 + 𝐷(𝐸 + 𝐹)
Step 1 𝐴 + 𝐵𝐶= X, 𝐷(𝐸 + 𝐹) = Y
Since 𝑋 + 𝑌 = 𝑋𝑌
Therefore
𝐴 + 𝐵𝐶 + 𝐷(𝐸 + 𝐹) = (𝐴 + 𝐵𝐶) (𝐷 (𝐸 + 𝐹))
(rule 𝑊 = W) then
= (A + B𝐶) (𝐷 + E + 𝐹)
Laws and Rules of Boolean Algebra
DeMorgan’s Theorems
Apply DeMorgan’s theorem to the expression
Example 4-5
A) , B) and C) -> Page # 187,188 ( Book The digital fundamental by
Floyd)
Example 4-6
, B) and C) -> Page # 188 ( Book The digital fundamental by Floyd)
Example 4-7
, B) and C) -> Page # 188,189 ( Book The digital fundamental by
Floyd)
END
Q/A
