Dynamic Programming, Greedy Algorithms
Completed by Dimple chouhan
May 10, 2024
38 hours (approximately)
Dimple chouhan '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: Quantum computing
- Category: Algorithms
- Category: Design Strategies
- Category: Mathematical Theory & Analysis
- Category: Applied Mathematics
- Category: Computational Thinking
- Category: Analysis
- Category: Python Programming
- Category: Data Structures
