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