Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

University of Science and Technology Beijing

Discrete Mathematics

University of Science and Technology Beijing via XuetangX

Overview

Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it

Discrete Mathematics is a mathematical discipline that studies the structure of discrete quantities and their interrelationships. It is an important branch of modern mathematics and a basic core discipline of computer science. It is an indispensable prerequisite course for courses such as data structure, operating system, compilation technology, artificial intelligence, database, algorithm design and analysis,mainly cultivating students' meticulous thinking and improving their comprehensive quality. Under the background of the vigorous development of artificial intelligence and big data, the study of discrete mathematics is particularly important.

The contents of this course mainly include mathematical logic, set theory, algebraic structure, graph theory, comprehensive experiment and so on. The learning of the whole course mainly relies on the textbook Discrete Mathematics ( National 12th five-year plan textbooks in China, Beijing high-quality textbooks) edited by our teaching team.

The teaching of the whole course presents several distinct characteristics:

(1) In view of the characteristics of discrete mathematics learning content, on the basis of the traditional teaching methods, we introduce the cognitive structure teaching theory which is proposed by our teaching team and integrates "knowledge logic structure" and "mind map"(KM teaching theory for short). The basic connotation of KM teaching theory (that is, the teaching idea of "core theory of knowledge logic structure"; the teaching mechanism of "double picture fusion"; the teaching mode of "teaching loop"; the teaching content of "three-dimensional structure"; the teaching method of "syllogism") throughout the course organization and teaching process.

(2)The teaching materials under the guidance of the research-oriented teaching concept compiled by the teaching team fully embody the "Generative" logic of knowledge. In the exploration and practice of research-oriented teaching of Discrete Mathematics, the teaching team combined the basic connotation of research-oriented teaching with KM teaching theory and compiled the textbook of Discrete Mathematics. It breaks through the traditional idea of treating discrete mathematics as "Patchwork Structure", absorbs the theory of Structuralism, and forms a new idea of "Structural Correlation"; It is the path of teaching material deductive spread: the summary of the book - the passage introduction (Tree Class Diagram) – Chapter Rough Sketch - Chapter Application Sketch – Expanded with Sections (the core knowledge, Embedded Thinking Form Note Figure, the brief summary of each section) - Chapter Exercises Generalization (common typical exercises analysis) - Chapter Knowledge Logic Structure Diagram - Extended Reading – Exercises – Passage Knowledge Logic Structure Diagram. In terms of mode and style, this textbook is completely consistent with the cognitive law of students and has a strong enlightening effect. It has been awarded the title of Excellent Textbook of Beijing, and has been selected as the national planning textbook for undergraduates of general higher education during the “12th Five Year Plan” period.

(3)Introduce the "problem-driven" concept into the course teaching. On the one hand, at the beginning of each chapter, by introducing the application overview of the relevant fields in the knowledge subject of the chapter, students can have a general understanding of the application of the course content in the subject field before learning each chapter of knowledge, and stimulate their initiative and interest in learning; On the other hand, the experimental teaching link is designed to train students to use computer technology to achieve solutions to typical problems in discrete mathematics, thereby deepening their understanding and mastering of theoretical knowledge.

I believe that through this course of study, you will have an in-depth understanding, proficiency and the flexibility to apply discrete mathematics learning content.

Syllabus

  • Introduction to this course
    • 1.0 Introduction to mathematical logic
      • 1.1 Basic concepts of proposition
      • 1.2 Connective
      • 1.3 Propositional formula
      • 1.4The relationship between propositional formulas
      • 1.5 Duality and Paradigm
      • 1.6 Propositional logic reasoning theory
      • 1.7 Summary of propositional logic
      • Analysis on Focal& Difficult Points
    • 2. Predicate logic of mathematical logic
      • 2.1 The basic concept of predicate
      • 2.2 Predicate formula and explanation
      • 2.3 The relationship between predicate formulas
      • 2.4 Prenex normal form
      • 2.5 Predicate logical reasoning theory
      • 2.6 Summary of predicate logic
      • Analysis on Focal& Difficult Points
    • 3. Set of set theory
      • 3.1 Introduction to Set Theory
      • 3.2 Basic concepts of collection
      • 3.3 Power set and Family of sets
      • 3.4 Set operations and their properties
      • 3.5 Ordered pair and Cartesian product
      • 3.6 Count of finite sets
      • Analysis on Focal& Difficult Points
    • 4.Binary relation of set theory
      • 4.1 Definition and representation of binary relationship
      • 4.2 Nature of relationship
      • 4.3 Operation of relationship
      • 4.4 Equivalence and division
      • 4.5 Compatibility and coverage
      • 4.6 Partial ordering relation
      • Analysis on Focal& Difficult Points
    • 5. Functions of set theory
      • 5.1 Definition and classification of functions
      • 5.2 Operation of functions
    • 6. Cardinality of sets in set theory
      • Cardinality of collection
    • 7.Algebraic system of algebraic structure
      • 7.1 Introduction to Algebraic Structure
      • 7.2 Algebraic system
    • 8. A Preliminary Study of Group Theory of Algebraic Structure
      • 8.1 Definition and properties of groups
      • 8.2 Subgroups and cosets
      • 8.3 Special group
      • 8.4 Expansion of Groups-Rings and Domains
      • 8.5 A preliminary summary of group theory
    • 9. The lattice of algebraic structure and Boolean algebra
      • Lattice and Boolean algebra
    • 10. The basic concept of graph in graph theory
      • 10.1 Graph theory and basic introduction to graphs
      • 10.2 Definition of graph
      • 10.3 Graphable and Simple Graphable
      • 10.4 Isomorphic classification and operation of graphs
      • Analysis on Focal& Difficult Points
    • 11. Connectivity of Graph Theory Graphs
      • 11.1 Definition of pathways and circuits
      • 11.2 Connectivity of Undirected Graphs
      • 11.3 Connectivity of directed graphs
    • 12. Matrix Representation of Graph Theory Graphs
      • 12.1 Adjacency matrix
      • 12.2 Reachability matrix
      • 12.3 Correlation matrix
    • 13. Special Diagrams
      • 13.1 Trees and spanning trees
      • 13.2 Roots and Binary Trees
      • 13.3 Euler Graph
      • 13.4 Hamiltonian graph
      • 13.5 Bipartite graph and Planar graph
      • Analysis on Focal& Difficult Points
    • 14. Comprehensive Experiment
      • 14.1 Mathematical logic experiment
      • 14.2 Set theory experiment
      • 14.3 Graph theory experiment
    • Review for key points
      • Final exam

        Taught by

        Luo Xiong, Xie Yonghong, Wang Weiping, and Tian Shu

        Tags

        Reviews

        Start your review of Discrete Mathematics

        Never Stop Learning.

        Get personalized course recommendations, track subjects and courses with reminders, and more.

        Someone learning on their laptop while sitting on the floor.