Acerca de este Curso
13,944 vistas recientes

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.

Nivel intermedio

Aprox. 40 horas para completar

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

Inglés (English)

Subtítulos: Inglés (English)

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.

Nivel intermedio

Aprox. 40 horas para completar

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

Inglés (English)

Subtítulos: Inglés (English)

Programa - Qué aprenderás en este curso

Semana
1
5 horas para completar

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 videos (Total 27 minutos), 3 quizzes
2 videos
Sets, Relations, Functions10m
1 ejercicio de práctica
Sets, relations, and functions30m
Semana
2
4 horas para completar

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 videos (Total 28 minutos), 2 quizzes
2 videos
Mirsky's and Dilworth's Theorem14m
1 ejercicio de práctica
Partial orders, maximal and minimal elements, chains, antichainss
Semana
3
5 horas para completar

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 videos (Total 35 minutos), 2 quizzes
3 videos
Evaluating Simple Sums8m
Pascal's Triangle14m
1 ejercicio de práctica
Counting Basic Objectss
Semana
4
4 horas para completar

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 videos (Total 55 minutos), 3 quizzes
3 videos
Estimating the Binomial Coefficient22m
Excursion to Discrete Probability: Computing the Expected Minimum of k Random Elements from {1,...,n}18m
1 ejercicio de práctica
An Eagle's View of Pascal's Triangle8m
Semana
5
5 horas para completar

Asymptotics and the O-Notation

...
1 video (Total 14 minutos), 3 quizzes
1 ejercicio de práctica
The Big-O-Notation18m
Semana
6
5 horas para completar

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 videos (Total 41 minutos), 3 quizzes
3 videos
Graph Isomorphism, Degree, Graph Score13m
Graph Score Theorem16m
1 ejercicio de práctica
Graphs, isomorphisms, and the sliding tile puzzle30m
Semana
7
5 horas para completar

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 videos (Total 36 minutos), 3 quizzes
3 videos
Cycles and Trees15m
An Efficient Algorithm for Isomorphism of Trees12m
1 ejercicio de práctica
Cycles and Trees30m
Semana
8
3 horas para completar

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 videos (Total 27 minutos), 2 quizzes
2 videos
Hamilton Cycles - Ore's and Dirac's Theorem16m
1 ejercicio de práctica
Hamiltonian Cycles and Pathss
Semana
9
5 horas para completar

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 videos (Total 29 minutos), 3 quizzes
2 videos
The Number of Trees on n Vertices15m
1 ejercicio de práctica
Spanning Trees40m
Semana
10
3 horas para completar

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 videos (Total 29 minutos), 2 quizzes
2 videos
Flow Networks: The Maxflow - Mincut Theorem15m
1 ejercicio de práctica
Network flow8m
Semana
11
3 horas para completar

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 videos (Total 46 minutos), 1 quiz
3 videos
Matchings in Bipartite Graphs: Hall's and König's Theorem16m
Partial Orders: Dilworth's Theorem on Chains and Antichains15m
3.5
32 revisionesChevron Right

Principales revisiones

por NPOct 23rd 2017

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

por AGDec 5th 2018

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

Instructor

Avatar

Dominik Scheder

Assistant Professor
The Department of Computer Science and Engineering

Acerca de Universidad de Shanghái Jiao Tong

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....

Preguntas Frecuentes

  • Una vez que te inscribes para obtener un Certificado, tendrás acceso a todos los videos, cuestionarios y tareas de programación (si corresponde). Las tareas calificadas por compañeros solo pueden enviarse y revisarse una vez que haya comenzado tu sesión. Si eliges explorar el curso sin comprarlo, es posible que no puedas acceder a determinadas tareas.

  • Cuando compras un Certificado, obtienes acceso a todos los materiales del curso, incluidas las tareas calificadas. Una vez que completes el curso, se añadirá tu Certificado electrónico a la página Logros. Desde allí, puedes imprimir tu Certificado o añadirlo a tu perfil de LinkedIn. Si solo quieres leer y visualizar el contenido del curso, puedes participar del curso como oyente sin costo.

¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.