課程信息
14,053

100% 在線

立即開始,按照自己的計劃學習。

可靈活調整截止日期

根據您的日程表重置截止日期。

中級

完成時間大約為40 小時

建議:11 weeks of study, 3-5 hours per week....

英語(English)

字幕:英語(English)

100% 在線

立即開始,按照自己的計劃學習。

可靈活調整截止日期

根據您的日程表重置截止日期。

中級

完成時間大約為40 小時

建議:11 weeks of study, 3-5 hours per week....

英語(English)

字幕:英語(English)

教學大綱 - 您將從這門課程中學到什麼

1
完成時間為 5 小時

Introduction - Basic Objects in Discrete Mathematics

This module gives the learner a first impression of what discrete mathematics is about, and in which ways its "flavor" differs from other fields of mathematics. It introduces basic objects like sets, relations, functions, which form the foundation of discrete mathematics....
2 個視頻 (總計 27 分鐘), 3 個測驗
2 個視頻
Sets, Relations, Functions10分鐘
1 個練習
Sets, relations, and functions30分鐘
2
完成時間為 4 小時

Partial Orders

Even without knowing, the learner has seen some orderings in the past. Numbers are ordered by <=. Integers can be partially ordered by the "divisible by" relation. In genealogy, people are ordered by the "A is an ancestor of B" relation. This module formally introduces partial orders and proves some fundamental and non-trivial facts about them....
2 個視頻 (總計 28 分鐘), 2 個測驗
2 個視頻
Mirsky's and Dilworth's Theorem14分鐘
1 個練習
Partial orders, maximal and minimal elements, chains, antichains
3
完成時間為 5 小時

Enumerative Combinatorics

A big part of discrete mathematics is about counting things. A classic example asks how many different words can be obtained by re-ordering the letters in the word Mississippi. Counting problems of this flavor abound in discrete mathematics discrete probability and also in the analysis of algorithms....
3 個視頻 (總計 35 分鐘), 2 個測驗
3 個視頻
Evaluating Simple Sums8分鐘
Pascal's Triangle14分鐘
1 個練習
Counting Basic Objects
4
完成時間為 4 小時

The Binomial Coefficient

The binomial coefficient (n choose k) counts the number of ways to select k elements from a set of size n. It appears all the time in enumerative combinatorics. A good understanding of (n choose k) is also extremely helpful for analysis of algorithms....
3 個視頻 (總計 55 分鐘), 3 個測驗
3 個視頻
Estimating the Binomial Coefficient22分鐘
Excursion to Discrete Probability: Computing the Expected Minimum of k Random Elements from {1,...,n}18分鐘
1 個練習
An Eagle's View of Pascal's Triangle8分鐘
5
完成時間為 5 小時

Asymptotics and the O-Notation

...
1 個視頻 (總計 14 分鐘), 3 個測驗
1 個視頻
1 個練習
The Big-O-Notation18分鐘
6
完成時間為 5 小時

Introduction to Graph Theory

Graphs are arguably the most important object in discrete mathematics. A huge number of problems from computer science and combinatorics can be modelled in the language of graphs. This module introduces the basic notions of graph theory - graphs, cycles, paths, degree, isomorphism....
3 個視頻 (總計 41 分鐘), 3 個測驗
3 個視頻
Graph Isomorphism, Degree, Graph Score13分鐘
Graph Score Theorem16分鐘
1 個練習
Graphs, isomorphisms, and the sliding tile puzzle30分鐘
7
完成時間為 5 小時

Connectivity, Trees, Cycles

We continue with graph theory basics. In this module, we introduce trees, an important class of graphs, and several equivalent characterizations of trees. Finally, we present an efficient algorithm for detecting whether two trees are isomorphic....
3 個視頻 (總計 36 分鐘), 3 個測驗
3 個視頻
Cycles and Trees15分鐘
An Efficient Algorithm for Isomorphism of Trees12分鐘
1 個練習
Cycles and Trees30分鐘
8
完成時間為 3 小時

Eulerian and Hamiltonian Cycles

Starting with the well-known "Bridges of Königsberg" riddle, we prove the well-known characterization of Eulerian graphs. We discuss Hamiltonian paths and give sufficient criteria for their existence with Dirac's and Ore's theorem....
2 個視頻 (總計 27 分鐘), 2 個測驗
2 個視頻
Hamilton Cycles - Ore's and Dirac's Theorem16分鐘
1 個練習
Hamiltonian Cycles and Paths
9
完成時間為 5 小時

Spanning Trees

We discuss spanning trees of graphs. In particular we present Kruskal's algorithm for finding the minimum spanning tree of a graph with edge costs. We prove Cayley's formula, stating that the complete graph on n vertices has n^(n-2) spanning trees....
2 個視頻 (總計 29 分鐘), 3 個測驗
2 個視頻
The Number of Trees on n Vertices15分鐘
1 個練習
Spanning Trees40分鐘
10
完成時間為 3 小時

Maximum flow and minimum cut

This module is about flow networks and has a distinctively algorithmic flavor. We prove the maximum flow minimum cut duality theorem....
2 個視頻 (總計 29 分鐘), 2 個測驗
2 個視頻
Flow Networks: The Maxflow - Mincut Theorem15分鐘
1 個練習
Network flow8分鐘
11
完成時間為 3 小時

Matchings in Bipartite Graphs

We prove Hall's Theorem and Kőnig's Theorem, two important results on matchings in bipartite graphs. With the machinery from flow networks, both have quite direct proofs. Finally, partial orderings have their comeback with Dilworth's Theorem, which has a surprising proof using Kőnig's Theorem....
3 個視頻 (總計 46 分鐘), 1 個測驗
3 個視頻
Matchings in Bipartite Graphs: Hall's and König's Theorem16分鐘
Partial Orders: Dilworth's Theorem on Chains and Antichains15分鐘
3.5
32 個審閱Chevron Right

熱門審閱

創建者 NPOct 23rd 2017

Fantastic course. Fascinating material, presented at a reasonably fast pace, and some really challenging assignments.

創建者 AGDec 5th 2018

This course is good to comprehend relation, function and combinations.

講師

Avatar

Dominik Scheder

Assistant Professor
The Department of Computer Science and Engineering

關於 上海交通大学

Shanghai Jiao Tong University, a leading research university located in Shanghai, China, has been regarded as the fastest developing university in the country for the last decade. With special strengths in engineering, science, medicine and business, it now offers a comprehensive range of disciplines in 27 schools with more than 41,000 enrolled students from more than one hundred countries....

常見問題

  • 注册以便获得证书后,您将有权访问所有视频、测验和编程作业(如果适用)。只有在您的班次开课之后,才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程,可能无法访问某些作业。

  • 您购买证书后,将有权访问所有课程材料,包括评分作业。完成课程后,您的电子课程证书将添加到您的成就页中,您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容,可以免费旁听课程。

還有其他問題嗎?請訪問 學生幫助中心