- Algorithms
- Dynamic Programming
- Greedy Algorithm
- Divide And Conquer Algorithms
Algorithms
Completed by Nicolae-Stelian Astefanoaie
January 20, 2019
Approximately 4 months at 4 hours a week to completeNicolae-Stelian Astefanoaie's account is verified. Coursera certifies their successful completion of Stanford University Algorithms Specialization.
Course Certificates Completed
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Graph Search, Shortest Paths, and Data Structures
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Skills you will gain
Course Certificates
Earned after completing each course in the Specialization
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University
Taught by: Tim Roughgarden
Completed by: Nicolae-Stelian Astefanoaie by October 21, 2016
4 weeks of study, 4-8 hours/week
Graph Search, Shortest Paths, and Data Structures
Stanford University
Taught by: Tim Roughgarden
Completed by: Nicolae-Stelian Astefanoaie by December 8, 2016
4 weeks of study, 4-8 hours/week
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Stanford University
Taught by: Tim Roughgarden
Completed by: Nicolae-Stelian Astefanoaie by August 19, 2017
4 weeks of study, 4-8 hours/week
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University
Taught by: Tim Roughgarden
Completed by: Nicolae-Stelian Astefanoaie by January 20, 2019
4 weeks of study, 4-8 hours/week
Coursera Footer
© 2023 Coursera Inc. All rights reserved.
