CSE 1201

Discrete Mathematics
Lecture 1
Introduction , Course Overview
and Propositional Logic
Course Teachers:

Md. Moazzem Hossain, Assistant Professor, CSE

(BAUST)
Outlines

 Course Syllabus
 Reference Books
 Introduction
 Discrete vs Continuous
 Uses of Discrete Mathematics in
Computer Science
 Propositional Logic
Course Syllabus
CSE-1201 3.00 hours in a week,
3.00 Cr.
Discrete Mathematics
 Mathematical Logic: propositional calculus and predicate
calculus
 Set theory: sets, relations, partial ordered sets, functions
 Mathematical reasoning and proof techniques
 Counting: permutations, combinations, principles of
inclusion and exclusion
 Discrete Probability
 Recurrence relations and recursive algorithms
 Growth of functions
 Graph theory: graphs, paths, trees, cycles
 Algebraic structures: rings and groups
Reference Books

 Discrete Mathematics & Its

Applications- Kenneth H Rosen
 Discrete Mathematics with
Applications (Elsevier, 2004) -
Thomas Koshy.
What is Mathematics, really?

 It’s not just about numbers!

 Mathematics is much more than
Mathematics is, most generally,
that:
the study of any and all
absolutely certain truths about
any and all perfectly well-defined
concepts.
 These concepts can be about
numbers, symbols, objects, images,
sounds, anything!
So, what’s this class
about?
 What are “discrete structures” anyway?
 “Discrete” -Composed of distinct,
separable parts. (Opposite of continuous.)
discrete : continuous :: digital : analog
 “Structures”-Objects built up from
simpler objects according to some
definite pattern.
 “Discrete Mathematics” -The study of
discrete, mathematical (i.e. well-defined
conceptual) objects and structures.
Why Study Discrete
Math?
 The basis of all of digital information
processing is: Discrete manipulations
of discrete structures represented in
memory.
 It’s the basic language and
conceptual foundation for all of
computer science.
 Discrete math concepts are also
widely used throughout math,
science, engineering, economics,
Discrete vs Continuous
 Examples of discrete Data
– Number of boys in the class.
– Number of candies in a packet.
– Number of suitcases lost by an airline.

 Examples of continuous Data

– Height of a person.
– Time in a race.
– Distance traveled by a car.
Discrete Mathematics

 Discretemathematics is the part of

mathematics devoted to the study of
discrete objects (Kenneth H. Rosen,
6th edition).

 Discrete
mathematics is the study of
mathematical structures that are
fundamentally discrete rather than
continuous (wikipedia).
Uses for Discrete Math in Computer Science

 Advanced algorithms & data structures

 Programming language compilers &
interpreters
 Computer networks
 Operating systems
 Computer architecture
 Database management systems
 Cryptography
 Error correction codes
 Graphics & animation algorithms, game
engines, etc....
 i.e., the whole field!
Propositional Logic

Proposition:
A proposition is a declarative sentence
(that is, a sentence that declares a fact)
that is either true or false, but not both.
Example
• Washington, D.C., is the capital of the United States of
America
• Dhaka is the capital of Bangladesh
• Dhaka is the capital of India
• 8 + 2 = 10
• 4 + 4 = 10
Proposition or Not?

• What time is it?

• Read this carefully
• a + 2 = 10
• x+y =z

12
Propositional Variable
Definition
variables that represent propositions, just as
letters are used to denote numerical variables.

The conventional letters used for propositional

variables are p, q, r, s, ... .

Example :
p = Dhaka is the capital of Bangladesh.

13
Some common terms
The truth value
The truth value of a proposition is true, denoted
by T, if it is a true proposition, and the truth value
of a proposition is false, denoted by F, if it is a
false proposition.

p = Dhaka is the capital of Truth value : T

Bangladesh.
p = Dhaka is the capital of Truth value : F
Pakistan.

14
Some common terms
Propositional Calculus or Propositional Logic.
The area of logic that deals with propositions is
called the propositional calculus or propositional
logic.

Compound Propositions
New propositions formed from existing
propositions using logical operators are called
compound propositions.

15
Introduction to Logical
Operators
• About a dozen logical operators
• Similar to algebraic operators
+*-/

Basic Operators

1. Negation (NOT)

2. Conjunction (AND)

3. Disjunction (OR)

16
Logical operators: Not
Definition
A “not” operation switches (negates) the truth
value.
Symbol:  or ~

Truth table
• If
P p
• ?
T F
F T

17
Logical operators: And
Definition
An “and” operation is true if both operands are
true.
Symbol: 
p = “Today is Friday” p q pq
q = “Today is my birthday” T T T
pq = ? T F F

pq = “Today is Friday and today is F T F

my birthday” F F F

18
Logical operators: Or
Definition
An “or” operation is true if either operands or both are true.

Symbol: 

p q pq
p = “Today is Friday”
T T T
q = “Today is my birthday”
pq=? T F T
p  q = “Today is Friday or today is my
birthday” F T T

F F F

19
More Logical Operators

More Operators

1. Exclusive OR

2. Conditional

3. Bicondition

20
Logical operators: Exclusive Or

Definition

Let p and q be propositions. The exclusive or of p

and q, denoted by p⊕q, is the proposition that is
true when exactly one of p and q is true and is
false otherwise.
• Symbol:  p q pq
• Often called XOR
T T F
• pq  (p  q)  ¬(p  q)
T F T
pq = “Today is Friday or today is my F T T
birthday, but not both”
F F F

21
Logical operators: Conditional

Definition
Let p and q be propositions. The conditional
statement p→q is the proposition “if p, then q.” The
conditional statement p→q is false when p is true
and q is false, and true otherwise.
pq = “If today is Friday, then today is my • p implies q
birthday” • If p, q
• In the conditional statement p→q, • p only if q
• p is called the hypothesis (or antecedent or • p is sufficient for
premise) q
• q if p
• q is called the conclusion (or consequence)
• q whenever p
• q is necessary for
p

22
Logical operators: Conditional
 p → q = ¬p q p q pq

T T T
the the
antecedentconsequence T F F
I will
F T T do
Let, p = “Maria learns discrete mathematics” only
for
and F F T myself
q = “Maria will find a good job.”
Express the statement p→q as a statement in
English.
If I am
elected,
then I will
lower taxes.
Logical operators: Bi-
Conditional
Definition
Let p and q be propositions. The biconditional statement
p↔q is the proposition “p if and only if q.” The biconditional
statement p↔q is true when p and q have the same truth
values, and is false otherwise.

Biconditional statements are also called bi-implications.

• “p is necessary and sufficient for

q”
• “if p then q, and conversely”
• “p iff q.”

24
Logical operators: Bi-
Conditional
 True when both has same truth values and otherwise false.
• Alternatively, it means “(if p then q)
and (if q then p)” (p→q)∧(q→p). p q pq
• Note that a bi-conditional has the T T T
opposite truth values of the exclusive
or T F F
• Let p = “You take this class” and q = “You F T F
get a grade”
• p q = “You take this class if and only if F F T
you get a grade”
• Alternatively, it means “If you take this
class, then you get a grade and if you get
a grade then you take (took) this class”
END
Stay Home
Stay Safe