Scribd
Upload
10 views23 pages

Lec 1 - 113843

Uploaded by

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

Lec 1 - 113843

Uploaded by

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

Digital Logic Design

Mr. Faisal Naeem


Boolean Expression

 A logical statement that results in a Boolean value, either be True or


False, is a Boolean expression.
 Sometimes, synonyms are used to express the statement such as
‘Yes’ for ‘True’ and ‘No’ for ‘False’.
 Also, 1 and 0 are used for digital circuits for True and False,
respectively.
Boolean Algebra Terminologies

 Boolean Algebra: Boolean algebra is the branch of algebra that


deals with logical operations and binary variables.
 Boolean Variables: A Boolean variable is defined as a variable or a
symbol defined as a variable or a symbol, generally an alphabet that
represents the logical quantities such as 0 or 1.
 Boolean Function: A Boolean function consists of binary variables,
logical operators, constants such as 0 and 1, equal to the operator,
and the parenthesis symbols.
 Literal: A literal may be a variable or a complement of a variable.
 Complement: The complement is defined as the inverse of a
variable, which is represented by a bar over the variable.
Boolean Algebra Terminologies

 Literal: A literal may be a variable or a complement of a variable.


 Complement: The complement is defined as the inverse of a
variable, which is represented by a bar over the variable.
 Truth Table: The truth table is a table that gives all the possible
values of logical variables and the combination of the variables. The
number of rows in the truth table should be equal to 2n
Laws of Boolean Algebra

 Commutative Law: Commutative law states that changing the


sequence of the variables does not have any effect on the output of a
logic circuit.
A. B = B. A
A+B=B+A
 Associative Law: It states that the order in which the logic
operations are performed is irrelevant as their effect is the same.
( A. B ). C = A .
(B.C)
(A+B)+C=A
+ ( B + C)
Laws of Boolean Algebra

 Distributive Law: Distributive law states the following conditions:


A. ( B + C) = (A. B) + (A. C)
A + (B. C) = (A + B) . ( A + C)
 AND Law: These laws use the AND operation. Therefore they are
called AND laws.
A .0 = 0
A.1=A
A.A = A
Laws of Boolean Algebra

 OR Law: These laws use the OR operation. Therefore they are called
OR laws.
A +0=
A
A+1=
1
A+A=
A

 Inversion Law: In Boolean algebra, the inversion law states that


double inversion of variable results in the original variable itself.
Boolean Algebra Theorems

 The two important theorems which are extremely used in Boolean


algebra are De Morgan’s First law and De Morgan’s second law.
 These two theorems are used to change the Boolean expression.
 De Morgan’s First Law: De Morgan’s First Law states that (A.B)’ =
A’+B’.
De Morgan’s First Law

 De Morgan’s First Law states that


(A.B)’ = A’+B’

 Draw Truth Table?


De Morgan’s Second Law

 De Morgan’s Second Law: De Morgan’s Second


law states that
(A+B)’ =
A’. B’

 Draw Truth Table?


Example

 Question 2: Draw a truth table for A(B+D)?


Example
Example
(Draw truth table)
Example
Example
(Draw truth table) I/P = 8
Example
Example

Check whether AC + ABC = AC is true or false?


Solution:
Given Boolean expression: AC + ABC = AC
AC (1+B) = AC
Now, using the null law 1+B = 1, the above expression can be written
as:
AC.1 = AC
Thus, using the identity law, 1.A = A, the above expression becomes:
AC = AC
Hence, AC + ABC = AC is true.
Example

(X + Y) (X + Z)
= XX + XZ +YX + YZ
=X+ XZ +YX + YZ X.X=X
= X (1 + Z) + YX + YZ
= X + YX + YZ 1+Z=1
= X (1 + Y) + Y Z
= X + YZ 1+Y=
1
Example

Proof by Perfect induction Method ( truth Table):


Truth Table for the
R.H.S. (X + Y) (X+ Z)
L.H.S. X + YZ
Example

(A+B)(A+C) = A+BC

You might also like