- Pseudocode
- Computer Science
- Data Structures
- Algorithms
- Analysis
- Theoretical Computer Science
- Programming Principles
- Computational Thinking
- Advanced Mathematics
- Python Programming
- Design Strategies
Dynamic Programming, Greedy Algorithms
Completed by Ramit Sarkar
November 13, 2022
38 hours (approximately)
Ramit Sarkar'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
