- Mathematical Theory & Analysis
- Computer Science
- Data Analysis
- Computational Thinking
- Algorithms
- Computer Programming
- Advanced Mathematics
- Design Strategies
- Data Structures
- Analysis
- Programming Principles
- Python Programming
Dynamic Programming, Greedy Algorithms
Completed by Krishna Kishore Madathingal
November 10, 2022
38 hours (approximately)
Krishna Kishore Madathingal'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
