0% found this document useful (0 votes)
37 views16 pages

Lesson 01: The Building Blocks of Discrete Mathematics Mathe2 Discrete Mathematics

The document outlines the foundational concepts of Discrete Mathematics, emphasizing its importance in fields like computer science, algorithm design, and cryptography. It covers essential topics such as set theory, logic, functions, and graph theory, along with their applications in IT. Additionally, it provides practice problems related to logical propositions and their transformations.

Uploaded by

Efren Pongase
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
37 views16 pages

Lesson 01: The Building Blocks of Discrete Mathematics Mathe2 Discrete Mathematics

The document outlines the foundational concepts of Discrete Mathematics, emphasizing its importance in fields like computer science, algorithm design, and cryptography. It covers essential topics such as set theory, logic, functions, and graph theory, along with their applications in IT. Additionally, it provides practice problems related to logical propositions and their transformations.

Uploaded by

Efren Pongase
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

Lesson 01: The Building Blocks of Discrete Mathematics

MATH E 2
Discrete Mathematics

Rene L. Duhilag Jr. LPT. MS MATH (Units)


[email protected]

Department of Mathematics and Statistics,


Cebu Technological University,
MJ, Cuenco Street, Cebu City

February 24, 2025


Importance of Discrete Mathematics in IT:

Foundation of Computer Science: Theoretical backbone of programming,


algorithms, and data structures.
Algorithm Design and Analysis: Optimizes code using combinatorics and
graph theory.
Data Structures: Essential for understanding stacks, queues, trees, and graphs.
Cryptography and Security: Relies on number theory and combinatorics.
Database Management: Uses set theory and relational algebra.
Networking: Models networks through graph theory.
Software Development: Enhances logical reasoning and problem-solving skills.
AI and Machine Learning: Applies logic, probability, and combinatorial
optimization.

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 1 / 15
Basic Concepts and Terminology

Set Theory: Sets, subsets, union, intersection, difference.


Logic: Propositions, logical connectives, truth tables.
Functions: Mapping, injective, surjective, bijective functions.
Relations: Reflexive, symmetric, transitive properties.
Algorithms: Step-by-step problem-solving procedures.
Combinatorics: Counting principles, permutations, combinations.
Graph Theory: Graphs, types of graphs, applications in networking.
Boolean Algebra: Boolean variables, functions, digital circuit applications.

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 2 / 15
Set Theory

Set: A collection of distinct objects.


Subset: A set where all elements belong to another set.
Operations: Union (A ∪ B), Intersection (A ∩ B), Difference (A − B).

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 3 / 15
Logic

Proposition: A statement that is either true or false.


Logical Connectives: AND (∧), OR (∨), NOT (¬), IF-THEN (→), IFF (↔).
Truth Tables: Used to evaluate logical expressions.

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 4 / 15
Propositions:

Proposition - A proposition is a declarative statement that can be classified as either


true or false, but not both simultaneously.

Examples:
The sky is blue.
2 + 2 = 5.
Water boils at 100 degrees C at sea level.
I am hungry.
Is it raining?

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 5 / 15
Constructing Compound Propositions

A Compound Proposition is comprised of propositions and one or more of the fol-


lowing connectives:
negation ¬ “not”
(conjuction) ∧ “and”
(disjunction) ∨ “or”
(conditional) =⇒ “If, then”
(Biconditional) ⇐⇒ “If and only if” Each proposition is represented by a
propositional variable (p, q, r, s, ...).

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 6 / 15
Constructing Compound Proposition

The negation of the proposition p is ¬p (not p).

If p denotes “The grass is green”, then ¬p denotes “ It is not the case that the grass is
green”, or more simply, “.The grass is not green”.
My dog is the cutest dog.
The door is not open.
Are we there yet?
Truth Table for Negation (¬P):
P ¬P
T F
F T

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 7 / 15
Constructing Compound Proposition

Conjunction of proposition p and q is denoted p ∧ q and read as p“and”q for a con-


junction to be true, both propositions must be true.
Truth Table for Conjunction (P ∧ Q):

P Q P∧Q
T T T
T F F
F T F
F F F

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 8 / 15
Constructing Compound Proposition

The disjunction of propositions p and q is denoted by p ∨ q and read as p “or” q . For


a disjunctions to be true, either proposition must be true.
Truth Table for Disjunction (P ∨ Q):

P Q P∨Q
T T T
T F T
F T T
F F F

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 9 / 15
Constructing Compound Proposition

XOR is a logical operation that returns true if exactly one of the conditions is true, but
false if both conditions are the same (both true or both false).
Truth Table for Exclusive OR (XOR) (P ⊕ Q):

P Q P⊕Q
T T F
T F T
F T T
F F F

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 10 / 15
Constructing Compound Proposition

The Implication or Conditional Statement of proposition p and q is denoted p =⇒ q


and read “If p then q” or p implies q.”
When the hypothesis is true, the conclusion must be true for the implication to be true.
When the hypothesis is false, the conclusion is true.

Truth Table for Implication (P → Q)


P Q P→Q
T T T
T F F
F T T
F F T

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 11 / 15
Practice Problems:

Instructions: Translate the following sentences into logical symbols. Use p, q, and r as
your variables and define them clearly.

1 “If it rains, then I will bring an umbrella”.


2 “I will study hard, and pass the exam”.
3 “Either the coffee is hot or it is cold.”
4 “It is not raining”.
5 “If I wake up early, then I will eat breakfast and go to the gym”.
6 “I will not go to the party unless I finish my homework”.
7 “The square is blue and large if and only if it is a special square”.

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 12 / 15
Converse, Inverse, Contrapositive

From our implication, P → Q, we can construct 3 new conditional statements.


Converse q¬p switch the order.
Inverse ¬p→¬q negate
Contrapositive ¬q→¬p switch and negate.

Example:
It is raining is a sufficient condition for me not going to town.

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 13 / 15
Practice Problems:

Give the converse, inverse and contrapositive of implication.


1 If a number is even, then it is divisible by 2.
2 If it rains, then the ground is wet.
3 If a person is a doctor, then they have studied medicine.
4 If a shape is a square, then it has four sides.
5 If a student studies, then they pass the exam.

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 14 / 15
Constructing Compound Statement

The Biconditional Statement of proposition p and q is denoted p ⇐⇒ q and read as


“p if and only if q”.
For a biconditional statement to be true, both propositions must share the same truth
value.

Truth Table for Biconditional (P ↔ Q)


P Q P↔Q
T T T
T F F
F T F
F F T

Rene L. Duhilag Jr. (CTU,Main Campus) Chapter 01- The Building Blocks of Discrete Mathematics February 24, 2025 15 / 15

You might also like