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

Completed by Emil Bogomolov

December 6, 2020

14 hours (approximately)

Emil Bogomolov'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,272 ratings)

|

81,377 already enrolled

Enroll for Free

Skills you will gain

Computational Thinking
Algorithms
Theoretical Computer Science
Graph Theory
Bioinformatics
Data Structures

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