- Computer Science
- Data Analysis
- Analysis
- Theoretical Computer Science
- Algorithms
- Advanced Mathematics
- Computational Thinking
- Computer Programming
- Mathematical Theory & Analysis
- Data Structures
- Design Strategies
- Programming Principles
Dynamic Programming, Greedy Algorithms
Completed by Sagar Balkrishna Admane
May 3, 2024
38 hours (approximately)
Sagar Balkrishna Admane '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
