When you enroll through our links, we may earn a small commission—at no extra cost to you. This helps keep our platform free and inspires us to add more value.

University of Colorado Boulder logo

Dynamic Programming, Greedy Algorithms

This course is part of Foundations of Data Structures and Algorithms Specialization

     
  • 4.5
  •  |
  • Reviews ( 91 )
Free

This Course Includes

  • iconcoursera
  • icon4.5 (91 reviews )
  • icon37 hours (approximately)
  • iconenglish
  • iconOnline - Self Paced
  • iconcourse
  • iconUniversity of Colorado Boulder

About Dynamic Programming, Greedy Algorithms

Learn new concepts from industry experts

Gain a foundational understanding of a subject or tool

Develop job-relevant skills with hands-on projects

Earn a shareable career certificate

What You Will Learn?

  • Describe basic algorithm design techniques.
  • Create divide and conquer, dynamic programming, and greedy algorithms.
  • Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems.