hi,小慕
课程

中国大学MOOC,为你提供一流的大学教育

认证学习
为你提供认证成绩和证书,以及AI高效学习服务
查看详情
大学

国家精品

认证学习

智慧课程

理学工学农学

计算机

经济管理

外语

音乐与艺术

心理学

文史哲法

医学与保健

教育教学

大学生竞赛

软件实训

人工智能

升学/择业

考研

期末突击

专升本

四六级

保研及论文

求职就业

专四专八

大学应试英语

期末资料

终身学习

有声课堂

兴趣技能

hi,小mooc
期末不挂科
Discrete Mathematics
第9次开课
开课时间: 2024年09月09日 ~ 2025年01月19日
学时安排: 1-3个小时每周
当前开课已结束 已有 163 人参加
老师已关闭该学期,无法查看
课程详情
课程评价(12)
spContent="Discrete Mathematics" includes mathematical logic, set theory, algebraic structure, graph theory, and comprehensive experiment of the course. It is suitable for undergraduate and postgraduate majoring in computer science, information security, internet of things, communication engineering, artificial intelligence, information management and so on, as well as other types of personnel.
"Discrete Mathematics" includes mathematical logic, set theory, algebraic structure, graph theory, and comprehensive experiment of the course. It is suitable for undergraduate and postgraduate majoring in computer science, information security, internet of things, communication engineering, artificial intelligence, information management and so on, as well as other types of personnel.
—— 课程团队
课程概述

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.

授课目标

Through the study of this course, students can master the discretization and formalization of computing problems and the methods of solving scientific computing problems with computers, master the mathematical description methods of discrete systems, and be able to formally describe and prove computational problems. At the same time, cultivate students' abstract thinking ability, and lay the foundation for students to further study the follow-up courses. Specifically, the main teaching objectives include:

(1) Master the discrete and formal knowledge and methods of computing problems, and use the basic knowledge and professional theory related to mathematical logic, set theory, algebraic structure and graph theory to formally describe the computing problems;

(2) Master the mathematical description method of discrete systems, and apply it reasonably to the formal representation of calculation problems, logical calculus, logical reasoning, and construction of calculation models;

(3) Master the comprehensive and system knowledge related to discrete mathematics, analyze and design information technology-related systems and models, and be able to formally prove calculation problems.

课程大纲

Introduction to this course

Introduction to this course

1. Propositional logic of mathematical logic

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

Difficulty

Chapter 1 unit tests

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

Difficulty

Chapter 2 unit tests

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

Difficulty

Chapter 3 unit tests

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 The relationship between the nature of the relationship and the operation

4.5 Equivalence and division

4.6 Compatibility and coverage

4.7 Partial ordering relation

Difficulty

unit test of binary relation

5. Functions of set theory

5.1 Definition and classification of functions

5.2 Operation of functions

functional unit test

6. Cardinality of sets in set theory

Cardinality of collection

7.Algebraic system of algebraic structure

7.1 Introduction to Algebraic Structure

7.2 Binary operations and their properties

7.3 Algebraic system

unit test of algebra 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

preliminary unit test 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 diagram

10.3 Graphable and Simple Graphable

10.4 Isomorphic classification and operation of graphs

Difficulty

basic concept unit test of Graphs

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

graph theory and matrix representation unit test of Graphs

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

Difficulty

Unit test of special drawing

14. Comprehensive Experiment

14.1 Mathematical logic experiment

14.2 Set theory experiment

14.3 Graph theory experiment

Review for key points

Review for key points

展开全部
预备知识

Basic knowledge of:

  • Calculus
  • Linear Algebra
  • Programing
参考资料

[1] Yang B R, Xie Y H, Liu H L, Hong Y, Luo X. Discrete Mathematics. Beijing, China: Higher Education Press, 2012. (in Chinese)

[2] Zuo X L, Li W J, Liu Y C. Discrete Mathematics. Shanghai, China: Shanghai Scientific and Technological Literature Press, 2000. (in Chinese)

