Dr.

Francis Oketch Ochieng

Email: [email protected]
Tel: +254712 457 837
3.28.1 MTH 2215: DISCRETE MATHEMATICS

Credit: 3 Hours
Pre-requisites: MTH 1109

3.28.2 Purpose of the Course

This course introduces the foundations of discrete mathematics as they apply to computer science,
focusing on providing a solid theoretical foundation for further work.

3.28.3 Expected Learning outcomes of the Course

Upon successful completion of the course, the learner will be able to:
1. Apply the principles of logic and demonstrate logical reasoning and construct valid proofs
in the context of discrete mathematics.
2. Analyze graphs using matrices, digraphs and undirected graphs apply graph analysis
techniques to data science scenarios, making use of edge-vertex relationships.
3. Utilize Boolean algebras and expressions to design and analyze logic networks and
Karnaugh maps and apply Boolean algebra concepts to solve problems related to logic.
4. Simplify complex mathematical expressions and apply general formulae to specific
contexts and use the computer algebra system MAPLE to solve mathematical problems.

3.28.4 Course Content

Logic and Proof Techniques: Define and apply the algebra of propositions, including tautologies
and contradictions, demonstrate proficiency in constructing proofs using techniques such as
induction, enumeration, and contradiction. Apply logic and proof methods to solve problems in
elementary algebra.
Graph and tree analysis: Identify and explain the components of a graph, including vertices and
edges, analyze graphs using matrices to solve problems related to graph representation, Implement
and analyze algorithms for graph traversal and other graph-related operations, define trees and
their properties, including rooted and weighted trees, Solve problems involving tree structures and
their applications in data science.
Boolean algebra: Define Boolean algebras and expressions, apply Boolean algebra concepts to
logic networks and Karnaugh maps for problem-solving.
Complex numbers and functions: Define complex numbers and perform algebraic operations,
including addition, subtraction, multiplication, and division, analyze properties of complex
numbers, including representation on the Argand diagram and the use of De Moivre's theorem,
apply circular and hyperbolic functions of a complex variable to relevant mathematical problems,
evaluate limits, continuity, and differentiability of complex functions, analyze analytic functions,
conformal mappings, integrals, harmonic functions, and various types of complex functions
(rational, exponential, trigonometric, hyperbolic), define and apply linear transformations in the
complex plane, evaluate line integrals in the complex plane and apply Cauchy's integral formula
to find zeros and poles of functions, define the residue theorem and understand its applications in
complex analysis, apply the residue theorem to evaluate complex integrals and solve problems
related to singularities

3.28.5 Instructional Methods

The course will be conducted online using with content posted on the Learning Management
System. Students are required to download Slides, watch the video podcasts, run the simulations
provided and complete the VLABS sessions and read the recommended books to reinforce their
understanding of the concepts learnt.

3.28.6 Instructional Materials and Equipment

Power point presentation, Videos, Case study, Assignment, Facilitator, Exercise, Discussion
forum, Reflective journals on www.usiu.ac.ke/blackboard and servers.

3.28.7 Student Assessment at Course Level

Student assessment at course level will comprise the following
Assessment type % score
Attendance and Participation 10
Quizzes 10
Class Assignments 20
Term Paper/presentations 10
Mid-Semester Exam 20
End-Semester Exam 30
Total 100

3.28.8 Core Reading Materials for the Course

a) Textbook
1. Fan Chun (2019). Discrete Mathematics and Its Applications (Fifth Edition). Chapman
and Hall
2. Istvan Mezo (2019). Discrete Mathematics and its Application (7th ed.). Chapman and
Hall/CRC

b) E-materials
1. Discrete Mathematics with Algorithms by M.O. Albertson and J.P. Hutchinson.
www.freebookcentre.net

c) Journals
1. SIAM Journal on Discrete Mathematics

3.28.9 Recommended Reference Materials

a) Textbook
1. Vivaldi F (2017). Experimental Mathematics with Maple. Chapman & Hall/CR
2. Oscar L. (2021). Discrete Mathematics: An Open Introduction. Greeley, Co

b) E-materials
1. Lecture Notes for College Discrete Mathematics By Gabor and Szabolics Tengely.
www.freebookcentre.net
2. Maple Website: http://www.maplesoft.com

c) Journals
1. Journal of Discrete Mathematics- An Open Access Journal
 ⃝Francis
c Oketch

Lecture 1

1 Introduction
Definition 1.1 (Discrete mathematics). It is a branch of mathematics that focuses on mathematical
structures and concepts that have distinct, separate values, rather than continuous values.

Discrete mathematics deals with objects that come in discrete bundles, e.g., 1 or 2 goats. In
contrast, continuous mathematics deals with objects that vary continuously, e.g., 3.42 inches high.
Think of digital watches versus analog watches (where the second hand loops around continuously
without stopping).

