- Algorithms
- Theoretical Computer Science
- Computer Programming
- Problem Solving
- Graph Theory
- Mathematics
- Data Structures
- Mathematical Theory & Analysis
- Critical Thinking
- Programming Principles
- Software Engineering
December 19, 2021
Approximately 2 months at 10 hours a week to completeMartin Tumwine'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: Martin Tumwine by December 19, 2021
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Martin Tumwine by December 19, 2021
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Martin Tumwine by December 19, 2021
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Martin Tumwine by December 19, 2021
4 weeks of study, 4-8 hours/week