Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Enrich your understanding of Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming.
Intermediate
Online
1 Weeks
1,699 INR Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study | Video and Text Based |
Course Overview
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming is an online programme provided by Stanford University that will help the learners to have a solid understanding of greedy algorithms and dynamic programming. Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming Certification Syllabus will walk the student through many concepts including scheduling, minimum spanning trees, knapsack, sequence alignment, and the like.
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming Certification Course, offered by Coursera, is an intermediate course that is the third in the four courses of Algorithms Specialization. Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming Certification by Coursera is structured in a fashion in which the students can decide the deadline on their own and can be completed within about 1 week.
The Highlights
- Provided by Coursera
- Approximately 1 week of programme
- Offered by Stanford University
- Flexible Deadlines
- Self-Paced Learning Option
- Shareable Certificate
- Financial Aid Available
- 100% Online Course
Programme Offerings
- English videos with multiple subtitles
- practice quizzes
- Graded Assignments with peer feedback
- graded Quizzes with feedback
- Graded Programming Assignments
- course videos
- Readings
- EMI payment options
- 14 day refund period.
Courses and Certificate Fees
| Certificate Availability | Certificate Providing Authority |
|---|---|
| yes | Coursera |
The fees for the Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming course is :
Fees components | Amount |
1 month | Rs. 1,699 |
3 months | Rs. 5,199 |
6 months | Rs. 5,199 |
Eligibility Criteria
Certification Qualifying Details
To get hold of the Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming Certification, the candidates must finish the whole process of the programme properly including the course materials and readings, graded assignments, and quizzes.
What you will learn
After the completion of the Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming Training, the learners will be able to have a deep knowledge of the following:
- Spanning Tree
- Algorithms
- Dynamic Programming
- Greedy Algorithm
- Sequence alignment
- Optimal search trees
Who it is for
The Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming training gets fruitful for those who want to programmers like Java Programmers, PHP Programmers, Python Programmers, and Computer Programmer.
Admission Details
Step 1 -First, the learners will need to register and sign up on https://www.coursera.org/ to get access to the programme available on Coursera.
Step 2 - After activating the Coursera account, the candidate can sign in.
Step 3 - Then, the candidate can search the ‘Stanford University’ in the search column, and then, the programmes provided by the Stanford University will appear on the screen.
Step 4 - Then, find the course ‘Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming’ in the list and click on it.
Step 5- Then, the page of the course will appear on the screen, and then, click on the option ‘enroll’. The students can enroll either by paying the fee and getting full access to the course or just auditing free of cost.
The Syllabus
Videos
- Application: Internet Routing
- Application: Sequence Alignment
- Introduction to Greedy Algorithms
- Application: Optimal Caching
- Problem Definition
- A Greedy Algorithm
- Correctness Proof - Part I
- Correctness Proof - Part II
- Handling Ties [Advanced - Optional]
- MST Problem Definition
- Prim's MST Algorithm
- Correctness Proof I
- Correctness Proof II
- Proof of Cut Property [Advanced - Optional]
- Fast Implementation I
- Fast Implementation II
Readings
- Week 1 Overview
- Overview, Resources, and Policies
- Lecture slides
- Optional Theory Problems (Week 1)
Quizzes
- Problem Set #1
- Programming Assignment #1
Videos
- Kruskal's MST Algorithm
- Correctness of Kruskal's Algorithm
- Implementing Kruskal's Algorithm via Union-Find I
- Implementing Kruskal's Algorithm via Union-Find II
- MSTs: State-of-the-Art and Open Questions [Advanced - Optional]
- Application to Clustering
- Correctness of Clustering Algorithm
- Lazy Unions [Advanced - Optional]
- Union-by-Rank [Advanced - Optional]
- Analysis of Union-by-Rank [Advanced - Optional]
- Path Compression [Advanced - Optional]
- Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]
- Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional]
- The Ackermann Function [Advanced - Optional]
- Path Compression: Tarjan's Analysis I [Advanced - Optional]
- Path Compression: Tarjan's Analysis II [Advanced - Optional
Readings
- Week 2 Overview
- Optional Theory Problems (Week 2)
Quizzes
- Problem Set #2
- Programming Assignment #2
Videos
- Introduction and Motivation
- Problem Definition
- A Greedy Algorithm
- A More Complex Example
- Correctness Proof I
- Correctness Proof II
- Introduction: Weighted Independent Sets in Path Graphs
- WIS in Path Graphs: Optimal Substructure
- WIS in Path Graphs: A Linear-Time Algorithm
- WIS in Path Graphs: A Reconstruction Algorithm
- Principles of Dynamic Programming
Readings
- Week 3 Overview
Quizzes
- Problem Set #3
- Programming Assignment #3
Videos
- The Knapsack Problem
- A Dynamic Programming Algorithm
- Example [Review - Optional]
- Optimal Substructure
- A Dynamic Programming Algorithm
- Problem Definition
- Optimal Substructure
- Proof of Optimal Substructure
- A Dynamic Programming Algorithm I
- A Dynamic Programming Algorithm II
Readings
- Week 4 Overview
- Optional Theory Problems (Week 4)
- Info and FAQ for final exam
Quizzes
- Problem Set #4
- Programming Assignment #4
- Final Exam
Instructors
Stanford Frequently Asked Questions (FAQ's)
The course is tutored by Tim Roughgarden who is a Professor of Computer Science.
Yes, Coursera provides the installment mode for the payment of the fee.
The subtitles are provided in the languages of Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, and Spanish.
The course is fully provided in the 100% online mode.
The course is offered by Stanford University.