Dynamic Programming, Greedy Algorithms
Completed by PAOLO LAPO CERNI
September 4, 2023
38 hours (approximately)
PAOLO LAPO CERNI's account is verified. Coursera certifies their successful completion of Dynamic Programming, Greedy Algorithms
What you will learn
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
Skills you will gain
- Category: Data Structures
- Category: Python Programming
- Category: Theoretical Computer Science
- Category: Algorithms
- Category: Applied Mathematics
- Category: Quantum computing
- Category: Design Strategies
- Category: Computational Thinking
- Category: Analysis
