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