An introduction to discrete mathematics in computer science Pdf

Discrete mathematics deals with the theory of objects that can be counted. Discrete objects exist and their properties are measured: discrete variables occur in expressions that involve counting; the rules for manipulating them involve only addition, subtraction and (sometimes) multiplication. The methods of discrete mathematics are useful in computer science, and cryptography. For example, one can use the fact that a large integer factorizes as a product of small prime numbers to develop algorithms that are faster than naive methods for primality testing. This article is a brief introduction to discrete mathematics. It only introduces the topics which have close links to computer science, in particular number theory.

Discrete Mathematics The study of discrete mathematical structures is as important to computer science as calculus is to chemistry or geometry is to art. Discrete Mathematics deals with the study of mathematical structures that have a certain finite number of objects or elements but infinite possible states and relationships among them. In pure mathematics, discrete mathematics is used to formulate and study questions whose answers are always finite. In computer science, discretization is mostly about the development of algorithms and their analysis for processing discrete structures, such as integer data types (as opposed to floating point numbers). In artificial intelligence, discrete mathematics is essential to the understanding of logic-based reasoning methods used for planning and problem solving.

 

importance of discrete mathematics in computer science pdf

discrete mathematics and its applications in computer science pdf

application of discrete mathematics in computer science pdf