This content originally appeared on DEV Community and was authored by Alex
This is a submission for DEV Computer Science Challenge v24.06.12: One Byte Explainer.
Explainer
Provides us with techniques for solving problems in Computer Science and allows us to study finite and enumerated sets, treating them as separate and independent objects. To achieve this, we use propositional logic to construct mathematical arguments.
Additional Context
Using discrete mathematics, we solve problems such as: ‘What is the fastest route for delivering an online order?’ Additionally, we apply this discipline to the construction of Artificial Intelligence (AI) algorithms and Databases using Graphs.
We can also perform algorithmic optimizations through Combinatorial Analysis. Logic, sets, and Boolean Algebra allow us to design optimized electronic circuits and more efficient distributed systems. These are just a few of the myriad possibilities of discrete mathematics.
In the academic context of Computer Science courses, we apply these concepts to the study of Data Structures, Algorithms, Databases, Compilers, Automata, and much more
I leave this book as a reference and recommendation: ‘Discrete Mathematics and Its Applications,’ by Kenneth H. Rosen, published by McGraw-Hill. In case you wish to delve deeper into the subject, I recommend reading this work."
This content originally appeared on DEV Community and was authored by Alex
Alex | Sciencx (2024-06-20T13:50:12+00:00) Computer Science Challenge: Discrete Math. Retrieved from https://www.scien.cx/2024/06/20/computer-science-challenge-discrete-math/
Please log in to upload a file.
There are no updates yet.
Click the Upload button above to add an update.