University of Colorado Boulder
Dynamic Programming, Greedy Algorithms
University of Colorado Boulder

Dynamic Programming, Greedy Algorithms

27,886 already enrolled

Included with Coursera Plus

Gain insight into a topic and learn the fundamentals.
4.6

(165 reviews)

Advanced level

Recommended experience

Flexible schedule
Approx. 37 hours
Learn at your own pace
89%
Most learners liked this course
Gain insight into a topic and learn the fundamentals.
4.6

(165 reviews)

Advanced level

Recommended experience

Flexible schedule
Approx. 37 hours
Learn at your own pace
89%
Most learners liked this course

What you'll 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

Details to know

Shareable certificate

Add to your LinkedIn profile

Assessments

17 quizzes

Taught in English

See how employees at top companies are mastering in-demand skills

Placeholder

Build your subject-matter expertise

This course is part of the Foundations of Data Structures and Algorithms Specialization
When you enroll in this course, you'll also be enrolled in this Specialization.
  • 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
Placeholder
Placeholder

Earn a career certificate

Add this credential to your LinkedIn profile, resume, or CV

Share it on social media and in your performance review

Placeholder

There are 4 modules in this course

We will formally cover divide and conquer algorithms as a design scheme and look at some divide and conquer algorithms we have encountered in the past. We will learn some divide and conquer algorithms for Integer Multiplication (Karatsuba’s Algorithm), Matrix Multiplication (Strassen’s Algorithm), Fast Fourier Transforms (FFTs), and Finding Closest Pair of Points.

What's included

9 videos13 readings5 quizzes1 programming assignment1 discussion prompt

In this module, you will learn about dynamic programming as a design principle for algorithms. We will provide a step-by-step approach to formulating a problem as a dynamic program and solving these problems using memoization. We will cover dynamic programming for finding longest common subsequences, Knapsack problem and some interesting dynamic programming applications.

What's included

6 videos6 readings5 quizzes1 programming assignment

In this module, we will learn about greedy algorithms. We will understand the basic design principles for greedy algorithms and learn about a few algorithms for greedy scheduling and Huffman codes. We will also learn some interesting cases when being greedy provides a guaranteed approximation to the actual solution.

What's included

5 videos4 readings3 quizzes1 programming assignment

P vs NP, Examples such as Travelling Salesperson Problem, Vertex Cover, 3-Coloring and others; Integer Linear Programming and Translating Problems into Integer Programming.

What's included

9 videos5 readings4 quizzes1 programming assignment

Instructor

Instructor ratings
4.6 (42 ratings)
Sriram Sankaranarayanan
University of Colorado Boulder
5 Courses69,664 learners

Offered by

Recommended if you're interested in Algorithms

Build toward a degree

This course is part of the following degree program(s) offered by University of Colorado Boulder. If you are admitted and enroll, your completed coursework may count toward your degree learning and your progress can transfer with you.¹

Why people choose Coursera for their career

Felipe M.
Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
Jennifer J.
Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
Larry W.
Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
Chaitanya A.
"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."

Learner reviews

Showing 3 of 165

4.6

165 reviews

  • 5 stars

    77.71%

  • 4 stars

    14.45%

  • 3 stars

    3.01%

  • 2 stars

    1.80%

  • 1 star

    3.01%

RW
5

Reviewed on Apr 5, 2024

AB
4

Reviewed on Nov 5, 2024

BC
5

Reviewed on Dec 6, 2022

New to Algorithms? Start here.

Placeholder

Open new doors with Coursera Plus

Unlimited access to 7,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription

Advance your career with an online degree

Earn a degree from world-class universities - 100% online

Join over 3,400 global companies that choose Coursera for Business

Upskill your employees to excel in the digital economy

Frequently asked questions