AT
A fun conclusion to the specialization that brings all of the mathematics of combinatorics and graph theory together to show how it can be applied to some real world problems.

In this online course 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. 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 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.

AT
A fun conclusion to the specialization that brings all of the mathematics of combinatorics and graph theory together to show how it can be applied to some real world problems.
SW
This is a nice way to end the course and, seaways nicely into studying algorithms in general.
AG
Well structured introductory course into transportation problems. The code in examples is well written and clean. It was a pleasure to study this course.
TA
O curso é muito interessante, porém a explicação é um pouco confusa. Poderia ter uma explicação em vídeo da parte envolvendo programação, e não apenas deixar isso como tarefa
AA
Great course, but complex matters need to explained more slowly and that's overall for all the specialization, but many thanks! those were some challenging courses!
NL
This series is great. I am confident to tutor my son in CS now.Thanks UCSD and HSE
AA
Thank you for such a wonderful specialization course!
DS
Amazing course with lots of intuitive examples and puzzles
AS
This final course in 5 course specialization is relatively easy one, although the last problem takes little bit time to solve. Provides good introduction to difficult to learn Delivery problem.
LB
It's a great introductory course to these topics. I didn't particularly enjoy the puzzles and "treasure hunt" in Number Theory and Cryptography but it's just a matter of learning styles I guess.
LF
This is a very nice course. I feel that a further explanation in the coding problems would be useful since sometimes you are not sure what one should return from the function.
SK
Very good course. If you are really good in python then go ahead with this course. Challenging questions to solve.