What is Discrete Mathematics:

Andy Hayes, Muhammad Rasel Parvej, Hua Zhi Vee

Is the study of mathematical structures that are countable or otherwise distinct

and separable. Examples of structures that are discrete are combinations, graphs,
and logical statements. Discrete structures can be finite or infinite. 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 is the branch of mathematics dealing with objects

that can assume only distinct, separated values.

What is the importance of discrete mathematics

to information technology?
Basically, discrete mathematics is the branch of mathematics that studies the
underlying principles which govern discrete structures and the binary universe. Such
principles are essential and effective in the implementation of algorithms, performance
analysis, and information management.

What is practical application of discrete mathematics

in information technology?

Concepts and notations from discrete mathematics are useful in studying and
describing objects and problems in branches of computer science, such as computer
algorithms, programming languages, cryptography, automated theorem proving, and
software development.

Is discrete math useful for programming?

Math is an important part of all programming. Discrete math can be used for
software design specifications, analysis of algorithms, and other practical applications,
but it’s really a great tool to develop as a programmer. Put simply, it’s a building block
for logical thinking.

10