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.
À propos de ce cours
Compétences que vous acquerrez
- 5 stars72,25 %
- 4 stars18,29 %
- 3 stars5,64 %
- 2 stars1,67 %
- 1 star2,13 %
Meilleurs avis pour ADVANCED ALGORITHMS AND COMPLEXITY
Thank you so much. You are doing such a great work but i appreciate if you explain week-2 (linear programming) in detail. Thank you.
Very good collection of advanced topics, even useful for the 6th course in the specialization!
The only thing I missed in this course (and specialization) was more visual, intuitive approach to explanation. Programming assignments are rewarding.
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.
À propos du Spécialisation Structures de données et algorithmes
Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
À quoi ai-je droit si je m'abonne à cette Spécialisation ?
Une aide financière est-elle possible ?
D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.