Gospel Reading

Mark 9:14-29.

And when they came to the disciples, they saw a great crowd about them, and scribes
arguing with them. And immediately all the crowd, when they saw him, were greatly
amazed, and ran up to him and greeted him. And he asked them, "What are you discussing
with them?" And one of the crowd answered him, "Teacher, I brought my son to you, for
he has a dumb spirit; and wherever it seizes him, it dashes him down; and he foams and
grinds his teeth and becomes rigid; and I asked your disciples to cast it out, and they were
not able." And he answered them, "O faithless generation, how long am I to be with you?
How long am I to bear with you? Bring him to me." And they brought the boy to him; and
when the spirit saw him, immediately it convulsed the boy, and he fell on the ground and
rolled about, foaming at the mouth.

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 1

Gospel Reading
Mark 9:14-29.

And Jesus asked his father, "How long has he had this?" And he said, "From childhood.
And it has often cast him into the fire and into the water, to destroy him; but if you can do
anything, have pity on us and help us." And Jesus said to him, "If you can! All things are
possible to him who believes." Immediately the father of the child cried out and said, "I
believe; help my unbelief!" And when Jesus saw that a crowd came running together, he
rebuked the unclean spirit, saying to it, "You dumb and deaf spirit, I command you, come
out of him, and never enter him again." And after crying out and convulsing him terribly, it
came out, and the boy was like a corpse; so that most of them said, "He is dead." But Jesus
took him by the hand and lifted him up, and he arose. And when he had entered the house,
his disciples asked him privately, "Why could we not cast it out?" And he said to them,
"This kind cannot be driven out by anything but prayer."

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 2

 Module 1 –
Boolean Algebra

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 3

 Learning Outcomes:
Module Learning Outcomes:

At the end of this module, students will be able to:

• Understand the basic properties of Boolean Algebra.
• Simplify Boolean expressions.
• Identify the basic types of gates. 
• Construct a circuit and define the operation of a circuit by a Boolean
function.

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 4

 Learning Outcomes:
Course Learning Outcomes:
 Evaluate Boolean functions and simplify expressions using properties of
Boolean algebra; apply Boolean algebra to circuits.(CLO1)
Topic Learning Outcomes:
• Simplify and prove Boolean expressions.(TLO1)
• Convert Boolean expressions to logic gates and vice versa. (TLO2)
• Construct a logic circuit and truth table. (TLO3)

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 5

 Topics:
1. Boolean Function and Boolean Expressions.
 Introduction to Boolean Algebra
 Boolean Functions
 Three operations
 Boolean Identities
 Algebraic Simplification
 Truth Table
2. Logic Gates and Combinational Circuits
 Basic types of Logic Gates
 Combinational Circuits
 Truth Table

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 6

 History of Boolean Algebra
 It was invented by George Boole in 1854
 An English mathematician
 Helped established modern symbolic logic, now called as Boolean Algebra.
 The basic to the design of digital computer circuits.

 Known before as Symbolic Logic

 Each variable has either of two values: True or False.
 The purpose of the two-state is to solve logic problems.

George Boole
1815-1864

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 7

Boolean Functions and Boolean Expressions

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 8

Introduction to Boolean Algebra
Boolean Algebra
• It is the set of rules used to simplify the given logic expression without changing its
functionality.
• A set B with two binary operations ∨ and ∧, elements 0 and 1, and a complementation
operator that satisfies the identity, complement, associative, commutative, and distributive
laws
• Provides the operations and the rules for working with the set {0, 1}.
• It deals with variables that can have two discrete values, 0 (False) and 1 (True); and
operations that have logical significance.
• The earliest method of manipulating symbolic logic was invented by George Boole in 1854
and subsequently came to be known as Boolean Algebra.

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 9

Boolean Functions
• Described by an algebraic expression called Boolean expression which consists
of binary variables, the constants 0 and 1, and the logic operation symbols.

• Three operations in Boolean Algebra

1. Complementation
2. Boolean Sum
3. Boolean Product

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 10

1. Complement
• x (complement of x): an expression with the value 1 when x has the value 0
and the value 0 when x has the value 1
• The complement of an element is denoted with a bar.
• 0 = 1 and 1 = 0
Input Output
0 1
1 0

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 11

2. Boolean Sum
• x + y (Boolean sum or disjunction of x and y): an expression with the value 1
when either x or y, or both, has the value 1, and 0 otherwise
• it is denoted by + or by OR
• 1 + 1 = 1; 1 + 0 = 1; 0 + 1 = 1; 0 + 0 = 0
INPUTS Output
0 0 0
0 1 1
1 0 1
1 1 1

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 12

3. Boolean Product
• x ⋅ y (or xy) (Boolean product or conjunction of x and y): an expression with
the value 1 when both x and y have the value 1 and the value 0 otherwise
• it is denoted by · or by AND, has the following values:
• 1 · 1 = 1 ; 1 · 0 = 0 ; 0 · 1 = 0; 0 · 0 = 0
INPUTS Output
0 0 0
0 1 0
1 0 0
1 1 1

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 13

Boolean Expressions and Boolean Functions.
 Boolean expressions: the expressions obtained recursively by specifying that
0, 1, x1,… , xn are Boolean expressions and E1, (E1 + E2), and (E1E2) are Boolean
expressions if E1 and E2 are
 Dual of a Boolean expression: the expression obtained by interchanging +
signs and ⋅ signs and interchanging 0s and 1s
 Boolean function of degree n: a function from Bn to B where B = {0, 1}

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 14

