Slide 1 – Title Slide
Slide Content: Discrete Mathematics, Lecture 01
Script:
“Good day everyone! Welcome to our first lecture in Discrete Structures. This subject, also known as
Discrete Mathematics, is foundational in computer science and mathematics. Throughout this course,
we will study mathematical ideas that deal with distinct, separate values rather than continuous ones,
which are common in calculus. Today, I’ll introduce you to the main topics we will cover and begin our
discussion on logic, which is the foundation of reasoning in mathematics and computing.”
Slide 3 – Main Topics
Slide Content: Logic, Sets, Relations, Functions, Sequences, Recurrence, Combinatorics, Probability,
Graphs, Trees.
Script:
“These are the ten main topics we’ll cover in this course. They build on each other:
We start with Logic, the foundation of reasoning.
Then Sets and their operations.
Relations and Functions are important in database theory and algorithms.
We’ll also study Sequences, Recurrence Relations, and Combinatorics, which are essential in analyzing
algorithms.
Then, we’ll discuss Probability, Graphs, and Trees, which are very useful in computer networks, data
structures, and AI.
All these will help you develop problem-solving skills that are crucial in computer science.”
Slide 4 – What is Discrete Mathematics?
Script:
“Discrete mathematics is the study of structures that are fundamentally separate or countable, not
continuous. Unlike real numbers that can take infinitely small values, discrete objects are distinct—like
integers, graphs, and logical statements. For example, the number of friends in a Facebook network is
discrete—it’s a count of whole individuals, not a continuous measure.”
Slide 5 – Example Problems
Script:
“Let me give you some problems to see how discrete math works.
Is it possible to visit three islands connected by six bridges without crossing the same bridge twice?
That’s a graph theory problem.
Or, what is the smallest number of telephone lines needed to connect 200 cities? That’s a combinatorial
and optimization problem.
Notice how these are different from continuous problems like finding the slope of a curve or optimizing
a function over real numbers.”
Slide 6 – Sequences
Script:
“Discrete mathematics often studies processes made of individual steps—like following an algorithm.
Each step is separate, not continuous. This makes it perfect for computer science, since computers
operate step by step in a discrete way.”
Slide 7 – Logic
Script:
“Our first major topic is Logic. Logic helps us distinguish between valid and invalid arguments. It gives us
tools to analyze whether a statement is true or false, and how combining statements affects their truth.
Logic is essential for programming, database queries, and algorithm design.”
Slide 8 – Statement
Script:
“A statement is a declarative sentence that is either true or false, but not both. For example:
The Earth is round → True.
5 is greater than 10 → False.
But questions or commands, such as ‘What time is it?’ or ‘Close the door’, are not statements.”
Slide 9 – Truth Values
Script:
“Every proposition, or statement, has a truth value. It is either true (T) or false (F). For instance:
‘2 + 2 = 4’ → True.
‘The sun rises in the west’ → False.”
Slide 10 – Not Propositions
Script:
“Examples of sentences that are not propositions include:
Questions: ‘Are you coming?’
Commands: ‘Stand up!’
Open sentences with variables: ‘x + 5 = 10’ (since it depends on the value of x).”
Slide 11 – Compound Statements
Script:
“Propositions can be combined to form compound statements using logical connectives. For example:
It is raining AND it is cold.
She will go to the party OR stay at home.”
Slide 12 – Symbolic Representation
Script:
“In logic, we represent simple statements with letters like p, q, or r.
p: It is raining.
q: It is cold.
Then we can write: p ∧ q → It is raining and it is cold.”
Slide 13 – Logical Connectives
Script:
“The basic logical connectives are:
Negation (~) – ‘not’.
Conjunction (∧) – ‘and’.
Disjunction (∨) – ‘or’.
Implication (→) – ‘if…then’.
Biconditional (↔) – ‘if and only if’.”
Slide 14 – Translating into Symbols
Script:
“When we translate English into symbolic logic:
‘It is raining and it is cold.’ → p ∧ q.
‘If it rains, then I will stay home.’ → p → q.
‘I will pass if and only if I study.’ → p ↔ q.”
Slide 15 – Negation (~)
Script:
“The negation of a proposition p is written as ~p and read as ‘not p’.
If p = ‘It is raining,’ then ~p = ‘It is not raining.’
The truth of ~p is always the opposite of p.”
Slide 16 – Truth Tables
Script:
“We use truth tables to show how the truth value of compound statements depends on the truth values
of their components. For example, for negation:
p ~p
T F
F T
Slide 17 – Conjunction (∧)
Script:
“A conjunction p ∧ q is true only if both p and q are true.
p q p∧q
T T T
T F F
F T F
F F F
Slide 18 – Disjunction (∨)
Script:
“A disjunction p ∨ q is true if at least one of p or q is true.
p q p∨q
T T T
T F T
F T T
F F F
Slide 19 – Summary
Script:
“To summarize:
A statement is either true or false.
We can combine statements with connectives.
Negation flips the truth value.
Conjunction requires both statements to be true.
Disjunction requires at least one to be true.
Next time, we will continue with more connectives and logical equivalence.”
