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