- Algorithms
- Dynamic Programming
- Greedy Algorithm
- Divide And Conquer Algorithms
September 9, 2020
Approximately 1 months at 10 hours a week to completeMohamed Ahmed Abdelfatah'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: Mohamed Ahmed Abdelfatah by July 23, 2020
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Mohamed Ahmed Abdelfatah by August 23, 2020
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Mohamed Ahmed Abdelfatah by September 5, 2020
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Mohamed Ahmed Abdelfatah by September 9, 2020
4 weeks of study, 4-8 hours/week