We’ll implement together an efficient program for a problem needed by delivery companies all over the world millions times per day — the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. How to find an optimal solution to this problem quickly? We still don’t have provably efficient algorithms for this difficult computational problem and this is the essence of the P versus NP problem, the most important open question in Computer Science. Still, we’ll implement several efficient solutions for real world instances of the travelling salesman problem. While designing these solutions, we will rely heavily on the material learned in the courses of the specialization: proof techniques, combinatorics, probability, graph theory. We’ll see several examples of using discrete mathematics ideas to get more and more efficient solutions.

# Introduction to Discrete Mathematics for Computer Science 专项课程

## Build a Foundation for Your Career in IT。Master the math powering our lives and prepare for your software engineer or security analyst career

## 本专项课程介绍

Discrete Math is needed to see mathematical structures in the object you work with, and understand their properties. This ability is important for software engineers, data scientists, security and financial analysts (it is not a coincidence that math puzzles are often used for interviews). We cover the basic notions and results (combinatorics, graphs, probability, number theory) that are universally needed. To deliver techniques and ideas in discrete mathematics to the learner we extensively use interactive puzzles specially created for this specialization. To bring the learners experience closer to IT-applications we incorporate programming examples, problems and projects in our courses.

制作方：

行业合作伙伴：

##### 5 courses

按照建议的顺序或选择您自己的顺序。

##### 项目

旨在帮助您实践和应用所学到的技能。

##### 证书

在您的简历和领英中展示您的新技能。

项目概览

课程

- Beginner Specialization.
- No prior experience required.

### 第 1 门课程

## Mathematical Thinking in Computer Science

- 课程学习时间
- 6 weeks, 2–5 hours/week

- 字幕
- English

### 课程概述

Mathematical thinking is crucial in all areas of computer science: algorithms, bioinformatics, computer graphics, data science, machine learning, etc. In this course, we will learn the most important tools used in discrete mathematics: induc**您可以选择只参加本课程。**了解更多。### 第 2 门课程

## Combinatorics and Probability

- 课程学习时间
- 6 weeks, 3-5 hours/week

- 字幕
- English

### 课程概述

Counting is one of the basic mathematically related tasks we encounter on a day to day basis. The main question here is the following. If we need to count something, can we do anything better than just counting all objects one by one? Do we need to cre**您可以选择只参加本课程。**了解更多。### 第 3 门课程

## Introduction to Graph Theory

- 课程学习时间
- 5 weeks, 3-5 hours/week

- 字幕
- English

### 课程概述

We invite you to a fascinating journey into Graph Theory — an area which connects the elegance of painting and the rigor of mathematics; is simple, but not unsophisticated. Graph Theory gives us, both an easy way to pictorially represent many major mathema**您可以选择只参加本课程。**了解更多。### 第 4 门课程

## Number Theory and Cryptography

- 课程学习时间
- 4 weeks, 2-5 hours/week

- 字幕
- English

### 课程概述

We all learn numbers from the childhood. Some of us like to count, others hate it, but any person uses numbers everyday to buy things, pay for services, estimated time and necessary resources. People have been wondering about numbers’ properties for thou**您可以选择只参加本课程。**了解更多。### 第 5 门课程

## Delivery Problem

- 课程学习时间
- 3 weeks of study, 2–5 hours/week

- 字幕
- English

### 课程概述

We’ll implement (in Python) together efficient programs for a problem needed by delivery companies all over the world millions times per day — the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. H**您可以选择只参加本课程。**了解更多。

## 制作方

#### Vladimir Podolskii

##### Associate Professor

#### Michael Levin

##### Lecturer

#### Alexander S. Kulikov

##### Visiting Professor

## FAQs

More questions? Visit the Learner Help Center.