Dynamic Programming, Greedy Algorithms
Completed by Kanhaiya Lal
May 3, 2024
38 hours (approximately)
Kanhaiya Lal '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: Theoretical Computer Science
- Category: Algorithms
- Category: Computational Thinking
- Category: Analysis
- Category: Python Programming
- Category: Data Structures
- Category: Quantum computing
