In previous courses of our online specialization you've learned the basic algorithms, and now you are ready to step into the area of more complex problems and algorithms to solve them. Advanced algorithms build upon basic ones and use new ideas. We will start with networks flows which are used in more typical applications such as optimal matchings, finding disjoint paths and flight scheduling as well as more surprising ones like image segmentation in computer vision. We then proceed to linear programming with applications in optimizing budget allocation, portfolio optimization, finding the cheapest diet satisfying all requirements and many others. Next we discuss inherently hard problems for which no exact good solutions are known (and not likely to be found) and how to solve them in practice. We finish with a soft introduction to streaming algorithms that are heavily used in Big Data processing. Such algorithms are usually designed to be able to process huge datasets without being able even to store a dataset.
Об этом курсе
- 5 stars72,30 %
- 4 stars18,30 %
- 3 stars5,53 %
- 2 stars1,69 %
- 1 star2,15 %
Лучшие отзывы о курсе ADVANCED ALGORITHMS AND COMPLEXITY
Very Educational and Enlightening. The only criticism I have is that the starter files generally need more modification than indicated to create a successful program.
after 2 week rest weeks are fun with Alexander S. Kulikov.
Daniel M kane, does not meet our need.
But overall this course has many thing to learn.
It's my pleasure to learn the course from the top instructors and this course will be helpful for my future
The problems are really challenging, thank you! However, the instructor is not very active in the discussion forum, which is a pity when you really need help and get stucked in the problem set.
Специализация Структуры и алгоритмы данных: общие сведения
Часто задаваемые вопросы
Когда я получу доступ к лекциям и заданиям?
Что я получу, оформив подписку на специализацию?
Можно ли получить финансовую помощь?
Остались вопросы? Посетите Центр поддержки учащихся.