- Theoretical Computer Science
- Algorithms
- Computer Programming
- Computer Science
- Programming Principles
- Design Strategies
- Python Programming
- Analysis
- Mathematical Theory & Analysis
- Data Structures
- Computational Thinking
- Data Analysis
Dynamic Programming, Greedy Algorithms
Completed by Anuj Gupta
April 7, 2024
38 hours (approximately)
Anuj Gupta '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
