This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. We will also cover some advanced topics in data structures.
Ce cours fait partie de la Spécialisation Data Science Foundations: Data Structures and Algorithms
Offert par


À propos de ce cours
Completion of previous courses. Calculus, probability theory: distributions, expectations and moments. Some programming experience with Python.
Ce que vous allez apprendre
Describe basic algorithm design techniques
Create divide and conquer, dynamic programming, and greedy algorithms
Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems
Compétences que vous acquerrez
- Analysis of Algorithms
- Algorithm Design
- Python Programming
- Data Structure Design
- Intractability
Completion of previous courses. Calculus, probability theory: distributions, expectations and moments. Some programming experience with Python.
Offert par
Commencez à travailler pour votre diplôme
Programme de cours : ce que vous apprendrez dans ce cours
Divide and Conquer Algorithms
Dynamic Programming Algorithms
Greedy Algorithms
Intractability and Supplement on Quantum Computing
Avis
- 5 stars71,73 %
- 4 stars17,39 %
- 3 stars2,17 %
- 2 stars2,17 %
- 1 star6,52 %
Meilleurs avis pour DYNAMIC PROGRAMMING, GREEDY ALGORITHMS
This course save me time on learning the dynamic programming. I really love the 4-steps to construct the dynamic programming. It gives me the guideline when designing DP solution.
Excellent. This course covers some difficult topics, but the lectures and homework assignments were superb and made them quite approachable.
Excellent course! I really learned alot and enjoyed all the challenges and topics in your course. Thank you so much!
Great work from professor Sriram Sankaranarayanan explaining such complex material. I wish we could review more examples during the class (specially Dynamic Programming ones).
À propos du Spécialisation Data Science Foundations: Data Structures and Algorithms

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.