Discrete Mathematics -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.

In recent decades, discrete mathematics has become popular in computer science because studies and particularly notations in discrete math are useful to express objects or concepts in computer algorithms and programming languages.

Discrete mathematics usually cover

• logic - a study of reasoning,
• set theory - a group of objects,
• number theory,
• combinatorics,
• graph theory,
• algorithmics - an instruction of computations,
• information theory,
• the theory of computability and complexity,
• elementary probability theory and
• and linear algebra.

Prequisite:Calculus I