Chevron Left
Back to Dynamic Programming, Greedy Algorithms

Learner Reviews & Feedback for Dynamic Programming, Greedy Algorithms by University of Colorado Boulder

4.6
stars
125 ratings

About the Course

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. This course can be taken for academic credit as part of CU Boulder’s MS in Data Science or MS in Computer Science degrees offered on the Coursera platform. These fully accredited graduate degrees offer targeted courses, short 8-week sessions, and pay-as-you-go tuition. Admission is based on performance in three preliminary courses, not academic history. CU degrees on Coursera are ideal for recent graduates or working professionals. Learn more: MS in Data Science: https://www.coursera.org/degrees/master-of-science-data-science-boulder MS in Computer Science: https://coursera.org/degrees/ms-computer-science-boulder...

Top reviews

RW

Invalid date

Amazing opportunity to learn! A Stanford graduate as a professor, OMG! Super bright!

DM

Invalid date

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

Filter by:

26 - 39 of 39 Reviews for Dynamic Programming, Greedy Algorithms

By Vanshaj A

•

Nov 19, 2022

Great course

By Fleming P

•

Mar 8, 2024

Excellent!

By Sandipan D

•

Nov 27, 2022

Excellent!

By Ashutosh K S

•

Jun 1, 2024

good

By Aarti K

•

May 4, 2024

good

By Gadam R R

•

Oct 12, 2023

good

By YARLAGADDA R N

•

Oct 11, 2023

good

By MARLA - K

•

Sep 23, 2024

NA

By Jaideep Y

•

May 29, 2024

it was an outstanding course

By Guddu K D

•

Apr 11, 2024

thank you sir

By Chaudhary D D K

•

Sep 22, 2024

Good

By Pious S M

•

May 29, 2024

Good

By JARUGULLA R

•

Oct 25, 2023

Most of the code is found on internet so try to give hard questions which are not found in Internet........thank you

By James T

•

Mar 10, 2024

Long and boring...