Dynamic Programming, Greedy Algorithms

Description

Sriram Sankaranarayanan

This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. We will also cover some advanced topics in data structures.

Read more.

Career Relevance by Data Role

The techniques and tools covered in Dynamic Programming, Greedy Algorithms are most similar to the requirements found in Data Scientist job advertisements.


Similarity Scores (Out of 100)

Subscribe for updates and new courses
Or create a DataKwery.com account
Fast Facts

Tools
JupyterPython

Techniques
AlgorithmsData AnalysisOptimizationProgramming

Similar Opportunities
Computing in Python IV: Objects & Algorithms

edX - Georgia Institute of Technology

Advanced Algorithms and Complexity

Coursera - National Research University Higher School of Economics

Algorithmic Design and Techniques

edX - University of California, San Diego

Algorithmic Toolbox

Coursera - National Research University Higher School of Economics

Programming Fundamentals

Coursera - Duke University

Data Structures

Coursera - National Research University Higher School of Economics

Approximation Algorithms Part I

Coursera - École normale supérieure

Computational Thinking for Problem Solving

Coursera - University of Pennsylvania