- Computational Thinking
- Programming Principles
- Python Programming
- Advanced Mathematics
- Pseudocode
- Analysis
- Theoretical Computer Science
- Design Strategies
- Algorithms
- Data Structures
- Computer Science
Dynamic Programming, Greedy Algorithms
Completed by Charu Maheshwari
October 6, 2023
38 hours (approximately)
Charu Maheshwari'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
