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