PASSI CITY COLLEGE

Passi, Iloilo

SCHOOL OF INFORMATION AND COMMUNICATION

TECHNOLOGY

DISCRETE MATHEMATICS

MS 101

MODULE 7

ENGR. ROSSANA P. TACDER, MEng’g

Instructor

INSTRUCTOR: ENGR. ROSSANA P. TACDER PAGE NO. 1

MS101 – Discrete Mathematics MODULE
NO. 7
 Introduction to Boolean Algebra

In 1854 George Boole introduced a systematic treatment of logic and developed for
this purpose an algebraic system known as symbolic logic, or Boolean algebra. 
Boolean algebra is a branch of mathematics and it can be used to describe the
manipulation and processing of binary information. The two-valued Boolean algebra
has important application in the design of modern computing systems.
 This lesson contains a brief introduction the basics of logic design. It provides
minimal coverage of Boolean algebra and this algebra’s relationship to logic gates
and basic digital circuit. 

Boolean algebra is algebra for the manipulation of objects that can take on only two
values, typically true and false.
 It is common to interpret the digital value 0 as false and the digital value 1 as true.

Boolean Expression: Combining the variables and operation yields Boolean

expressions.
Boolean Function: A Boolean function typically has one or more input values and
yields a result, based on these input value, in the range {0, 1}.
A Boolean operator can be completely described using a table that list inputs, all
possible values for these inputs, and the resulting values of the operation.
 A truth table shows the relationship, in tabular form, between the input values and
the result of a specific Boolean operator or function on the input variables.
 The AND operator is also known as a Boolean product. The Boolean expression xy
is equivalent to the expression x * y and is read “x and y.” The behavior of this
operator is characterized by the truth table shown in Table 3.1

INSTRUCTOR: ENGR. ROSSANA P. TACDER PAGE NO. 2

MS101 – Discrete Mathematics MODULE
NO. 7
 TABLE 3.1 The Truth Table for AND

The OR operator is often referred to as a Boolean sum. The expression x+y is read
“x or y”. The truth table for OR is shown in Table 3.2

TABLE 3.2 The Truth Table OR

Both x and x’ are read as “NOT x.” The truth table for NOT is shown in Table 3.3

TABLE 3.3 The Truth Table for NOT

INSTRUCTOR: ENGR. ROSSANA P. TACDER PAGE NO. 3

MS101 – Discrete Mathematics MODULE
NO. 7
 The rule of precedence for Boolean operators give NOT top priority, followed by
AND, and then OR

TABLE 3.4 The Truth Table for F(x, y, z) = x + y’z

Boolean Identities

Boolean expression can be simplified, but we need new identities, or laws, that apply
to Boolean algebra instead of regular algebra.

TABLE 3.5 Basic Identities of Boolean Algebra

INSTRUCTOR: ENGR. ROSSANA P. TACDER PAGE NO. 4

MS101 – Discrete Mathematics MODULE
NO. 7
 DeMorgan’s law provides an easy way of finding the complement of a Boolean
function.

TABLE 3.6 Truth Tables for the AND Form of DeMorgan’s Law

Simplification of Boolean Expressions

The algebraic identities we studied in algebra class allow us to reduce algebraic

expression to their simplest form.
To prove the equality of two Boolean expressions, you can also create the truth tables
for each and compare. If the truth tables are identical, the expressions are equal.

Example using Identities

INSTRUCTOR: ENGR. ROSSANA P. TACDER PAGE NO. 5

MS101 – Discrete Mathematics MODULE
NO. 7
 Complements

F(x, y, z) = x’ + yz’ and its complement, F’(x, y, z) = x(y’ + z)

TABLE 3.7 Truth Table Representation for a Function and Its Complement

Representing Boolean Functions

In fact, there are an infinite number of Boolean expressions that are logically
equivalent to one another.
 Two expressions that can be represented by the same truth table are considered
logically equivalent.
 EXAMPLE 3.4
 The two most common standardized forms are the sum-of-products form and the
product-of-sums form.
 In the sum-of-products form, ANDed variables are ORed together. For example,

In the product-of-sums form, ORed variables are ANDed together. For example,

The sum-of-products form is usually easier to work with and to simplify, so we use
this form exclusively in the sections that follow.
 It is easy to convert a function to sum-of-products form using its truth table.
 We are interested in the values of the variables that make the function true (=1).
Using the truth table, we list the values of the variables that result in a true function
INSTRUCTOR: ENGR. ROSSANA P. TACDER PAGE NO. 6
MS101 – Discrete Mathematics MODULE
NO. 7
 value.
 Each group of variables is then ORed together.

TABLE 3.8 Truth Table Representation for the Majority Function

sum-of-products: F(x, y, z) = x’yz + xy’z + xyz’ + xyz

Logic Gates

We see that Boolean functions are implemented in digital computer circuits called gates.

A gate is an electronic device that produces a result based on two or more input
values.
o In reality, gates consist of one to six transistors, but digital designers think of
them as a single unit.
Integrated circuits contain collections of gates suited to a particular purpose.

INSTRUCTOR: ENGR. ROSSANA P. TACDER PAGE NO. 7

MS101 – Discrete Mathematics MODULE
NO. 7