Chevron Left
Dynamic Programming, Greedy Algorithms に戻る

コロラド大学ボルダー校(University of Colorado Boulder) による Dynamic Programming, Greedy Algorithms の受講者のレビューおよびフィードバック

4.4
43件の評価

コースについて

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 can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder’s departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder....

人気のレビュー

AM

2022年9月18日

Great work from professor Sriram Sankaranarayanan explaining such complex material. I wish we could review more examples during the class (specially Dynamic Programming ones).

DM

2021年9月20日

Excellent. This course covers some difficult topics, but the lectures and homework assignments were superb and made them quite approachable.

フィルター:

Dynamic Programming, Greedy Algorithms: 1 - 13 / 13 レビュー

by Spyros T

2021年10月26日

by Dave M

2021年9月21日

by Bijan S

2021年12月14日

by Rishabh S

2021年8月5日

by Yu S

2022年7月23日

by Abdikhalyk T

2021年12月1日

by Peter D

2022年4月3日

by Jeffrey C

2022年5月15日

by Rafael C

2022年7月5日

by Billy C

2022年12月6日

by Alejandro M

2022年9月19日

by Vanshaj A

2022年11月19日

by Sandipan D

2022年11月27日