- Theoretical Computer Science
- Computer Science
- Programming Principles
- Analysis
- Pseudocode
- Computational Thinking
- Design Strategies
- Data Structures
- Python Programming
- Advanced Mathematics
- Algorithms
Dynamic Programming, Greedy Algorithms
Completed by Artur Mavlianberdiev
March 24, 2025
38 hours (approximately)
Artur Mavlianberdiev'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
