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.
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. How to discretize the mathematical model established by continuous quantitative relationship so that it can be processed by computer.
Extended data:
The content involves:
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.
Baidu encyclopedia-discrete mathematics