*list*11 séquences

*assignment*Niveau : Intermédiaire

*chat_bubble_outline*Langue : Anglais

*card_giftcard*330 points

## Les infos clés

*credit_card*Formation

**gratuite**

*verified_user*Certification

**payante**

*timer*

**33**heures de cours

## En résumé

Discrete mathematics forms the mathematical foundation of computer and information science. It is also a fascinating subject in itself. Learners will become familiar with a broad range of mathematical objects like sets, functions, relations, graphs, that are omnipresent in computer science. Perhaps more importantly, they will reach a certain level of mathematical maturity - being able to understand formal statements and their proofs; coming up with rigorous proofs themselves; and coming up with interesting results. This course attempts to be rigorous without being overly formal. This means, for every concept we introduce we will show at least one interesting and non-trivial result and give a full proof. However, we will do so without too much formal notation, employing examples and figures whenever possible. The main topics of this course are (1) sets, functions, relations, (2) enumerative combinatorics, (3) graph theory, (4) network flow and matchings. It does not cover modular arithmetic, algebra, and logic, since these topics have a slightly different flavor and because there are already several courses on Coursera specifically on these topics.

*more_horiz*Lire plus

*more_horiz*Lire moins

*dns*

## Le programme

- Week 1 -
**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 ... - Week 2 -
**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 i... - Week 3 -
**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 probabilit... - Week 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. - Week 5 -
**Asymptotics and the O-Notation**

- Week 6 -
**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... - Week 7 -
**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. - Week 8 -
**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. - Week 9 -
**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. - Week 10 -
**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. - Week 11 -
**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 surpr...

*record_voice_over*

## Les intervenants

**Dominik Scheder**

Assistant Professor

The Department of Computer Science and Engineering

*store*

## Le concepteur

*assistant*

## La plateforme

**Coursera** est une entreprise numérique proposant des formations en ligne ouverte à tous fondée par les professeurs d'informatique Andrew Ng et Daphne Koller de l'université Stanford, située à Mountain View, Californie.

Ce qui la différencie le plus des autres plateformes MOOC, c'est qu'elle travaille qu'avec les meilleures universités et organisations mondiales et diffuse leurs contenus sur le web.

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

*star*

The level is advanced undergraduate. It contains challenging excersises. You spent more than 10hr per week to solve them and typesetting them(at least for me).And you can make friend with your peers. It is for me a unique experience!

*star*

*star*

*star*

*star*

*star*

Actually I haven't finished course in the eleventh week yet, I've only done all the tests:). However, I'd like to say that I like this course very much, it's inspiring and difficult enough. Though I always have to struggle a lot to find the cocepts and meaning of the notations online, there have been enough hints. The only pity was that sometimes there's something which can't be shown normally in exercise, this has caused me some trouble. Overall it's great, and thanks a lot, professor Scheder.

*star*

*star*

*star*

*star*

*star*

The level is advanced undergraduate. It contains challenging excersises. You spent more than 10hr per week to solve them and typesetting them(at least for me).And you can make friend with your peers. It is for me a unique experience!

*star*

*star*

*star*

*star*

*star*

Poor presentation of material. Peer reviewed material with no solutions given and no explanation or solutions to any problems. The instructor is teaching this as a review course instead of for people who are taking this for their first time. You cannot learn in this course. Very poor. Remove this course its a waste of time.

*star*

*star*

*star*

*star*

*star*

Other than the issue of peer grading, I took the course of the first week and found the course material is missing and quiz of week 1 needs the materials of week 2.This is not a preliminary discrete math course. I was trying to learn part of the MIT discrete math course then jump on this course to catch up but I found that the first week's content is about 15 week content in MIT so I guess I will just quit.In the forum there are people seems can't find enough companies for peer grading and almost no posts after week 2.

*star*

*star*

*star*

*star*

*star*

Course materials are poorly prepared and the method of peer review of proofs in fundamentally flawed. Hopefully, once there are some teaching and explanatory materials available and an improved scheme for assignment marking, the course will be worth taking. Unfortunately it is a bit of a mess at the moment.