2 Set Theory
Definition 2.1 (Set). It is a collection of objects that are precisely defined.

These objects (which may be cities, countries, years, numbers, letters, or anything else) are called
elements or members of the set. Each element occurs once in a set.

2.1 Set notation and terminology

Usually capital letters of the alphabet are used to represent sets while small letters of the alphabet
are used to represent elements of a set. There are two ways of describing a set

1. Listing method: The elements of a set are listed inside a pair of curly brackets “{}” and
separated by commas. For example, the set whose elements are the first six letters of the
alphabet is written as
A = {a, b, c, d, e, f }

2. Set builder notation: In this method, we specify a set by giving a description of its elements
(without actually listing the elements). We use the notation

B = {x : p(x)},

where p(x) is a condition that x must satisfy for it to be in the given set. For example,

B = {x : x is a positive odd number}

This method is used when it is not possible to list all the elements of a given set. The capital
letters N, Z, Q, R, and C will be reserved to denote the set of natural numbers, set of integers,
set of rational numbers, set of real numbers, and set of complex numbers respectively.

Symbol Meaning
∈ Belongs to (or is a member of). For example, x ∈ A means that the element x belongs to
the set A.
∈
/ Is not a member of. For example, x ∈/ A means that the element x is not a member of A.
∀ For all. For example, ∀x ∈ B, x is an even integer between 1 and 11
∃ There exists. For example, ∃x ∈ B such that x is an even integer between 1 and 11
| or : such that

2.2 Finite and infinite sets

A set is said to be finite if its members can be enumerated and it’s infinite otherwise. For example,
the set A = {1, 2, 3, 4, 6, 12} is finite while the set B = {2, 4, 6, · · · } is infinite.

1
2.3 Empty set ⃝Francis
c Oketch

2.3 Empty set

It is a set with no elements. It is also called null set and is usually denoted by ∅ or {}. For example,

(a) The set of people who are taller than the Times Tower in Kenya.

(b) A = {x : x is a prime number which is a multiple of 4}

2.4 Singleton set

It is a set with one element. For example, A = {3}, B = {a}, etc.

2.5 Universal set

A universal set (U ) is a set which contains all the objects under consideration. For example, suppose
A = {a, b, c, d}, B = {b, d, e, f }, and C = {d, e, f, g, h}. Then the universal set is probably U =
{a, b, c, d, e, f, g, h, p, q, t}. Similarly,

(a) If one considers the set of men and women, then a universal set is probably the set of human
beings.

(b) If one considers sets such as pigs, cows, chickens, or horses, the universal set is probably the set
of animals.

2.6 Equal sets

Two sets A and B are equal if, and only if, they have the same elements. The order in which the
elements are listed does not matter. For example, the sets A = {1, 3, 5} and B = {1, 5, 3} are equal.

2.7 Subsets
The set A is said to be a subset of B, written A ⊂ B, if, and only if, every element of A is also an element
of B. In other words, A is contained in B. For example, let A = {2, 5, 7} and B = {1, 2, 3, 4, 5, 6, 7, 8}.
Then, it is clear that A is contained in B, i.e., A ⊂ B.

 If A is a subset of B and there exists at least one element in B which is not in A, then A is called
a proper subset of B, written A ⊂ B. The “bigger” set B is called a super set of A.

 A set is a subset of itself, i.e., A ⊆ A. This is called the improper subset.

 The empty set is a subset of any set, i.e., ∅ ⊂ A. This is called the trivial subset.

2.8 Cardinality of a set

It is the number of elements in a set. The cardinality (or order) of the set A is denoted by n(A) or
|A|.

2.9 Power set

The power set of A, denoted by P(A), is the set whose elements are all the subsets of A, i.e.,

P(A) = {X : X ⊂ A}

For example,

(a) Let A = {1, 2}. The subsets of A are ∅, {1}, {2} and A. Hence, the power set of A is

P(A) = {∅, {1}, {2}, A}

The cardinality of P(A) is |P(A)| = 4.

2
2.9 Power set ⃝Francis
c Oketch

(b) Let B = {a, b, c}. The subsets of B are ∅, {a}, {b}, {c}, {a, b}, {a, c}, {b, c} and B. Hence, the
power set of B is
P(B) = {∅, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, B}
The cardinality of P(B) is |P(B)| = 8.

→ Note: If |A| = n, then |P(A)| = 2n .

Exercise:

1. Given A = {1, {1, 3}, {2, 3}}, find P(A). [ans:

P(A) = {∅, {1}, {{1, 3}}, {{2, 3}}, {1, {1, 3}}, {1, {2, 3}}, {{1, 3}, {2, 3}}, A}]

2. Find P(∅), P(P(∅)), and P(P(P(∅))).

1

1
Mathematics is fun!