Discrete Mathematics

Lt Col Muhammad Saleem(Retd)

Military College of Signals
National University of Sciences and Technology, Pakistan
Fall, 2015

saleem@mcs.edu.pk

Agenda
Course Details
Objectives
Grading Policy

Introduction to Discrete Math

Credit hrs
3+0
Contact hrs
7+0
(Incl 1xSTI)
Pre Requisites Nil

Resources
Lecture Slides will be available on LMS
Quizzes and Assignments will be loaded on LMS.
Additional references shall be provided (if any)

Text Book
Discrete Mathematics with Applications (Min Third Edition) by
Susanna S. Epp. The Latest edition aval in market
Reference
Discrete Mathematics and Its Applications (fourth edition) by

Kenneth H. Rosen
Discrete Mathematics by Ross and Wright

Grading Policy
Assignments
(3-5)
Quizzes
(3-5)
OHT-1
15%
OHT-2
15%
End-term

10%
10%

50%

Assignments
Quizzes
Mostly unannounced
Occasionally

announced

Point System - every activity in the class gives you a

certain number of points
4

Assignment Policies
No late work will be accepted
(Unless arrangements have been made in
advance
By the C/Snr)

Policies Attendance
Deficiency in attendance may lead to

termination or relegation or F-Grade

No re-take of quizzes in any case except

that the leave is officially approved by
department

Policies
Course Senior:
Make list of e-mails of all students

It is preferred to contact in office

hours.
I reserve the right to be more lenient

Course Objectives
Preparation for the mathematical aspects of

other computer science courses

Learn the basic results in logic, Relations, Set,

Trees
and graph theory.
Cultivate a sense of familiarity and ease in

working with mathematical notation and

common concepts in discrete mathematics.
8

What is Discrete Mathematics?

:

Discrete Mathematics concerns processes that

consist of a sequence of individual steps.

Topics in Discrete
Math
Sets and Logic (Useful in digital circuits & hardware

design)
Relations (Relational DBs)
Graphs Theory (describe problems in Data bases,
Operating Systems and Networks)
Trees (Data structure)
Number Theory (use in crypto-systems)
Recursion (Breaking down the problems)
Complexity Theory (Numerical solution of differential
eqns)
Functions (Mathematical modelling)
Counting and Probability (Coding theory)
10

Course outline

Logic:

logical
form,
logical
Equivalance, Conditional statements.
Valid&Invalid
arguments, Predicate
and quantifiers
Relations: Relation properties, n-ary
relations and Applications , Closures of
Relations and equivalence relation.
Graphs:
Introduction to Graphs,
isomorphism, Connectivity, Euler and
Hamilton Paths, Shortest
Path
Problems, planner Graphs and coloring
Trees: Introduction and Applications,
Tree traversal, sorting

Hints for success

Read the textbook.
Lectures really do help!
Set up study groups and
attend sections.
Do the homework

Analog vs Digital
Analog means continuous
Analog parameters have continuous range of

values
Example: Temperature is an analog parameter
Temperature increases/decreases continuously
Kettle removed from stove

temperature

100oC

time

13

Analog vs Digital

Analog

Digital

14

Analog vs Digital
Digital signals are non-continuous i.e. discrete
Consist of fixed set of digits. E.g. number of

months in a year = 12; digits = {1,2,3,

.,10,11,12} note that 11.3 or 4.9 are invalid
here
12
9

10

11

8 from one digit to

Abrupt transition (jumping)
7
6
4

Value

another
2
1

Jan

Feb

Mar

Apr

May

Jun

Jul

Aug

Sep

Oct

Nov

Dec

15

Propositional Logic
When we talk about Philosophy &
Logic the first name that comes into
our mind is that of Aristotle (384 BC322
BC)
who
followed
a
comprehensive system of ideas about
human nature and the nature of the
reality we live in.

Logic , is concerned with method of reasoning. Aristotle,

the 1st who studied logical reasoning, logic provides the
basis for many areas of CS (DLD , Al and Automata theory )

Propositional Logic
Whats a proposition?
A proposition is a declarative statement thats either TRUE
or FALSE (but not both).

Propositions

10/22/15

Not Propositions

3 + 2 = 32

Bring me coffee!

DM is Aysha favorite
class.

CS173 is her favorite

class.

Every cat has 4 legs.

3+2

There is other life in the

universe.

Do you like Cake?

Propositional Logic

Terminologies
Inductive Logic
Deductive Logic
Axioms
Postulates
Primitive proposition
Argument
Sentence
Statement
Compound statement

Symbolic Logical /Connectors

AND
v
OR
^
NOT
-Implies

Equivalent to

Precedence for Logical

Connectors
Negation has precedence over AND
&OR
a. Inner bracket
b. Negation
c. Conjunction
d. Disjunction
(c&d are at equal
level)
e. implication

Analysis of complex statement

Constructing Truth Table
a. Number of Rows
b. Number of Colum's