Introduction

Syeda Komal Fatima

Lecturer
Bahria University Karachi Campus
Syedakomal.bukc@bahria.edu.pk
 Three Lectures per week: Each lecture requires
reading course book (and an optional reading of reference
books)
 4 Quizzes (10 Marks)
 4 Assignments (20
Marks)
 Mid Term (20 Marks)
 Exams
 Final (50 Marks)
Term
 Discrete Mathematics and Its Applications, 7th
Ed. by Kenneth H. Rosen
 Discrete Mathematics with Application , 4th Ed.
by Susanna Epp
 Discrete Mathematics, 6th Ed. Richard
Johnsonbaugh
Coursematerial will be posted on the
Google Site:

https://sites.google.com/view/skomalfatim
a
 Copyingsomeone else’s work (partial or
complete) and submitting it as if it were
one’s own

 Zero tolerance for plagiarism

 7 5 % attendance is mandatory.
You have to come in the class within the first
10 minutes in order to get marked as
 present
Counseling hours: Wednesday 1:00pm –
3:00pm
 THINK
MATHEMATICA
LLY
THIS COURSE WILL LET YOU THINK LOGICALLY & MATHEMATICALLY
 Discrete mathematics deals
with objects that come in
discrete bundles, e.g., 1 or 2
books
 Continuous mathematics deals with
objects that vary continuously, e.g., 3.42
inches from a wall.
 Think of digital watches versus analog
watches (ones where the second hand
Cryptography The field of cryptography, which is the
study of how to create security structures and passwords for
computers and other electronic systems, is based entirely on
discrete mathematics. This is partly because computers send
information in discrete -- or separate and distinct -- bits.
Number theory, one important part of discrete math, allows
cryptographers to create and break numerical passwords.
Because of the quantity of money and the amount of
confidential information involved, cryptographers must first
have a solid background in number theory to show they can
provide secure passwords and encryption methods.
Relational Databases Relational databases play a part in
almost every organization that must keep track of employees, clients
or resources. A relational database connects the traits of a certain
piece of information. For example, in a database containing client
information, the relational aspect of this database allows the
computer system to know how to link the client’s name, address,
phone number and other pertinent information. This is all done
through the discrete math concept of sets. Sets allow information to
be grouped and put in order. Since each piece of information and
each trait belonging to that piece of information is discrete, the
organization of such information in a database requires discrete
mathematical methods.
Computer Algorithms Algorithms are the rules by which
a computer operates. These rules are created through the laws of
discrete mathematics. A computer programmer uses discrete
math to design efficient algorithms. This design includes applying
discrete math to determine the number of steps an algorithm
needs to complete, which implies the speed of the algorithm.
Because of discrete mathematical applications in algorithms,
today’s computers run faster than ever before.
 Image Processing Image processing is a method to
convert an image into digital form and perform some
operations on it, in order to get an enhanced image or to
extract some useful information from it. It convert image as
two dimensional signals
 Graph Theory Google Maps uses discrete mathematics to
determine fastest driving routes and times. There is a simpler
version that works with small maps and technicalities involved
in adapting to large maps.
• Used in Data Mining and Networking as well.