The calculus sequence taught in this subject dealt with real-valued functions very well. Since the real numbers are continuous, this mostly left areas of math that dealt with discrete as opposed to continuous sets of values. For example, logic deals with two values, true (1) and false (0). Number theory deals with integers. Here are some topics covered in Discrete Structure and how it is important to me as a computer science student ;
1) Set theory. This is given that we mostly think of a set as an unsorted collection of unique objects. One fun and important topic in set theory is that some infinite sets are bigger than others. So, it cultivate my logical thinking to sort the elements in the set.
3) Combinations and Relations. This chapter explains about the natural ways to associate objects of various set. This topic also covers relations, digraphs, matrices of relation.
4) Recurrence relations and recursion. Recursion is a fascinating topic, and its importance in mathematics cannot be overstated. a recurrence relation is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are given.
5) Graph Theory. So many aspects of real life can be modeled with graphs that graph theory explains. graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges
6) Tree theory. A tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected a cyclic undirected graph.
In many ways Discrete Mathematics contains essentials almost every aspect of Computer Science.