Dynamic Programming, Greedy Algorithms
Completed by Aneesha Nigam
May 29, 2024
38 hours (approximately)
Aneesha Nigam '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: Python Programming
- Category: Algorithms
- Category: Quantum computing
- Category: Data Structures
- Category: Design Strategies
- Category: Applied Mathematics
- Category: Computational Thinking
- Category: Theoretical Computer Science
- Category: Analysis
