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