[3] Zuo X L, Li W J, Liu Y C. Key to Exercises in Discrete Mathematics. Shanghai, China: Shanghai Scientific and Technological Literature Press, 2004. (in Chinese)

[4] Qu W L, Geng S Y, Zhang L A. Discrete Mathematics. Beijing, China: Higher Education Press, 2008. (in Chinese)

[5] Qu W L, Geng S Y, Zhang L A. Key to Exercises in Discrete Mathematics. Beijing, China: Higher Education Press, 2009. (in Chinese)

[6] Yang B R. Discrete Mathematics. Beijing, China: Posts & Telecom Press, 2006. (in Chinese)

[7] Yang B R. A Summary of Graph Theory. Tianjing, China: Tianjing Scientific and Technological Literature Press, 1985. (in Chinese)

[8] Zhou L Q. Encyclopedia of Logic. Chengdu, China: Sichuan Education Press, 1994. (in Chinese)

[9] Fu Y, Gu X F, Wang Q X, Liu Q H. Discrete Mathematics and Its Application. Beijing, China: Higher Education Press, 2007. (in Chinese)

[10] Zhang M Y. Discrete Mathematics. Beijing, China: China Machine Press, 2008. (in Chinese)

[11] Mei J B, Liu H L, Luo J, et al. Key to Exercises in Discrete Mathematics (3rd Version). Wuhan, China: Huazhong University of Science & Technology Press, 2008. (in Chinese)


Note: The above reference [1] (authored by us) is used as the textbook in this course.

常见问题

Q: Why is the course called "discrete" mathematics?

A: According to the explanation of the English version of Wikipedia, there is no universally accepted precise definition of discrete mathematics. Discrete mathematics is a young course. It began in the 1980s as a computer support course. At the beginning, the content of the course was relatively arbitrary, and computer-related mathematics could be placed in it. With the continuous efforts of mathematics and computer-related organizations, the curriculum is gradually standardized and becomes the core curriculum of the computer major.


Q: What are the specific uses of discrete mathematics?

A: Some examples will be given in the comprehensive experimental part of this course. In addition, set theory is the foundation of mathematics, so as long as you want to use mathematics to model problems, you can’t do without set theory, as long as anyone who writes science and engineering papers later will use it. It should be said that the more abstract the content of work in the future, the more mathematics is needed, and the more specific the less mathematics. For example, if the content of future work is to study computational theory, then the discrete mathematics content of this course is far from enough, and even further study of other branches of discrete mathematics is needed.

We suggest that college students do not have to be too entangled in mathematics. As long as they are science and engineering, mathematics is definitely useful, but it may only be that some mathematics is useful in certain fields, so it is likely that students will feel a certain Mathematics courses are really useless, but this is also a manifestation of the broad foundation of the university. The goal of the university is not just skills training, and the goal of talent training is not just to make students find a better job. Learners outside the school can choose what they need to learn according to their actual work needs.


Q: Why are some test questions garbled?

A: Some mathematical symbols cannot be displayed on the mobile phone. At present, we are turning all symbols into pictures. If you still encounter this kind of situation, please check it on your computer. At the same time, you can remind us in the discussion area that we will replace it with pictures as soon as possible.


Q: Why is the progress of the MOOC and the learning progress at school different?

A: The discrete mathematics courses in our school are divided into 2 categories, one is the computer major and the duration is longer; the other is the other related majors and the duration is shorter. Therefore, all students cannot be taken care of.


University of Science and Technology Beijing
4 位授课老师
Xiong LUO

Xiong LUO

Professor

Yonghong XIE

Yonghong XIE

Associate Professor

Weiping Wang

Weiping Wang

Associate Professor

推荐课程

【限免】学霸笔记期末复习资料包

考拉学姐

3284492人参加

小白零基础编程-4小时入门JAVA(适用人群编程小白)

刘经纬

23526人参加

小白零基础编程-3小时入门C语言(适用人群编程小白)

刘经纬

48503人参加

毕业设计冲刺-1小时掌握毕设核心技能

安妮

1389人参加
下载
下载

下载App