- Advanced Mathematics
- Computer Science
- Computational Thinking
- Data Structures
- Pseudocode
- Design Strategies
- Analysis
- Python Programming
- Programming Principles
- Theoretical Computer Science
- Algorithms
Dynamic Programming, Greedy Algorithms
Completed by < YERKEBULAN KAMBAROV
December 5, 2021
38 hours (approximately)
< YERKEBULAN KAMBAROV'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
