- Algorithms
- Dynamic Programming
- Greedy Algorithm
- Divide And Conquer Algorithms
October 25, 2019
Approximately 2 months at 10 hours a week to completeAlvin Ali Khaled'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
Earned after completing each course in the Specialization
Stanford University
Taught by: Tim Roughgarden
Completed by: Alvin Ali Khaled by March 21, 2019
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Alvin Ali Khaled by May 11, 2019
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Alvin Ali Khaled by July 4, 2019
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Alvin Ali Khaled by October 25, 2019
4 weeks of study, 4-8 hours/week