Dynamic Programming, Greedy Algorithms
Completed by Honey Ranjan
April 23, 2024
38 hours (approximately)
Honey Ranjan '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: Design Strategies
- Category: Theoretical Computer Science
- Category: Algorithms
- Category: Analysis
- Category: Data Structures
- Category: Python Programming
- Category: Computational Thinking
- Category: Quantum computing
