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