M.S.P.M.

’s
Deogiri Institute of Engineering and Management
Studies, Aurangabad

Department of Computer Science

and Engineering

Work-Book
Of
Discrete
Mathematics

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Contents
❖ What is Discrete Maths?
❖ Why Discrete Mathematics?
❖ Objectives
❖ Importance of Subject

❖ Prerequisite to Higher class

subjects

❖ Real Time Applications

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde
 What is Discrete
Mathematics
Discrete Mathematics is a branch of
mathematics including discrete elements that
deploy algebra and arithmetic.

It is steadily being applied in the multiple

domains of mathematics and computer science.

It is accounted as a very effective approach for

developing and problem-solving strength.

Discrete Mathematics focuses on the systematic

study of Mathematical structures that are
essentially discrete in nature and does not
demand the belief of continuity.

Being also called as Decision Mathematics or

finite mathematics sometimes, it works with the
objects that can have distinct separate values.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

What is Discrete Mathematics

 Discrete Mathematics gives an individual the

ability to understand mathematical language that
can be learned through various branches of it.

 It is accounted as an excellent tool in order to

improve reasoning and problem-solving abilities.
Therefore, its importance has progressed
adequately in recent years with the growth of
digital devices.

 Combinations, graph theory and logical

statements are broadly involved as structures in
discrete mathematics along with finite or infinite
numbers.

 It is used in designing the daily used apps and

programs in computer science.
To Understand more about Discrete
Mathematics, Watch the Video:
https://youtu.be/q4L-wUF3yig
Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde
Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde
Why Discrete Mathematics?
● The mathematics of modern computer science is
built almost entirely on discrete math, in
particular combinatorics and graph theory.

● This means that in order to learn the

fundamental algorithms used by computer
programmers, students will need a solid
background in these subjects.

● Algebra is often taught as a series of formulas

and algorithms for students to memorize (for
example, the quadratic formula, solving systems
of linear equations by substitution, etc.), and
geometry is often taught as a series of definition
> theorem > proof exercises.

● By contrast, with discrete mathematics,

students will be thinking flexibly and creatively
right out of the box. There are relatively few
formulas to memorize; rather, there are a
number of fundamental concepts to be mastered
and applied in many different ways.
Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde
Objectives of Discrete Mathematics
Prerequisite to Higher class subjects

• Databases are built to process data in Set and

database is the relation defined over the
sets.
• One of the primary applications is database
query design and processing. All queries onto
RDBMS are in set notation and returned as
sets.

• Many algorithms work on sets. In machine

learning, you use a group of results to ‘train’
your model that you then attempt to use the
algorithm in the ‘real’ world.

• While inserting items in Data structure like

Stack, List, Queue, we require set of items.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Prerequisite to Higher class subjects

Principles of discrete mathematics are utilized in

many courses

• Computer Algorithms,
• Computer Architecture,
• Computer Systems,
• Databases,
• Distributed Systems,
• Functional Programing,
• Machine Learning,
• Networks,
• Computer Security,
• Operating Systems.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Importance of Discrete Mathematics
▪The problem-solving techniques honed in
discrete mathematics are necessary for writing
complicated software.

▪Students who are successful in discrete

mathematics will be able to generalize from a
single instance of a problem to an entire class
of problems, and to identify and abstract
patterns from data.

▪Finally, discrete mathematics and algorithms

constitute a lingua franca for computer
scientists and software developers.

▪ Since these concepts are both universal and

essential to the field, they are widely used to
communicate with peers, and form a major
component of many technical
Workbook on Discrete Mathematics
interviews.
Prepared By: Prof. Smita Ponde
Applications of Set Theory (Unit 1)

1. We can describe languages (e.g., compiler

grammar, a universal Turing machine) using
sets and set relations.

2. Graph traversal requires sets to track node

visits.
3. Data structures are inherently set-
based .

4. Relational databases are entirely premised on

set theory insofar as table operations are

concerned.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Applications of Proposition Logic (Unit 1)

• Propositional logic is a simple form of logic which

is also known as Boolean logic.

• It is the most basic and widely used logic. This

logic is used for the development of powerful
search algorithms including implementation
methods.

• Propositional logic is used in artificial intelligence

for planning, problem-solving, intelligent control
and most importantly for decision-making.

• It is a useful tool for reasoning, but it has

limitation because it cannot see inside
prepositions and take advantage of relationships
among them.
Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde
 Applications of Proposition Logic (Unit 1)

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Applications of Proposition Logic (Unit 1)

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Applications of Proposition Logic (Unit 1)

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Applications of Mathematical Induction (Unit 1)

Mathematical induction is a common and very powerful

proof technique

It is used in computer science to prove that an algorithm

works as intended (correctness) and that it runs in a
particular amount of time (complexity).

Nearly all areas of research in mathematics use induction.

Using induction, we can conclude infinitely many statements are

true just by checking two things.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Applications of Function (Unit 2)

Relations and Functions” are the most

important topics in Discrete Mathematics.

The relation shows the relationship between INPUT

and OUTPUT. Whereas a function is a relation which
derives one OUTPUT for each given INPUT.

Functions describe situations where one quantity

determines another.

For Example, the distance you travel when you go for a jog,
you can graph the function and make some assumptions
with only two points.

To learn more about FUNCTIONS Please Watch

Video:
https://youtu.be/52tpYl2tTqk
Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde
 Applications of Relations (Unit 2)

The relation shows the relationship between INPUT

and OUTPUT. Whereas, a function is a relation
which derives one OUTPUT for each given INPUT.

