Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming, Certificate | Part time online | Coursera | United States
Studyportals
Certificate Online

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

1 months
Duration
Free
Free
Unknown
Tuition fee
Anytime
Unknown
Apply date
Anytime
Unknown
Start date

About

The Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming course offered by Coursera in partnership with Stanford is part of the Algorithms Specialization.

Visit the official programme website for more information

Overview

The primary topics in this part of the Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming course offered by Coursera in partnership with Stanford  are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).

Skills You Will Gain

  • Spanning Tree
  • Algorithms
  • Dynamic Programming
  • Greedy Algorithm

Programme Structure

Courses included:

  • Week 1

Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

  • Week 2

Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).

  • Week 3

Huffman codes; introduction to dynamic programming.

  • Week 4

Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

Key information

Duration

  • Part-time
    • 1 months

Start dates & application deadlines

You can apply for and start this programme anytime.

Language

English

Delivered

Online

Academic requirements

We are not aware of any academic requirements for this programme.

English requirements

We are not aware of any English requirements for this programme.

Other requirements

General requirements

  • Intermediate Level

Tuition Fee

To alway see correct tuition fees
  • International

    Free
    Tuition Fee
    Based on the tuition of 0 USD for the full programme during 1 months.
  • National

    Free
    Tuition Fee
    Based on the tuition of 0 USD for the full programme during 1 months.

You can choose from hundreds of free courses, or get a degree or certificate at a breakthrough price. You can now select Coursera Plus, an annual subscription that provides unlimited access.

Funding

Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You'll be prompted to complete an application and will be notified if you are approved. You'll need to complete this step for each course in the Specialization, including the Capstone Project. 

Studyportals Tip: Students can search online for independent or external scholarships that can help fund their studies. Check the scholarships to see whether you are eligible to apply. Many scholarships are either merit-based or needs-based.

Our partners

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
-
Coursera

Wishlist

Go to your profile page to get personalised recommendations!