DISCRETE STRUCTURES

Lecture # 1
Introduction

Summiya Alam
 POLICIES

• Attendance will be marked during first or last 15 minutes of class

• Ensure your presence
• 75% attendance is mandatory
• Deficient students will not be allowed to appear in the final examination
• If you miss the Quiz, you Miss it!
• If you’re one day late for assignment submission, your assignment would not
be considered
 SOME CLASS RULES

• Raise your hand before asking any question and then WAIT for the permission
• Never ever miss a class
• Never ever “sleep” in the class
• Never use mobile phones in the class
• Attendance requirements must be fulfilled. No relaxation in this regard will be given
under any conditions.
• There will be unannounced quizzes.
• Discipline should be maintained during the lecture.
• Above all, whatever you do, please do not disturb others
 DISHONESTY, PLAGIARISM

All parties involved in any kind of cheating in any exam (Quizzes, Assignments
& Projects) will get their respective test cancelled right away.
 COURSE CONTENT

• Logic
• Sets & Operations on sets
• Relations & Their Properties
• Functions
• Sequences & Series
• Recurrence Relations
• Mathematical Induction
• Loop Invariants
 COURSE CONTENT

• Loop Invariants
• Combinatorial logics
• Probability
• Graphs and Trees
 REFERENCE MATERIAL

Recommended Books
• Discrete Mathematics and its applications by Kenneth H Rosen
• Shaum’s outline of theory and problems of Discrete Mathematics
• Discrete Mathematics with Applications (second edition) by Susanna
S. Epp
 TODAY’S GOAL

• Introduction to discrete structures

• Logic
• Statements or Proposition
• Non proposition
 INTRODUCTION

What does discrete mean?

• separate and distinct; not attached to others; unrelated
• made up of distinct parts; discontinuous

Example
DISCRETE VS CONTINUOUS

Data

Numerical Descriptive

Discrete Continuous
 DISCRETE VS CONTINUOUS

• Discrete data is counted while continuous data is measured

• Discrete Data can only take certain values and Continuous Data can take any
value (within given range)

• Examples
DISCRETE VS CONTINUOUS
 DISCRETE STRUCTURES IN COMPUTER
SCIENCE

• It has relevance with computer science field.

• Computer understands binary machine based on binary digit 0, 1.
• As a student in computer science, you need to know the basic language and
conceptual foundation for all of the computer science
• Discrete structure concepts are widely used throughout math, science,
engineering, economics, biology, etc.,…
 DISCRETE STRUCTURES IN COMPUTER
SCIENCE

• Networking
• Advanced Algorithms & Database
• Image processing
• Data Structures
• Graphics & Animation Language
• Compilers & Interpreters
• Software Engineering
 DISCRETE STRUCTURES IN COMPUTER
SCIENCE

• Artificial Intelligence
• Computer Architecture
• Operating systems
• Security & Cryptography
 LOGIC

• The first book on logic was written by the Greek Philosopher Aristotle (384
BC).
• In seventeen century, the German Philosopher and Mathematician Gottfried
Leibniz conceived the idea of using symbols to mechanize the process of
reasoning in much the same way that algebraic notation had mechanized the
process of reasoning about numbers and their relationships.
 LOGIC

• “Logic" came from the Greek word logos, which is sometimes translated as

"sentence", "reason", "rule“.
• The study of the principles of correct reasoning
• Logic is the study of the principles and methods that distinguish between a
valid and an invalid argument
• The study of methods and rules that distinguish between a good(correct) and a
bad(incorrect)
 BASIC TERMS OF LOGIC

• Statement
• A statement is a declarative sentence that is either true or false but not both
• Also called proposition
• Some examples are;
• 2+2 = 4 ……………………………… (1)
• It is Sunday today ………………… (2)
 BASIC TERMS OF LOGIC

• First statement is true and second one is false..

• 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".
 EXAMPLES

Statements
• Grass is green
• 4+2=6
• 4+2=7
• There are four fingers in a hand
 EXAMPLES

• All statements are declarative

• We know about their truth value
• Truth value for statement 1 & 2 is T
• Truth value for statement 3 & 4 is F
 EXAMPLE OF NON-SENTENCES

• Close the door

• Non proposition because it is not declarative
• X is greater than 2
• We cannot say about its truth value
• For some truth values of x it is true and for others it is false
• He is very rich
• Although it is declarative but we cannot say about its truth value
• We don’t know about pronoun
 UNDERSTANDING STATEMENTS

• x + 2 is positive.
• Not a statement
• May I come in?
• Not a statement
• Logic is interesting.
• Not a statement
• It is hot today.
• A statement
 UNDERSTANDING STATEMENTS

• -1 > 0
• A statement
• x + y = 12
• Not a statement
THANK YOU