Relation between the two sets is defined as the

collection of the ordered pair, in which the ordered
pair is formed by the object from each set.
Example: {(-2, 1), (4, 3), (7, -3)}, usually
written in set notation form with curly
brackets.
Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde
Applications of Relations (Unit 2)

RELATIONS can be used in

● Communication networks,

● Cryptography

● Network Security

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Applications of combinatorics (Unit 2)

▪ Communication networks, cryptography and network

security Permutations are frequently used in
communication networks and parallel and distributed
systems

▪ Encryption process involves manipulations of

sequences of codes such as digits, characters, and
words. Hence, they are closely related to
combinatorics, possibly with intelligent encryption
process.
▪ For example, one common type of encryption
process is interchanging--i.e., permuting parts of a
sequence

▪ Permutations of fast Fourier transforms are

employed in speech encryption

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Applications of Recurrence Relations (Unit 2)

▪ In mathematics, a recurrence relation is an

equation that recursively defines a sequence, once
one or more initial terms are given: each further
term of the sequence is defined as a function of the
preceding terms.

▪ Recurrence relations are used to reduce

complicated problems to an iterative process
based on simpler versions of the problem.

▪ An example problem in which this approach can

be used is the Tower of Hanoi puzzle. The Tower
of Hanoi puzzle consists of three vertical pegs and
several disks of various sizes

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Applications of Graphs (Unit 3)

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Applications of Graph (Unit 3)

A graph is a flow structure that represents the

relationship between various objects.

It can be visualized by using the following two basic

components:

Nodes: These are the most important components in

any graph. Nodes are entities whose relationships are
expressed using edges. If a graph comprises 2 nodes
A : and B: and an undirected edge between them, then
it expresses a bi-directional relationship between the
nodes and edge.

Edges: Edges are the components that are used to

represent the relationships between various nodes in a
graph. An edge between two nodes expresses a one-
way or two-way relationship between the nodes.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Applications of Graph (Unit 3)

Graph theoretical ideas are highly utilized by computer

science applications. Especially in research areas of
computer science such

▪ data mining,
▪ image segmentation,
▪ clustering,
▪ image capturing,
▪ networking.

Graphs (sometimes referred to as networks) offer a

way of expressing relationships between pairs of
items, and are one of the most important abstractions
in computer science.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Applications of Graphs (unit 3)

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Applications of Graphs (unit 3)

1. Social Graphs
2. Facebook's Graph API
3. Google's Knowledge Graph
4. Recommendation Engines
5. Path Optimization Algorithms
6. Google Maps Platform (Maps,
Routes APIs)
7. Flight Networks
8. GPS Navigations Systems
9. Scientific Computations
Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde
 Applications of Graphs (Unit 3)

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Applications of Graphs (Unit 3)

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Applications of Graphs (Unit 3)

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Applications of Graphs (Unit 3)

Social graphs draw edges between you and the

people, places and things you interact with online .

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Applications of Trees (Unit 4)
A tree is often a connected undirected graph without
any simple circuits.

A tree is a finite set of one or more nodes such

that
- There is a specially designated node called root.
The remaining nodes are partitioned into n>=0
disjoint sets T1, T2, T3, …, Tn
where T1, T2, T3, …, Tn is called the subtrees
of the root.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Applications of Trees (Unit 4)

No. Graph Tree

Graph is a non-linear data

1 Tree is a non-linear data structure.
structure.

It is a collection of vertices/nodes
2 It is a collection of nodes and edges.
and edges.

General trees consist of the nodes having

Each node can have any number any number of child nodes. But in case of
3
of edges. binary trees every node can have at the
most two child nodes.

There is no unique node called

4 There is a unique node called root in trees.
root in graph.

5 A cycle can be formed. There will not be any cycle.

Applications: For finding shortest Applications: For game trees, decision

6
path in networking graph is used. trees, the tree is used.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Applications of Trees (Unit 4)

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Applications of Algebraic Structures (Unit 5)

Abstract algebra is a broad field of mathematics,

concerned with algebraic structures such as groups, rings,
vector spaces, and algebras.

Roughly speaking, abstract algebra is the study of what

happens when certain properties of number systems are
abstracted out; for instance, altering the definitions of the
basic arithmetic operations result in a structure known as a
ring, so long as the operations are consistent.

For example, the 12-hour clock is an example of such an

object, where the arithmetic operations are redefined to
use modular arithmetic (with modulus 12).
Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde
 Applications of Algebraic Structures (Unit 5)

Group theory, the ultimate theory for symmetry, is a

powerful tool that has a direct impact on research in
robotics, computer vision, computer graphics and medical
image analysis.

An algebraic structure can be used for Web Services. It

is used for characterising Web Service composition and
to determine inputs and outputs of Web Services

To Understand what is Abstract Algebra

Please Watch the following Video by clicking
on the Link:

https://youtu.be/IP7nW_hKB7I

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

Discrete Math in 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.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Discrete Math in 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.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Discrete Math in Logistics

Logistics is the study of organizing the flow of

information, goods and services. Without
discrete mathematics, logistics would not exist.
This is because logistics makes heavy use of
graphs and graph theory, a sub-field of discrete
math. Graph theory allows complex logistical
problems to simplify into graphs consisting of
nodes and lines. A mathematician can analyze
these graphs according to the methods of graph
theory to determine the best routes for shipping
or solving other logistical problems.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde

 Discrete Math in 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.

Workbook on Discrete Mathematics Prepared By: Prof. Smita Ponde