Discrete Mathematics is a tailor-made mathematics for computer majors, which highlights the logic, organization and abstraction of computer majors. In fact, it does not lie in knowledge itself, which provides a good theoretical basis and general conditions for solving problems for programming.

Because the digital electronic computer is a discrete structure, it can only deal with discrete or discrete quantitative relations. Therefore, both computer science itself and modern scientific research fields closely related to computer science and its application are faced with the problem of how to establish corresponding mathematical models for discrete structures.

Subject content

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

Graph theory: basic concepts of graphs, Euler 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.

Algebraic structure: the basic concepts of algebraic systems, semigroups and uniqueness, groups, rings and fields, lattices and Boolean algebras.

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