Discrete mathematics, sometimes called finite mathematics, is the study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the notion of continuity. Most, if not all, of the objects studied in finite mathematics are countable sets, such as the integers.
Discrete mathematics has become popular in recent decades due to its applications to computer science. Concepts and notations from discrete mathematics are useful to study or express objects or problems in computer algorithms and programming languages.
For contrast, see continuum, topology, and mathematical analysis.
Discrete mathematics usually cover
Some applications: Game theory  Queuing theory  Graph theory  combinatorial geometry[?] and topology[?]  Linear programming  cryptography (including cryptology and cryptanalysis)  theory of computation
Search Encyclopedia

Featured Article
