Chevron Left
Volver a Dynamic Programming, Greedy Algorithms

Opiniones y comentarios de aprendices correspondientes a Dynamic Programming, Greedy Algorithms por parte de Universidad de Colorado en Boulder

4.4
estrellas
43 calificaciones

Acerca del Curso

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....

Principales reseñas

AM

18 de sep. de 2022

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

20 de sep. de 2021

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

Filtrar por:

1 - 12 de 12 revisiones para Dynamic Programming, Greedy Algorithms

por Spyros T

26 de oct. de 2021

por Dave M

21 de sep. de 2021

por Bijan S

14 de dic. de 2021

por Rishabh S

5 de ago. de 2021

por Yu S

23 de jul. de 2022

por Abdikhalyk T

1 de dic. de 2021

por Peter D

3 de abr. de 2022

por Jeffrey C

15 de may. de 2022

por Rafael C

5 de jul. de 2022

por Alejandro M

19 de sep. de 2022

por Vanshaj A

19 de nov. de 2022

por Sandipan D

27 de nov. de 2022