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