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

Completed by Pouya Lajevardi

December 1, 2021

14 hours (approximately)

Pouya Lajevardi'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,562 already enrolled

Enroll for Free

Skills you will gain

Graph Theory
Bioinformatics
Computational Thinking
Data Structures
Theoretical Computer Science
Algorithms

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