Dynamic Programming, Greedy Algorithms
Completed by LEE YING QI
March 10, 2024
38 hours (approximately)
LEE YING QI'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: Computational Thinking
- Category: Analysis
- Category: Quantum computing
- Category: Python Programming
- Category: Algorithms
- Category: Applied Mathematics
- Category: Design Strategies
- Category: Data Structures
