- Data Structures
- Analysis
- Theoretical Computer Science
- Python Programming
- Computational Thinking
- Algorithms
- Design Strategies
- Computer Science
- Advanced Mathematics
- Programming Principles
- Pseudocode
Dynamic Programming, Greedy Algorithms
Completed by Akanksha Kumari
April 15, 2024
38 hours (approximately)
Akanksha Kumari '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