Examples:
1. Find the value of 1 · 0 + (0 + 1).
Solution:
1 · 0 + (0 + 1) = 0 + 1
= 0+0
= 0.
2. Translate 1 · 0 + (0 + 1) = 0 into logical equivalence
Solution:
(T ^ F) v ¬(T v F ) = F

3. Translate the logical equivalence (T ^ T) v ¬ F = T into an identity in Boolean Algebra.

Solution:
(1 · 1) + 0 = 1.

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 15

Example No. 4
The function F(x, y) = x y from the set of ordered pairs of Boolean variables to
the set {0,1} is a Boolean function of degree 2 with F(1,1) = 0, F(1,0) = 1, F(0,1) =
0 and F(0,0) = 0. We display these values of F in table.

x y F(x,y)
1 1 0
1 0 1
0 1 0
0 0 0

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 16

Example No. 5
Given: Find the values of the Boolean function represented by
F(x, y, z) = x y + z using truth table.
x y z xy z F(x, y, z) = x y + z
1 1 1 1 0 1
1 1 0 1 1 1
1 0 1 0 0 0
1 0 0 0 1 1
0 1 1 0 0 0
0 1 0 0 1 1
0 0 1 0 0 0
0 0 0 0 1 1

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 17

Example No. 6:
5. Show that the distributive law x(y + z) = x y + x z is valid.
Solution: x y z y+z xy xz x(y + z) xy+xz
1 1 1 1 1 1 1 1
1 1 0 1 1 0 1 1
1 0 1 1 0 1 1 1
1 0 0 0 0 0 0 0
0 1 1 1 0 0 0 0

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

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 18

Identities in Boolean Algebra

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 19

Boolean Laws
AND LAW OR LAW INVERSION(NOT) Identities
X+0 X LAW A + AB A+B
X·0 0
X X A + AB A+B
X·X X X+X X
X+1 1 A + AB A+B
X·1 X
A + AB A+B
X·X 0 X+X 1

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 20

Simplification of Boolean Expressions
Example No. 1
Z = XY + XY
TRUTH TABLE
PROVING: INPUTS
PROOF IDENTITY NAME X Y X XY XY Z Z=Y
Y(X + X) Distributive Law 0 0 1 0 0 0 0
Y·1 And Law/Operation 0 1 1 0 1 1 1
Y Answer 1 0 0 0 0 0 0
1 1 0 1 0 1 1

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 21

SIMPLIFICATION: (cont.)
Example No. 2
Z = XY + XY + XY TRUTH TABLE
PROVING: INPUTS G A
PROOF IDENTITY LAW X Y X Y XY XY XY Z Z

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 22

SIMPLIFICATION: (cont.)
Example No. 3
Z = (X + Y) (X + Y)
TRUTH TABLE
PROVING:
PROOF IDENTITY LAW INPUTS

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 23

 Logic Gates and
Combinational Circuits

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 24

Logic Gates
• It is a building blocks of forming digital electronics circuitry.
• basic elements of circuits
• Has one or more inputs signals and only one output signal.
• Are often called logic circuits because it can be analyzed with Boolean
Algebra

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 25

 Basic Types of Gates

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 26

 1. AND Gate
•AND gate: a device that accepts the values of two
or more Boolean variables as input and produces Logic Equation:
their Boolean product as output
A ∙ B = C or AB = C
•It has two or more input signals but only one
output signal. Truth Table:
• All inputs must be high to get a high output.
Logic Symbol: (2-input and gate)

Inputs: A & B; output: C

“A and B is equal to C”

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 27

 2. OR Gate
•OR gate: a device that accepts the values of two or
more Boolean variables as input and produces their Logic Equation:
Boolean sum as output
A+B=C
•It has two or more input signals but only one output
signal. Truth Table:
• The output is TRUE if either or both of the
inputs are TRUE. If both inputs are false, then
the output is false.
Logic Symbol: (2-input and gate)

Inputs: A & B; output: C

“A OR B is equal to C”

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 28

 3. Inverter Gate
•inverter: a device that accepts the value of a
Boolean variable as input and produces the
complement of the input Truth Table:

•It has only one input and output signal.

• If the input is true, then the output will
be false. Similarly, a false input results in
a true output.
Logic Symbol

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 29

Example No. 1
1. Construct the truth table of a 3-input (A,B,C) logic gate. Determine the output using And gate
and OR gate.

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 30

Combinations of Gates
• Can be constructed using a combination of inverters, OR gates, and AND gates.

• Two ways in depictions of circuits.

 One method is to use branching that indicate all the gates that use a given
input.
 The other method is to indicate this input separately for each gate.

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 31

3 ways of specifying the function of a combinational logic
circuits.
1. Boolean Expression
o This form the algebraic expression showing the operation of the logic circuit for each input
variable either True or False that results in a logical output.
2. Truth Table
o Defines the functions of a logic gate by providing a concise list that shows all the output
states in tabular form for each possible combination of input variable.
3. Logic Diagrams
o A graphical representation of a logic circuit that shows the wiring and corrections of each
individual logic gate

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 32

Exercise 3:
Given the logic equation A + BC­­+ C = Z. Perform the following:
1. Draw the logic circuit.
2. Determine the number of input combinations.
3. Construct the truth table.
4. Which among the input combinations produced an output of 1.

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 33

References:
Rosen, Kenneth H. Discrete Mathematics and Its Application. 2019. 8 th Ed. McGraw-Hill Higher Education.
https://www.tutorialspoint.com/discrete_mathematics/boolean_expressions_functions.htm
https://slideplayer.com/slide/12942033/
https://www.britannica.com/biography/George-Boole
https://www.youtube.com/watch?v=OjWmVCG8PLA

05/04/2023 MODULE 1 - BOOLEAN ALGEBRA 34