Dynamic Programming, Greedy Algorithms
Completed by Erpa.Sri Laxmi Prasanna
March 27, 2024
38 hours (approximately)
Erpa.Sri Laxmi Prasanna '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: Analysis
- Category: Theoretical Computer Science
- Category: Applied Mathematics
- Category: Design Strategies
- Category: Quantum computing
- Category: Computational Thinking
- Category: Data Structures
- Category: Algorithms
