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