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