Algorithms

Completed by Nicolae-Stelian Astefanoaie

January 20, 2019

4 weeks of study, 4-8 hours/week average per course

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

View certificate for Nicolae-Stelian Astefanoaie, Algorithms, offered through Coursera. In this specialization, learners developed a fundamental understanding algorithms and data structures. Learners studied general algorithm design paradigms and their applications, including divide-and-conquer,
greedy methods, and dynamic programming; how to use data structures; and how to recognize and tackle NP-hard problems.  Learners completed quizzes and programming assignments, and took an exam for each course.

Some online courses may draw on material from courses taught on-campus but they are not equivalent to on-campus courses. This statement does not affirm that this participant was enrolled as a student at Stanford university in any way. It does not confer a Stanford university grade, course credit or degree, and it does not verify the identity of the participant.

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

View this certificateChevron Right

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

View this certificateChevron Right

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

View this certificateChevron Right

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

View this certificateChevron Right