Dynamic Programming, Greedy Algorithms
Completed by Julio Silva
July 22, 2023
38 hours (approximately)
Julio Silva'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: Python Programming
- Category: Analysis
- Category: Data Structures
- Category: Design Strategies
- Category: Theoretical Computer Science
- Category: Algorithms
- Category: Computational Thinking
