First of all, discrete mathematics mainly includes four aspects: logic set theory, algebraic structure and graph theory. It is rarely used to directly solve some practical problems, because it is a basic theoretical course for computer majors. What problems do you see?

Let me give you some examples:

1 data structure is a heavyweight course for computer majors, and graph theory in discrete mathematics is the theoretical basis of graphs and trees in data structure! ! Like some classical algorithms, it will learn in the data structure. In fact, they have studied it thoroughly in graph theory!

2。 Needless to say, relational database, its theoretical basis-relational algebra, is a branch of discrete mathematics! !

3。 In the principle of computer network, there are some routing algorithms, such as the shortest path algorithm, which are all applications of graph theory in discrete mathematics and are all classic algorithms! !

4。 Deeper disciplines, such as artificial intelligence, are based on discrete mathematics.

Therefore, discrete mathematics is a theoretical basis of computer.

As for the problem you solve in programming, it should be the application of data structure and algorithm, because this course is the theory of discrete mathematics, plus storage and operation on the computer ~ ~