Dynamic Programming, Greedy Algorithms
Completed by Althea Trisha Mae Aringo
May 16, 2025
38 hours (approximately)
Althea Trisha Mae Aringo'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: Algorithms
- Category: Python Programming
- Category: Analysis
- Category: Computational Thinking
- Category: Data Structures
- Category: Quantum computing
- Category: Theoretical Computer Science
- Category: Design Strategies
- Category: Applied Mathematics
