|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/ib-math-mai-hl-graph-theory/
课程评论：没有评论
Coursera IB 数学 MAI HL - 图论课程总结 本课程是图论的入门课程，适合 IB 数学 MAI HL 的学生。课程从图论的基础概念讲起，涵盖了回路、路径、边、圈、顶点等基本术语和定义。 课程重点讲解了两种用于确定最小生成树的算法：Kruskal 算法和 Prim 算法。 随后，课程将逐步深入探讨两个经典的图论问题： * **中国邮递员问题 (Chinese Postman Problem)**：侧重于边，目标是在遍历所有边的情况下找到最短的邮递路线。 * **旅行商问题 (Traveling Salesman Problem)**：侧重于顶点，目标是在访问所有顶点一次并返回起点的最短路径。 课程介绍了解决旅行商问题的两种方法： * **最近邻算法 (Nearest Neighbour Algorithm)**：用于 tìm upper bound (近似最优解)。 * **删除顶点算法 (Deleted Vertex Algorithm)**：用于 tìm lower bound (最优解的下界)。 整个课程提供详细的概念解释，并提供练习题和视频解决方案，帮助学生巩固知识。课程内容设计由浅入深，旨在帮助学生建立基础，逐步掌握解决 IB 考试级别图论问题的能力。 课程提供丰富的示例问题、解决方案和练习测试，这些内容均参照 IB 考试大纲设计，涵盖了 MAI HL 纸笔 1 和纸笔 2 可能出现的题型，帮助学生为 IB 考试做好充分准备，力争取得优异成绩。
Graph theory is a relatively modern mathematics and this course starts at the beginning of graph theory, introducing terms and definitions, such as circuits, trails and edges or cycles, paths and vertices and teaches Kruskal's and Prim's Algorithms to determine a minimum spanning tree. From there it goes on and teaches step by step the Chinese Postman Problem (all about edges) and the Traveling Salesman problem (all about vertices), finding the upper bound by the Nearest Neighbour Algorithm and the lower bound with the Deleted Vertex Algorithm. Throughout the course you get detailed explanations about the concepts of graph theory as well as having opporunities to solve some problems that have video solutions. Initially some questions will be simpler than IB questions so you can build the knowledge and the understanding required to be able to solve the IB questions. You will have access to example problems and solutions as well as some practice tests that are all designed with the IB exams in mind. They will included both paper 1 and paper 2 like problems. The practice tests include types the of questions you may expect on the MAI HL paper 1 and paper 2 so you can ace the IB exams.
