Dynamic Programming, Greedy Algorithms
Completed by Alexandros Arnogiannakis
July 12, 2024
38 hours (approximately)
Alexandros Arnogiannakis'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
- Category: Computational Thinking
- Category: Algorithms
- Category: Quantum computing
- Category: Data Structures
- Category: Python Programming
- Category: Analysis
- Category: Design Strategies
- Category: Theoretical Computer Science
