Weekly Semestral Module

sMathplu

Mathematics for
Information
Technology

Name:
Course: Bachelor of Science in Information Technology

Instructor: Elizor M. Villanueva

 OVERVIEW |
This course introduces the concepts of discrete mathematics as they apply in
information technology. Topics include sets, basic logic, introduction to digital logic and
digital circuit and introduction to K-Maps.

MODULE 1 OF 3 |
DURATION: August 25 to September 3

| LEARING OUTCOMES

At the end of this module, you should be able to

Perform operations associated with sets and relations
| EXPECTATIONS

In this module I expect you to:

Finish all activities in this module
Participate in the discussions

| LEARNING RESOURCES

Computer / laptop / mobile phone / tablet

Internet connectivity.
Word processing application (MS Word/WPS/Docs)
Installed LMS Application (Lampara and Google Classroom)
Installed video conferencing application (Zoom/Google Meet)
| SET THEORY

DEFINITION OF SET

In our high school days, we learned that set is simply a collection of well-defined objects
or a simpler definition is a collection or elements. In this module, you and I, together we will
recall the lessons of the set theory. Let us first recall who created the set theory.

Georg Ferdinand Ludwig Philipp Cantor was a German

Mathematician, born in Russia. He is best known as the creator
of set theory, which has become a fundamental theory in
Mathematics.

Example

1. The set {apple, mango, grape, orange} contains the names of fruits.
2. The set {2, 4, 6, 8, 10} contains 5 even numbers between 1 and 11.

2|Page
 SHOUT IT OUT
Now that we have come up with a definition of set, let us talk about the object in
it. Can you remember what do we call these objects?

______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________

During your junior high school days, you have thought with the several ways to describe
a set. One way is by intentional definition using semantic definition. Don’t forget that a set is
represented using a capital boldface letter.

Example

1. Set A is the set of OLSHCO Core Values.

SHOUT IT OUT
Can you name the elements of the set of the OLSHCO Core Values?
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

Another way is to list all the members of a set, when this is possible. The notation used to
list all members of the set is by the use of braces, { }. This way of describe a set is called roster
method.

Example

