Discrete Mathematics deals with discrete objects that can be counted and are not connected for e.g. houses, trees, desks, integers, etc. Discrete mathematics 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. It isn’t a branch of mathematics. It is rather a description of set of branches that have one common property – that they are “discrete” and not “continuous”.
Why Discrete Mathematics?
It develops your mathematical thinking and improves your problem solving ability.
It is important in subjects like: compiler design, databases, computer security, automata theory, operating system etc.
Many problems can be solved using discrete mathematics:
Sorting the list of integers.
Finding the shortest path from one place to other.
Encrypt a message and send it to the receiver so that only the receiver can read it.
Generating different combinations of password.