Dynamic Programming, Greedy Algorithms
Completed by CHI HSIN LI
February 25, 2025
38 hours (approximately)
CHI HSIN LI'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: Python Programming
- Category: Quantum computing
- Category: Computational Thinking
- Category: Algorithms
- Category: Data Structures
- Category: Design Strategies
- Category: Applied Mathematics