1. E = {x, y, z}
2. M={c, c++, c#, java, python, vb.net}
3. V= {2, 4, 6, 8, 10, 12, 14}.

Sometimes the roster method is used to describe a set without listing all its members,
some members of the set are listed, and then the ellipse (…) are used when the general pattern of
the elements is obvious.

Example

1. The set of positive integers less than 150 can be denoted by {1, 2, 3, …149}.
2. The set of even numbers less than 1000 can be denoted by {0,2,4,6, …999}.

3|Page
 SHOUT IT OUT
What if it is impossible to list all the elements of the set, is there a way to
describe the set? What do we call this notation? Give an example.
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

After we discussed the ways in describing a set, this time, I want you to take a look and
study these sets: A = {a,b,c} B = {c,a,b}

You noticed that both sets A and B contain the same elements. They both have the letters
a, b and c as its members. We refer these as equal sets. We can say that A is equal to B (A =
B). Equal sets are sets with the same members or elements. The order of the elements listed in
the set is not required. It also does not matter if an element of a set is listed more than once, so
that {1, 2, 3, 3, 4, 5, 5, 6} is the same as the set {1, 2, 3, 4, 5, 6} since they have the same
elements.

SHOUT IT OUT
How about sets having the same number of elements, how do we call them?
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

VENN DIAGRAM

John Venn developed a method of using diagrams

to illustrate set theory, called Venn Diagram.

Sets can also be represented graphically using Venn diagram. In Venn Diagrams the
Universal Set U, which contains all the objects under consideration. Venn diagram is represented
using a rectangle. Inside the rectangle, circles or other geometrical figures are used to represent
sets. Sometimes points are used to represent the particular elements of the set. Venn diagrams are
often used to indicate the relationships between sets.

Here is a Venn Diagram representing set V. The rectangle is used to indicate the
Universal set U, which is the set of the 26 letters of English alphabet. Inside this rectangle, is a
circle to represent V. Inside this circle are the elements of V. Notice that we used lower case
letters to represent the members of V.

U
4|Page
 a
u
o V e

Another notation used to describe membership in sets by writing ”a ∈ A” to denote that

“a is an element of the set A”. The notation “a ∉ A” denotes that “a is not a member of the set A”.

There is special set that has no element. This set is called the empty set, or null set, and it
is denoted by ∅. The empty set can also be denoted by { } that is empty with a pair of braces that
encloses all the elements in the set. Often a set of elements with certain properties turns out to be
the null set.

A common error is to mistake the empty set ∅ with the set {∅}, which is a singleton set
that is a set with one element. The element of the set {∅} is the empty set itself.

Now, study the Venn diagram below,

With the use of the Ven Diagram we can say that elements of A are also elements of B.
In this case, if all of the elements of A are also the element of B, this is called a subset. If that’s
the case, we can say that A is a subset of B. We can write that this way A ⊆ B. On the other
hand, we can say that B is a superset of A or B⊇ A.

Example

A = {1,2,3,4}
B = {1,2,3,4,5}
In the example, it is clear that A ⊆ B because the elements 1, 2, 3 and 4 are also present
in B. Therefore, B ⊇ A.

SHOUT IT OUT
If we have A = {1,2,3} and B = {1,2}, notice that B has less element than A.
And B contains some of the elements of A. How do we refer to this kind of set?
How do we denote thin in symbol?
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

5|Page
 Now, let’s talk about the cardinality of set. Cardinality of set is a measure of a set’s size.
Or we can say that it is the number of elements or number of the members of a set. We denote the
cardinality of a set like this “| S |” read as “cardinality of S”.

Example
1. Let A be the set of odd positive integers less than 10. Then | A | = 5.
2. Let S be the set of letters in the English alphabet. Then | S | = 26.
3. Since the null set has no elements, it follows that |∅| = 0.

SHOUT IT OUT
There is what we call finite and infinite set. Differentiate the two.
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

6|Page
 | I CAN DO IT : SETS
C

List the members of these sets. I used the set builder notation to describe the following
sets
{ x | x is a real number such as = 1}
{ x | x is a square of an integer and x 100}
{ x | x is a real number such as = 1}

Are sets A and B equal, where: A = {a, b, b, c, c, d, e, e, f} and B = {c, c, d, e, f}?

Are sets A and B equal, where: A = , B = {}?

Suppose that A= {3, 4, 5} B= {4, 5} C= {2, 4, 6} D= {1, 2, 3, 4}. Determine which of

these sets are subsets of which other of these sets.

Is 3 an element of A ={ x R | x is the square of an integer}?

True or false, 0 ?

True or false, {} ⊆ {}

True or false, {0}

Use the Venn diagram to illustrate the relationship A ⊆ B and B ⊆ C.

THE POWER SET AND CARTESIAN PRODUCT

Power Set

The power set of a set A is the set containing all possible subsets of A including the
empty subset. It contains 2n elements where n is the number of elements in A. It is typically
denoted by P(A) or 2 A . Note that each element of a power set is a set in itself.

Example
If S = {x, y, z}, then the complete list of subsets of S is as follows:

{} (also denoted ∅, the empty set)

{x} {y} {z} {x,y} {y,z} {x, y, z}

And hence the power set of S is P(S) = { {}, { x }, {y}, {z}, {x, y}, {x, z}, {y, z}, {x,
y,}}

Let’s try another one. What is the power set of the set {0, 1, 2}?
The power set P ({0, 1, 2}) is the set of all subsets of {0, 1, 2}.
Hence, P ({0, 1, 2}) = {∅, {0}, {1}, {2}, {0,1}, {0, 2}, {1, 2}, {0, 1, 2}}

If a set has n elements, then its power set has 2n elements.

7|Page
 SHOUT IT OUT
Let’s try this one, find the power set of and {.
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________

CARTESIAN PRODUCT

The Cartesian product is named after Rene Descartes also

known as Renatus Cartesius, whose formulation of analytic
geometry gave rise to this concept.

The ordered n-tuple (a 1 a 2, ………, a n) is the ordered collection that has a 1 as its first
element, a 2 as its second element……, and a n as its nth element.

Let A and B are sets. In cases where the two input sets are not the same, the Cartesian
product is not commutative because the ordered pairs are reversed. Although the elements of
each of the ordered pairs in the sets will be the same, the pairing will differ.

AxB≠BxA

Example
1. Let A represent the set of all students at a university, and let B represent the set of all
courses offered at the university. What is the Cartesian product A x B?

Solution: The Cartesian product A x B consists of all the ordered pairs of the form (a, b),
where A is a student at the university. The set A x B can be used to represent all possible
enrollments of student in course at the university.

Example
2. What is the Cartesian product of A = { 1, 2 } and B = {a, b, c}?

Solution: The Cartesian product of A x B is

A x B = { (1, a), (1, b), (1, c), (2, a), (2, b), (2, c) }
A subset R of the Cartesian product A x B is called a relation from the first element
belongs to A and the set B. The elements of R are ordered pairs, where the first element
belongs to A and the second elements of
R = { (a, 0), (a, 1), (a, 3), (b, 1), (b, 2), (c, 0), (c, 1), (c, 3) is a relation from the set {a, b,
c} to the set {0, 1, 2, 3}.
The Cartesian Products A x B and B x A are not equal, unless A = ∅ or B = ∅ so that A x
B = ∅ or A = B.

8|Page
 SHOUT IT OUT
Show that the Cartesian product B x A is not equal to the Cartesian product A x
B, where A and B are in example 2.
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

Example

3. What is the Cartesian product A x B x C, where A = {0,1}.

B = {1, 2}, and C = {0, 1, 2}?

Solution:

The Cartesian product A x B x C consists of all ordered triplets (a, b, c), where a ∈ A, b
∈ B, c ∈ C. Hence,

A x B x C = { (0, 1, 0), (0, 1, 1), (0, 1, 2), (0, 2, 0), (0, 2, 1), (0, 2, 2), (1, 1, 0), (1, 1, 1),
(1, 1, 2), (1, 2, 0), (1, 2, 1), (1, 2, 2) }.

| I CAN DO IT: POWER OF SETS AND CARTESIAN PRODUCTS

C
Find the power set of each of P = { 1, 3, 5, 7 }

Can you conclude that A = B if A and B are two sets with the same power set? Prove.

Let A = {a, b, c}, B = {x, y}, C = {0, 1}. Find C x B x A

SET OPERATIONS

Let A and B be sets. “The Union of the sets A and B”, denoted by “A ∪ B”, is the set
that contains those elements that are either in A or in B, or in both.

An element x belongs to the union of the sets A and B if and only if x belongs to A or x
belongs to B. This tells that A ∪ B = { x | x ∈ A v x ∈ B }

9|Page
Union of Two Sets

The union of sets “A” and “B” is a third set, which consists all the elements of two sets.
In symbol, A ∪ B = { x | x ∈ A ∪ x ∈ B }

The word “or” in the set builder form defining union is important. It means that the
element “x” belongs to either A or B. The element may belong to both sets (common to two
sets), but not necessarily. We can, therefore, infer that union set consists of:
1. elements exclusive to A
2. elements exclusive to B
3. elements common to A and B

Example
1. The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5} that is {1, 3, 5} ∪ {1, 2,
3} = {1, 2, 3, 5}

2. A = {1, 2, 3, 4, 5, 6} B = {4, 5, 6, 7, 8} The union of two sets is:

 A ∪ B = {1, 2, 3, 4, 5, 6, 4, 5, 6, 7, 8}

But repetition of elements in a set does not change it. Hence, we don’t need to repeat
elements in the resulting union.

 A ∪ B = {1, 2, 3, 4, 5, 6, 7, 8}

Let A and B be sets. “The intersection of the sets A and B”, denoted by “A ∩ B”.

The intersection (denoted by ∩) of two sets A and B is the set that contains all elements
of A that also belong to B (or equivalently, all elements of B that also belong to A), but no other
elements.

The intersection of A and B is written “A ∩ B”. Formally:

x ∈ A ∩ B if and only if
1. x ∈ A and
2. x ∈ B.
Example
1. The intersection of the sets A = {1, 2, 3} and B = {2, 3, 4} is {2, 3}.
2. The intersection of sets {1, 3, 5} and {1, 2, 3}; that is {1, 3, 5} ∩ {1, 2, 3} = {1, 3}

SHOUT IT OUT
When no element is common to two sets, what is the result intersection in them.
What do we call these sets?

10 | P a g e
 Now, Let A and B be sets. “The difference of A and B”, denoted by “A – B”, is the set
containing those elements that are in A but not in B. The difference of A and B is also called the
complement of B with respect to A.

An element x belongs to the difference of A and B if and only if x ∉ B. This tells that A
–B={x|x∈A∩x∉ B}

The shaded area inside the circle represents A and the part that’s outside the circle
represents B is the area that represents A – B.

Example
The difference of {1, 3, 5} and {1, 2, 3} is the set {5}; that is {1, 3, 5} – {1, 3, 5} = {5}
This is different from the difference of {1, 2, 3} and {1, 3, 5}, which is the set {2}.

Let U be the universal set. “The complement of the set A”, denoted by “ Ac ”, is the
complement of A with respect to U. In other words, the complement of the set A is U – A.
An element belongs to Ac if and only if x ∉ A. This tells that Ac = { x | x ∉ A }

The shaded area outside the circle representing A is the area representing Ac .

Example 5
1. Let A = {a, e, i, o, u} where the universal set is the set of letters of the English alphabet.
Then Ac = {b, c, d, e, f, g, h, I, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z}

SET IDENTITIES

One way of proving set identities is by the use of three different methods. These methods
are presented to illustrate that there are often many different approaches to the solution of a
problem.

One way of proving that two sets are equal is to show that one of the sets is a subset of
the other and vice versa. This type of proof is illustrated by establishing the seconds of the De
Morgan’s laws.

11 | P a g e
Here are the lists of Set Identities:

Set Identities
Identity Name
A ∪ ∅ =A Identity laws
A∩B=A
A∪U=U Domination laws
A∩∅ =∅
A∪A=A Idempotent law
A∩A=A
A∪B=B∪A Commutative laws
A∩B=B∩A
A∪(B∪C)=(A∪B)∪C Associative laws
A∩(B∩C)=(A∩B)∩C
A∩(B∪C)=(A∩B)(A∩C) Distributive laws
A∪(B∩C)=(A∩B)(A∪C)
A∪(A∩B)=A Absorption laws
A∩(A∪B)=A

GENERALIZED UNIONS AND INTERSECTIONS

Since Unions and intersections of sets satisfy associative laws, the sets A ∪ B ∪ C and A
∩ B ∩ C are well defined when A, B, and C are sets. Note that A ∪ B ∪ C contains those
elements that are in at least one of these sets A, B, C and that A ∩ B ∩ C contains those
elements that are in all of A, B, C. These combinations of the three sets A, B, C are shown in the
figure.

12 | P a g e
Example
1. Let A = { 0, 2, 4, 6 }
B = { 0, 1, 2, 3, 4 }
C = { 0, 3, 6, 9 }
What are A ∪ B ∪ C and A ∩ B ∩ C?

Solution:
The set A ∪ B ∪ C contains those elements in at least one of A, B and C
Hence, A ∪ B ∪ C = { 0, 1, 2, 3, 4, 6, 8, 9 }
The set A ∩ B ∩ C contains those elements in all three of A, B, and C,
thus A ∩ B ∩ C = { 0 }

| I CAN DO IT :
C

Let A = { 1, 2, 3, 4, 5 } and B = { 0, 3, 6 } Find

A B
A B
A B
B A

Let A = { 0, 2, 4, 6, 8, 10 }
B = { 0, 1, 2, 3, 4, 5, 6 }
C = { 4, 5, 6, 7, 8, 9, 10 } Find

A B C
(A B) C
A B C
(A B) C

Draw the Venn diagram for each of these combinations of the sets A, B, and C.
A (B C)
(AB) (AC)

13 | P a g e
| LEARNING SUMMARY
C

In this module I learned to

______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
_________________________________________________________________

evident with my submitted activities.

In this module I need to know more the concepts on

______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
____________________________________________________________.

| REFLECTION
C

Assuming that you are already an IT professional and employed in company designing
a machine that segregates wastes. How can you be an instrument of change in
utilizing your skills in view of OLSHCO Core Value? Site an example.
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
___________________________________________________________________________________.

14 | P a g e
REFERENCES|
Fernandez, M. (2010). Discrete Mathematics,
MindShapers Co. Inc

Johnsonbaugh, R. (2005). Introduction to Discrete Mathematics Sixth Edition,

Pearson Education South Asia Pte. Ltd.

TutorialsPoint (n.d.). Learn Discrete Mathematics, Retrieved from

https://www.tutorialspoint.com/discrete_mathematics/index.htm

TutorialsPoint (n.d.). Learn Computer Logical Organization, Retrieved from

https://www.tutorialspoint.com/computer_logical_organization/logic_gates.htm

TutorialsPoint (n.d.). Learn Discrete Mathematics, Retrieved from

https://www.tutorialspoint.com/discrete_mathematics/index.htm

Prepared by: Checked by:

ELIZOR M. VILLANUEVA JOEL P. ALTURA

Instructor OIC, Program Head

Verified by: Checked by:

MYRNA V. LENON RUBELYN M. ESPERON, PhD

Quality Assurance Monitor College Dean

15 | P a g e