Southeast University
Submitted by:
Niladdry Ghosh Niloy
Course:Discrete Mathematics (CSE 181.1)
ID: 2020000000035
Batch: 54th
Department of CSE
Southeast University
SUPERVISED by:
Ms. MAKSUDA Rabeya
LECTURER
SOUTHEAST University
Report About How do we relate
Discrete Mathematics with Computer
Science and Engineering
Discrete mathematics is used to include theoretical
computer science, which is relevant to computing.
Theoretical computer science draws heavily on logic
and graph theory. Using theoretical computer science,
we can easily compute mathematical results by
studying algorithms. In case of complexity, we will
study the time taken by computations. While in the
case of computability, we will study what can be
computed by following the principle. Computability is
closely related to both theories: formal language theory
and automata theory.We will model computer science
with the help of process algebras and Petri nets, and we
can also analyze the VLSI electronic circuits by using
discrete mathematics methods. In the case of
computational geometry, the algorithms will be applied
to solve geometrical problems. While in the case of
computer image analysis, the algorithms will be applied
to represent the images. We can also study topics of
continuous computation in theoretical computer
science.
Set Theory:
Set theory can be described as a branch of mathematics
in which we study sets. Sets contain the infinite set of
prime numbers or objects like green, orange, black, etc.
In several areas, we have various applications of sets
with other relations and partially ordered sets. In
discrete mathematics, our main focus will be on
countable sets (including finite sets).
Georg Cantor's work marks the beginning of set theory,
which is used to distinguish between various types of
infinite sets. The trigonometric series provide the
motivation to describe different types of infinite sets.
The development of infinite sets theory does not exist
inside the discrete mathematics scope.
Graph Theory:
Graph theory can be considered as a part of
combinatorics. In this, we will study about networks
and graphs, but it has grown distinct enough and large
enough with their problems, and it has its own right. In
discrete mathematics, graphs can be described as the
prime objects of study. The most ubiquitous models of
human-made and natural structure can be described by
the Graph. Different types of relationships can be
modeled by graphs. It is also able to process dynamics
in the social, biological, and physical systems.In
computer science, a lot of things are represented by
graphs that are computational devices, networks of
communication, the flow of computations, data
organization, etc. In mathematics, the graph can be
used in certain parts of topology, that is, knot theory
and in geometry. Graph theory and algebraic theory
both have a close link with each other. There is also
another option of continuous graphs. The domain of
discrete mathematics is going to contain most of the
research part of graph theory.
Trees:
A tree can be called an acyclic graph. A tree generally
contains the non-empty finite set of elements which is
known as nodes or vertices with the connected lines or
edges between the nodes. The tree does not
have multiple edges, simple circles, and loops. If we
want to find the possible outcome of any
experiment, the tree will be a good option to do
this. Each node contains some minimum and
maximum degrees. The minimum degree should be
1and the maximum degree can go upto n. The
starting symbol of a tree is known as the root, and
the root of a tree can't be null.
Discrete Probability Theory:
In countable sample events, a lot of events will
occur, and discrete probability theory is able to deal
with these types of events. For example, suppose we
are observing the number of birds in flocks for count
observation. In this case, it will comprise only
natural number values that are {0, 1, 2, 3}. In
contrast, suppose we are observing the weight
of birds for continuous observations. This case
will comprise real number values, and the
continuous probability distribution like normal will be
used to model it.
If we use discrete probability distribution, it will
approximate a continuous one and vice versa. Some
situations, such as experiments with cards decks or
throwing dice, are called highly constrained situations,
and in these situations, we will basically use
enumeration to calculate the probability of events.
