- Program Development
- Data Structures
- Python Programming
- Theoretical Computer Science
- Analysis
- Computer Science
- Design Strategies
- Linear Algebra
- Advanced Mathematics
- Computational Thinking
- Programming Principles
- Pseudocode
Dynamic Programming, Greedy Algorithms
Completed by RONIT SAHU
October 16, 2024
38 hours (approximately)
RONIT SAHU'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
