- Algorithms
- Analysis
- Design Strategies
- Pseudocode
- Data Structures
- Programming Principles
- Theoretical Computer Science
- Python Programming
- Computational Thinking
- Advanced Mathematics
- Computer Science
Dynamic Programming, Greedy Algorithms
Completed by Michael Evenson
June 23, 2023
38 hours (approximately)
Michael Evenson'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