Discrete Fall-25
Mathematics
Mr. Muhammad Waseem Malik Lecture 01
Lecturer Week 01
Computing and Technology Department
Iqra University Islamabad Campus H-9
Email: muhammad.waseem1@[Link]
Course Learning Outcomes (CLOs) 2
Week Lecture Topic Intended Learning Outcome
Students will be able to
Introduction to Discrete differentiate between
01 Mathematics, Logic, continuous and discrete data,
Propositions, and Statements identify propositions, and
determine truth values.
Course Learning Objectives 3
By the end of this course, students will be able to:
Understand the role of discrete mathematics in computer science.
Interpret and manipulate logical expressions and set operations.
Develop logical reasoning skills for proofs and algorithms.
Construct and interpret mathematical models involving discrete
structures.
Apply discrete mathematical concepts to real-world computing
problems.
Weekly Learning Outcome 4
Week Lecture Topic Intended Learning Outcome
Students will be able to
Introduction to Discrete differentiate between
01 Mathematics, Logic, continuous and discrete data,
Propositions, and Statements identify propositions, and
determine truth values.
5
Assessment Assessment Type Weight Related CLOs
Mapping Quiz (3) 15% CLO1, CLO2, CLO3
Assignment (3) 15% CLO1, CLO2, CLO3
Mid 25% CLO1, CLO2
Final 40% CLO1, CLO2, CLO3
Project 05% CLO3
6
Reference Discrete Mathematics and Its
Applications
Books Seventh Edition
By K. H. Rosen
Discrete Mathematics 7
Chapter 1
The Foundations: Logics, Sets, and Functions
Discrete Mathematics 8
Particular value
Number of students in your class? 50, 60 or 45
Height of students in your class?
continues value, vary from student to student
Yes, No
Today is Friday. True, false
1, 0
Discrete mathematics is the study of mathematical structures
that are countable or otherwise distinct and separable.
Definition 9
Discrete mathematics is like a special kind of math that
focuses on things you can count or keep separate from
each other. Instead of dealing with smooth and
continuous things, it looks at distinct and individual
pieces, like whole numbers or separate objects.
Digital : Discrete
Analog : Continuous
Definition 10
Discrete Math is not the name of a branch of
mathematics, like number theory, algebra, calculus, etc.
Rather, it's a description of a set of branches of math
that all have the common feature that they are
"discrete" rather than "continuous".
Why Discrete Mathematics 11
Generally: Logics making and problem-solving capabilities
In computer science: better understanding of digital computers
high
low
Some basics 12
Statement or Proposition
A statement that you can determine to be either true or false.
Examples:
Grass is green.
4+2=6
4+2=8
Examples 13
There are four figures in a hand.
Close the door.
X is greater than 2.
He is very rich.
X>2
X + 2 is positive
May I come in?
Logic is interesting.
Examples 14
It is hot today.
-1 > 0
X + Y = 12
Explanation 15
Understand some basics Statement
Declarative: This is apple.
Imperative: Eat this apple.
Interrogative: Is this apple?
Proposition
A proposition is a statement that is either true or false, but
not both.
Practice Exercise 16
Examples:
All the following declarative sentences are propositions.
1. Washington, D.C., is the capital of the United States of America.
2. Toronto is the capital of Canada.
3. 1 + 1 = 2.
4. 2 + 2 = 3.
Propositions 1 and 3 are true, whereas 2 and 4 are false
Practice Exercise 17
Consider the following sentences.
1. What time is it?
2. Read this carefully.
3. x + 1 = 2.
4. x + y = z.
Sentences 1 and 2 are not propositions because they are not
declarative sentences. Sentences 3 and 4 are not propositions
because they are neither true nor false
Propositional Variable: 18
We use letters to denote propositional variables (or statement
variables), that is, variables that represent propositions, just as
letters are used to denote numerical variables. The conventional
letters used for propositional variables are p, q, r, s, . . . .
The truth value of a proposition is true, denoted by T, if it is a true
proposition, and the truth value of a proposition is false, denoted
by F, if it is a false proposition.
Truth Value 19
Truth Value of Proposition
True
False
Notation:
Proposition can be denoted by any letter p, q, r, s, t
p: Today is Friday.
q: Washington is the capital of America.
Propositional Logic 20
The area of logic that deals with propositions is called the
propositional calculus or propositional logic.
Practice Exercise 21
Elephants are bigger than cat.
Is this a statement?
Is this a proposition?
What is the truth value of the proposition?
Compound Statement 22
A combination of two or more propositions using AND, OR,
and NOT operators (logical connectives).
Grass is green OR 4 + 2 = 0
Grass is green OR 4 + 2 = 0 AND 4 + 2 = 7
Logical Connectives 23
Connective Meaning Symbol Called
Negation not ~ Tilde
Conjunction and ^ Hat
Disjunction Or V Vel
Practice Exercise 24
Grass is green OR 4 + 2 = 0 AND 4 + 2 = 7
pv q ^r
p = grass is green
q=4+2=6
r=4+2=7
Practice Exercise 25
Let p = “It is hot”, and q = “it is sunny”
Propositions Symbolic Form
It is not hot. ~p
It is hot and sunny. p^q
It is hot or sunny. pvq
It is not hot but sunny. ~p^q
It is neither hot nor sunny. ~p ^ ~q
Practice Exercise 26
Let h = “Zia is healthy”
w = “Zia is wealthy”
s = “Zia is wise”
Propositions Symbolic Form
Zia is healthy and wealthy but not wise. (h ^ w) ^ ~s
Zia is not wealthy, but he is healthy and wise. ~w ^ (h ^ s)
Zia is neither healthy, wealthy nor wise. ~h ^ ~w ^ ~s
Practical Link 27
Why Discrete Mathematics Matters in Computer Science
Discrete Mathematics is not just theory — it’s the
foundation of many computing concepts!
Concept In Discrete Math In Computer Science
Logics Deals with propositions, truth Used in programming conditions, AI
tables, and logical reasoning. decision-making, and digital circuit
design (Boolean algebra).
Sets Describes collections of distinct Forms the basis of databases, data
elements. structures, and SQL operations (e.g.,
UNION, INTERSECT).
Functions Maps input to output with Seen in programming functions,
specific rules. algorithm design, and hashing.
Relations Show connections between Used in ER diagrams, graph theory,
objects. and network models.
Logic in Programming 28
In the Mathematics:
p: It is raining, q: I will take an umbrella
⇒ p→q
means If it rains, I will take an umbrella.
In programming
if (isRaining) {
takeUmbrella();
}
The same logical rule applies in both math and programming!
Takeaway:
Logic helps computers make decisions — the core of every algorithm.
29
Review Propositions,
Questions Logics, Truth
Values
Review Questions 30
Q1: Define a proposition and give two examples.
Q2: Explain the difference between a statement and a
proposition.
Q3: Identify which of the following are propositions:
a. “Close the door.”
b. “4 + 2 = 6.”
c. “x + y = 12.”
Q4: Give one real-life example of logic used in computer
programming.
Summary 31
Discrete Mathematics focuses on countable and distinct
structures.
Logic forms the foundation for all reasoning in computing.
Propositions have truth values – True (T) or False (F).
Understanding logic improves algorithm design, debugging,
and system modeling.
Every topic in this course links directly to real computer
science problems.
References 32
Primary Textbook:
Kenneth H. Rosen. Discrete Mathematics and Its
Applications, 7th Edition, McGraw-Hill Education, 2012.
ISBN: 978-0-07-338309-5
Additional References:
Ralph P. Grimaldi, Discrete and Combinatorial
Mathematics: An Applied Introduction, 5th Edition,
Pearson Education, 2004.
Susanna S. Epp, Discrete Mathematics with Applications,
5th Edition, Cengage Learning, 2020.
