Discrete Mathematics

From Coder Merlin
Revision as of 13:05, 8 January 2023 by Kazi-rahman (talk | contribs) (Discrete Mathematics Introduction added)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Within these castle walls be forged Mavens of Computer Science ...
— Merlin, The Coder

Introduction[edit]

Discrete Mathematics is a branch of mathematics that is concerned with “discrete” mathematical structures. It provides an essential foundation for virtually every area of computer science and its applications are vast. It is increasingly being applied in the practical fields of mathematics and computer science. Discrete mathematics is in contrast to continuous mathematics, which deals with structures which can range in value over the real numbers, or have some non-separable quality. Discrete Mathematics concerns itself mainly with finite collections of discrete objects. With the growth of digital devices, especially computers, discrete mathematics has become more and more important. Discrete mathematics is the mathematical language of computer science, and as such, its importance has increased dramatically in recent decades.

Topics covered in discrete mathematics related to computer science:[edit]

  • Set Theory
  • Graph Theory
  • Mathematical Induction
  • Boolean Algebra
  • Probability Theory
  • Group theory