Dynamic Programming, Greedy Algorithms
Completed by Manoranjan Sahoo
April 4, 2024
38 hours (approximately)
Manoranjan Sahoo '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: Mathematical Theory & Analysis
- Category: Data Structures
- Category: Design Strategies
- Category: Analysis
- Category: Python Programming
- Category: Algorithms
- Category: Theoretical Computer Science
- Category: Quantum computing
