Discrete mathematics is a mathematical discipline that studies the structure and relationship of discrete quantities and an important branch of modern mathematics. The meaning of discreteness refers to different connecting elements. The structure based on discreteness and the relationship between them are mainly studied, and its objects are generally finite or countable elements. Discrete mathematics is widely used in various disciplines, especially in the field of computer science and technology. At the same time, discrete mathematics is also a necessary prerequisite for many professional courses of computer specialty, such as programming language, data structure, operating system, compilation technology, artificial intelligence, database, algorithm design and analysis, theoretical computer science foundation and so on. Through the study of discrete mathematics, we can not only master the descriptive tools and methods for dealing with discrete structures, but also create conditions for subsequent courses, improve abstract thinking and strict logical reasoning ability, and lay a solid foundation for participating in innovative research and development in the future.

Subject content

1. set theory: sets and their operations, binary relations and functions, natural numbers and natural number set, cardinality of sets.

2. Graph theory: basic concepts of graphs, Euler graphs and hamiltonian graph, matrix representation of trees and graphs, planar graphs, graph coloring, dominating sets, covering sets, independent sets and matching, weighted graphs and their applications.

3. Algebraic structure: the basic concepts of algebraic system, semigroup and singularity, group, ring and field, lattice and Boolean algebra.

4. Combinatorial mathematics: combinatorial existence theorem, basic counting formula, combinatorial counting method and combinatorial counting theorem.

5. Mathematical logic: propositional logic, first-order predicate calculus and resolution principle.