Discrete mathematics Discrete mathematics is a mathematical discipline that studies the structure and relationship of discrete quantities, and it is an important branch of modern mathematics. It is widely used in various disciplines, especially in 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.
With the advent of the information age, the mainstream position of continuous mathematics represented by calculus has changed in the era of industrial revolution, and the importance of discrete mathematics has been gradually recognized by people. The ideas and methods taught in discrete mathematics are widely reflected in various fields of computer science and technology and related majors, from scientific calculation to information processing, from theoretical computer science to computer application technology, from computer software to computer hardware, from artificial intelligence to cognitive system, which are closely related to discrete mathematics.
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.
Discrete mathematics is a comprehensive subject which integrates traditional logic, set theory (including function), number theory, algorithm design, combinatorial analysis, discrete probability, relation theory, graph theory and tree, abstract algebra (including algebraic system, group, ring, field, etc.). ), Boolean algebra, computational models (languages and automata) and so on. The application of discrete mathematics covers many fields of modern science and technology. The course of Discrete Mathematics mainly introduces the basic concepts, theories and methods of various branches of discrete mathematics. These concepts, theories and methods are widely used in digital circuits, compilation principles, data structures, operating systems, database systems, algorithm analysis and design, artificial intelligence, computer networks and other professional courses. At the same time, the training provided by this course is very beneficial to improve students' ability of generalization and abstraction, logical thinking and inductive structure, and to cultivate students' rigorous, complete and standardized scientific attitude.
The teaching purpose of discrete mathematics course is not only the theoretical basis and core main course of computer science and technology and related majors, but also to provide necessary theoretical support for subsequent courses. More importantly, it aims to cultivate and improve students' mathematical thinking ability and ability to solve practical problems by strengthening specialization, repetitive research, training and application in mathematical reasoning, combinatorial analysis, discrete structure, algorithm conception and design, model construction and so on. "The course includes:
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.
Discrete mathematics is divided into three courses, namely set theory and graph theory, algebraic structure and combinatorial mathematics, and mathematical logic. The teaching method is mainly classroom teaching, supplemented by written homework after class, courseware release through the school network teaching platform and teacher-student communication.