AlgorithmsDynamic ProgrammingGreedy AlgorithmDivide And Conquer Algorithms
Algorithms
Completed by Takayoshi Nishida
August 14, 2018
4 weeks of study, 4-8 hours/week average per course
Takayoshi Nishida'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: Takayoshi Nishida by April 7, 2018
4 weeks of study, 4-8 hours/week
Graph Search, Shortest Paths, and Data Structures
Stanford University
Taught by: Tim Roughgarden
Completed by: Takayoshi Nishida by May 9, 2018
4 weeks of study, 4-8 hours/week
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Stanford University
Taught by: Tim Roughgarden
Completed by: Takayoshi Nishida by June 25, 2018
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: Takayoshi Nishida by August 14, 2018
4 weeks of study, 4-8 hours/week
Coursera Footer
© 2020 Coursera Inc. All rights reserved.
