
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
Get more details
Visit official programme websiteProgramme 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.
Check out the full curriculum
Visit official programme websiteKey information
Duration
- Part-time
- 1 months
Start dates & application deadlines
Language
Delivered
Disciplines
Mathematics Computer Sciences View 51 other Short Courses in Mathematics in United StatesExplore more key information
Visit official programme websiteAcademic requirements
We are not aware of any specific GRE, GMAT or GPA grading score requirements for this programme.
English requirements
We are not aware of any English requirements for this programme.
Other requirements
General requirements
- Intermediate Level
Make sure you meet all requirements
Visit official programme websiteTuition Fee
-
International
FreeTuition FeeBased on the tuition of 0 USD for the full programme during 1 months. -
National
FreeTuition FeeBased 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.