You are on page 1of 13

DISCRETE STRUCTURES

MAEEDA KHALID
INTRODUCTION

Types of Data

Quantitative Qualitative

Continuous Discrete
TYPES OF DATA

1. Continuous data
 that can be measured
 it can be infinite no. of possible value within a specified range.

2. Discrete Data
 countable data
 raw/discrete values
 numerical numbers (whole no.)
DISCRETE STRUCTURES

Definition
 It is not the branch of maths, like no. theory, algebra, calculus etc. Rather, it is
description of a set of branches of maths that all have in common feature that
they are discrete rather than continuous.
WHY IT IS IMPORTANT ?

 Computer is a binary machine and all algorithm in computer science is based on


binary digits, we therefore say CS is inherently discrete. It has applications in many
areas i.e. management science, network analysis, social decision making, finance etc.

 It helps to develop mathematical maturity which will help/essential in studying any


scientific discipline, also prerequisite to many advance CS courses, data structures,
theory of automata etc.
THE FOUNDATION: LOGIC, SET AND FUNCTIONS

Logic:
It is the study of principles and methods that distinguishes between a valid and invalid
argument/statement.
TYPES OF SENTENCE

1. Declarative
 statement/experience
e.g. 2 + 2= 4, This is an apple
2. Imperative
 commands
e.g. Eat the apple
3. Interrogative
 questions
e.g. Is this an apple?
THE FOUNDATION: LOGIC, SET AND FUNCTIONS

Statement/ Proposition:
It is a statement/declarative sentence that is either true or false but not both.

Examples:
1. Today is Friday [T/F]
2. Eat the apple Truth value of propositions
3. Washington is the capital of USA [T/F]
4. 2+2=6 [T/F]
PROPOSITIONAL LOGICS

Notation:
It can be denoted by any letter, say
p, q, r, s, t, ……
Example:
p: today is Friday
q: Washington is the capital of USA q is true

 The area of logic that deals with proposition is called Propositional logic
EXAMPLE

1. Elephants are bigger than cats


 Is this a Statement? Yes
 Is this a Proposition? Yes
 What is the Truth Value of proposition? True
PROPOSITIONAL LOGICS
Negation:
 It is the opposite to proposition
 Let p be the proposition. The negation of p, denoted by ~p(read as not p), is the
statement “it is not case that p”
Example: Truth table method to show
relationship between proportion
p: Today is Friday
p ~𝐩
~p: Today is not Friday
q: Washington is the capital of USA T F

~q: Washington is not the capital of USA F T


PRACTICE

1. What time it is? 3. If y = 1, then y > 5


 Statement: No  Statement: Yes

 Proposition: No  Proposition: Yes


 Truth value: False

2. Bill gates is an American. He is Rich


 Statement: Yes 4. 620 < 110
 Proposition: Yes  Statement: Yes
 Truth value: True  Proposition: Yes
 Truth value: False

Note: If the statement is preceded by another


statement that makes that pronoun or variable
reference clear, than the sentence is statement.
Thank You!

13

You might also like