Scribd
Upload
6 views4 pages

DM Assignment

Discrete mathematics is fundamental to computer science and engineering, providing methods to model and solve real-world problems. It underpins algorithm development, time complexity analysis, networking through graph theory, and hardware design using Boolean algebra. Additionally, it plays a crucial role in artificial intelligence, software engineering, and understanding binary representation, making it essential for anyone in the field.

Uploaded by

munshijubair7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views4 pages

DM Assignment

Discrete mathematics is fundamental to computer science and engineering, providing methods to model and solve real-world problems. It underpins algorithm development, time complexity analysis, networking through graph theory, and hardware design using Boolean algebra. Additionally, it plays a crucial role in artificial intelligence, software engineering, and understanding binary representation, making it essential for anyone in the field.

Uploaded by

munshijubair7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment

Discrete Mathematics
Course Code: CSE 153

Topic: Describe about how do we relate Discrete Mathematics with


Computer Science and engineering.

Submitted To
Sabrina Sharmin
Assistant Professor, Department of Computer Science and Engineering
Jahangirnagar University

Submitted By
Student Name: Jubair Munshi
Student ID No: 331
Registration no: 20230657066
Course Title: Discrete Mathematics
Course Code: CSE-153
Submission Date: 25.11.2024
Description about how do we relate
Discrete Mathematics with Computer
Science and engineering.

Discrete mathematics is one of the most important foundation of


computer science and engineering, which provides the means to
model, resolve, and optimize real-world issues in an organized and
rational way. Because its ideas and methods are so ingrained in
computing theory and practice, it is essential for researchers and
professionals working in these fields.

Algorithms' Logical Foundations


The construction of algorithms, which are basically sequential
logical processes to solve problems, is at the heart of computer
science. Logical claims, mathematical proofs, and induction—all
of which are fundamental concepts in discrete mathematics—are
crucial to the creation of algorithms. These guidelines guarantee
algorithms' robustness and dependability, allowing them to operate
properly in a variety of settings.

Complexity of Time and Optimization


Analyzing an algorithm's effectiveness, particularly its temporal
complexity, is essential after it has been built. Discrete
mathematics offers the means to compute and optimize the runtime
of algorithms through the use of ideas such as recurrence relations,
matrices, and vectors. For improved performance, this aids
engineers in locating bottlenecks and improving solutions.

Networking and Graph Theory


The application of discrete mathematics is crucial in domains such
as networking and navigation. For instance, routing algorithms that
find the shortest way between nodes are designed using graph
theory to ensure speedier data transmission or the best routes in
programs like Google Maps. Complex networks can be efficiently
organized and traversed thanks to this basic idea.

Designing Hardware and Boolean Algebra


Boolean algebra provides the mathematical foundation for the
binary logic used by computers, which function in binary (0s and
1s). Boolean algebra helps engineers create dependable and
efficient systems, from the design of logic gates in hardware to the
creation of decision-making algorithms in software.

Artificial Intelligence and Probabilities


In the age of artificial intelligence (AI), discrete mathematics is
essential for using probability to model uncertainty. Probability is
essential to machine learning algorithms and decision-making
processes because it enables engineers to forecast results and create
systems that are capable of learning and adapting.

Software Engineering and Recursion


Recursion is the idea that some software engineering challenges
call for a function to call itself. Through the use of recurrence
relations, the mathematical study of recursion helps engineers
create effective code for challenging tasks like navigating graphs
and trees or putting dynamic programming concepts into practice.

Binary Numbers and Precision


It is essential for both software and hardware engineers to
comprehend how computers display numbers. To effectively
reflect continuous values in the actual world, binary representation
needs to be handled carefully due to its inherent precision
constraints. Separate Engineers can effectively handle these
difficulties by using mathematics to handle overflows or
approximations, for example.
In conclusion
In actuality, the foundation of computer science is discrete
mathematics. The core of computer science—logic development—
is lost if discrete mathematics is not studied. It gives your answers
logical clarity and provides a structured approach to problem
analysis.
Databases, network networks, computer organization, compilers,
network programming, and other areas of computer science are all
associated with discrete objects. It is the 'father subject' of
computer science, in my opinion, and everyone should study it.

You might also like