Coursera | Online Courses & Credentials From Top Educators. Join for Free | Coursera

Completed by Krunal Shah

April 24, 2020

14 hours (approximately)

Krunal Shah's account is verified. Coursera certifies their successful completion of Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Stanford University

4.8 (1,274 ratings)

|

81,591 already enrolled

Enroll for Free

Skills you will gain

Graph Theory
Theoretical Computer Science
Bioinformatics
Data Structures
Algorithms
Computational Thinking

View certificate for Krunal Shah, Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming, an online non-credit course authorized by Stanford University and offered through Coursera