Switch to English Site

dotsdots

Dynamic Programming, Greedy Algorithms

描述

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.阅读更多.

此资源由附属合作伙伴提供。 如果您支付培训费用,我们可能会赚取佣金来支持该网站。

按照数据工作岗位排列职业相关性

Dynamic Programming, Greedy Algorithms 中涵盖的技术和工具与 数据科学家 招聘广告中的要求最为相似。

相似度得分(满分 100)

学习顺序

Dynamic Programming, Greedy Algorithms is a part of 一 structured learning path.

Coursera
University of Colorado Boulder