0% found this document useful (0 votes)
15 views26 pages

Lecture No. 1

Uploaded by

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

Lecture No. 1

Uploaded by

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

DISCRETE STRUCTURES

1
Why Study Discrete
Target Audience Structures?
• Students who are preparing  Develop mathematical thinking.
for GATE and Other Exams. 
Improves problem solving ability.
• Competitive Programming  Built the ability to solve the problems,
for Computer Science as listed below:
Students.

• Important subject for CS • Sorting the list of integers.


students.
• Finding the shortest pat from your
• Pre-requisite for the rest of home to your friends home.
the CS subjects during the
upcoming semesters i.e. • Encrypt a message.
Compiler Design, Data • Drawing a graph with two conditions:
base, Computer Security,
Operating system, and 1. Not allowed to lift your pen.
Theory of Automata etc.
2. Not allowed to repeat the edges.

Spring 2024 Discrete Structures 2


Discrete Structure
Discrete Structure is the study of
‘discrete objects’.
Whereas:
Discrete Means: “ Distinct”
OR
Not
Connected
Spring 2024 Discrete Structures 3
Discrete vs Continuous

4
Discrete Structures
• is the study of mathematical structures that are
fundamentally discrete rather than continuous.
• In contrast to real numbers that have the property
of varying "smoothly",
• the objects studied in discrete mathematics – such
as integers, graphs, and statements in logic.s
• discrete structures are abstract mathematical
structures used
• to represent discrete objects and relationships between
these objects.
• The discrete objects include
• sets, relations, permutations and graphs.

5
Discrete Structures
• Applications
• computer algorithms,
• programming languages,
• cryptography,
• automated theorem proving,
• and software development

6
Covered Areas
1. Logic
2. Sets & Operations on sets
3. Relations & Their Properties
4. Functions
5. Sequences & Series
6. Recurrence Relations
7. Mathematical Induction
8. Loop Invariants
9. Combinatorics
10. Probability
11. Graphs and Trees
Discrete Structures 7
What is Discrete
Structures?

Discrete Structures?
– concerns processes
• that consist of a sequence of individual
steps.

Discrete Structures 8
SIMPLE STATEMENT

A statement is a declarative
sentence
– that is either true or false but not
both.

A statement is also referred to


as a proposition

9
Example:

10
Not Propositions

Spring 2024 Discrete Structures 11


LOGIC
Logic is the study of the
principles and methods
– that distinguishes between a valid
and an invalid argument.

Spring 2024 Discrete Structures 12


Logic
• Crucial for mathematical reasoning
• Important for program design
• Used for designing electronic circuitry

• (Propositional) Logic is a system based on


propositions.
• A proposition is a (declarative) statement
that is either true or false (not both).
• We say that the truth value of a
proposition is either true (T) or false (F).
• Corresponds to 1 and 0 in digital circuits
Spring 2024 Discrete Structures 13
The Statement/Proposition
Game
“520 < 111”

Is this a statement? yes

Is this a proposition? yes

What is the truth value


of the proposition? false

Spring 2024 Discrete Structures 14


The Statement/Proposition
Game
“y > 5”

Is this a statement? yes


Is this a proposition? no

Its truth value depends on the value of y,


but this value is not specified.
We call this type of statement a
propositional function or open sentence.
Spring 2024 Discrete Structures 15
The Statement/Proposition
Game
“Today is January 27 and 99 < 5.”

Is this a statement? yes

Is this a proposition? yes

What is the truth value


of the proposition? false

Spring 2024 Discrete Structures 16


The Statement/Proposition
Game
“Please do not fall asleep.”

Is this a statement? no
It’s a request.

Is this a proposition? no

Only statements can be propositions.

Spring 2024 Discrete Structures 17


The Statement/Proposition
Game
“If the moon is made of cheese,
then I will be rich.”

Is this a statement? yes

Is this a proposition? yes

What is the truth value


of the proposition? probably true

Spring 2024 Discrete Structures 18


The Statement/Proposition
Game
“x < y if and only if y > x.”
Is this a statement? yes
Is this a proposition? yes
… because its truth value
does not depend on
specific values of x and y.

What is the truth value


of the proposition? true
Spring 2024 Discrete Structures 19
LOGIC

20
Propositional Logic

21
Propositional Logic

22
Propositional Logic

23
Propositional Logic

24
Combining Propositions

As we have seen in the previous


examples, one or more propositions can
be combined to form a single compound
proposition.

We formalize this by denoting


propositions with letters such as p, q, r,
s, and introducing several logical
operators or logical connectives.
Spring 2024 Discrete Structures 25
Logical Operators
(Connectives)
We will examine the following logical operators:
• Negation (NOT, )
• Conjunction (AND, )
• Disjunction (OR, )
• Exclusive-or (XOR,  )
• Implication (if – then,  )
• Biconditional (if and only if,  )
Truth tables can be used to show how these operators
can combine propositions to compound propositions.

Spring 2024 Discrete Structures 26

You might also like