Discrete
Structures
Lecture 1
Muhammad Sohail Abbas
Today we will discuss
• Class Introduction
• Course Introduction
• Course Policies
• What is Discrete Structure?
• What is a Proposition or Statement?
About me
Muhammad Sohail Abbas
Lecturer (AI & DS)
BS Computer Science (UET Taxila)
MS Computer Science (NUST Islamabad)
Office: D-204-G
Email: [email protected]
Please Introduce
Yourself
Course Learning Materials
• Text-Book:
• Discrete Mathematics with applications
(5th edition) by Susanna S. Edd)
• Reference Books:
• Discrete Mathematics and its applications
by Kenneth H. Rosen
• Logic in computer science, Modelling and
Reasoning about Systems by M. Huth and
M. Rayan.
Teaching and Assessments
• Two Lectures a week (1 hr 20 min each)
• Quizzes >5 (10%)
• Assignments 4 (10%)
• Class Participation (5%)
• Sessionals 2 (30%)
• Final 1 (45%)
• All the martials and announcements will be shared on Google
classroom
• GCR Code: omce72dd
Course Polices
• Grading policy Absolute grading scheme
• Missed assessment items Retake of missed assessment items
(other than sessional/ final exam) will not be held
• For a missed sessional/ final exam, an exam retake application
along with necessary evidence are required to be submitted to
the academics
• The examination assessment and retake committee will decide
the exam retake cases
Be Honest
• Plagiarism/cheating in sessional or final exams may
result in F grade in the course
• Any kind of cheating or plagiarism in any
assignment/Quiz will result in zero marks in that project
or assignment category
“It is honorable to fail then cheat”
During Class
• Ask questions
• Never ever miss your class
• No attendance for late comers (Be aware attendance less than 80%
will debar you and not allow you for the final exam)
• Never use a mobile phone in class.
• Mobiles must be switched off at the start of a lecture and must be put
in pocket i.e., mobile should not be seen in anyone’s hand or on desk
• Never ever sleep during the lecture
Let’s Begin
Discrete Structures
• The study of mathematical structures and objects that
are fundamentally discrete (that can consider only
distinct and separated values) rather than continuous
• Examples of objects with discrete values are
• Integers, graphs or statements in logic
Discrete and Continues Values
• Discrete Values: Distinct or separate values which are countable and
typically involve integers or categories
• Examples: Number of people in a room
• The result of a die roll
• The number of cars in the car parking
• Continuous values: Continuous values can take on any value within a
range and can be measured with high precision
• Examples: The height of a person
• The temperature of a room
• The amount of liquid in a container
Logic
• Defines a formal language for representing knowledge
and for
making logical inferences
• It helps us to understand how to construct a valid argument
• Logic defines:
• Syntax of statements
• The meaning of statements
• The rules of logical inference (manipulation)
Proposition
• A simple proposition is a sentence that is true or false but
not both
• Examples1)Proposition: 7+3 = 10
• 2)Proposition: 1+5 = 3
• 3)It is Friday today.
• True and False values
• If a proposition is true, we say that it has a truth value of “True”.
• If a proposition is false, its truth value is “False".
• The truth values “True” and “False” are, respectively, denoted
by the letters T and F
Examples
• Propositions
• Sky is blue
• 5+1=6
• 5+4=7
• There are four fingers in a hand
• Propositional logic is the simplest form of logic. propositions
contain no variables they are either always true or always false.
• Examples:
• 2 + 2 = 4. (Always true).
• 2 + 2 = 5. (Always false).
Examples
Not propositions
• Close the door.
• x is greater than 2
• He is very rich
• Run quickly
• This algorithm is fast
• x + 2 = 4. (May be true, may not be true; it depends on the value of x.)
• x · 0 = 0. (Always true, but it’s still not a proposition because of the variable.)
• x · 0 = 1. (Always false, but not a proposition because of the variable.)
• As the last two examples show, it is not enough for a statement to be always true
or always false—whether a statement is a proposition or not is a structural property
• But if a statement doesn’t contain any variables (or other undefined terms), it is a
proposition, and as a side-effect of being a proposition it’s always true or always
false
Practice Sentence Statement
or
Proposition
Not
X+2 is Proposition
Not Proposition
positive
May I come Propositio
in n
Not Proposition
Today is
holiday Propositio
X+Y=12
n
-1>0
What are interpretations?
• An interpretation is a definition or meaning of each symbol
in a formula
• Interpretation in Propositional Logic (Definition)
• An interpretation in propositional logic is an assignment of T or F to
every prime proposition and a meaning assigned to each
connective
• Meaning:
• T means the given prime proposition is true in this interpretation
• F means the given prime proposition is false in this interpretation
Practice
• Write 10 Propositions and 10 Non-Propositions and
provide interpretations for them.
• Time: 10 minutes
Any Questions?
