Dynamic Programming, Greedy Algorithms
Completed by Ahmed Samir El-Sherbiny
December 14, 2022
38 hours (approximately)
Ahmed Samir El-Sherbiny'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: Computational Thinking
- Category: Analysis
- Category: Python Programming
- Category: Algorithms
- Category: Data Structures
- Category: Quantum computing
- Category: Theoretical Computer Science
- Category: Applied Mathematics
- Category: Design Strategies
