Dynamic Programming, Greedy Algorithms
Completed by Mandeep Singh
April 22, 2025
38 hours (approximately)
Mandeep Singh'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: Design Strategies
- Category: Data Structures
- Category: Analysis
- Category: Theoretical Computer Science
- Category: Computational Thinking
- Category: Python Programming
- Category: Algorithms
- Category: Applied Mathematics
- Category: Quantum computing
