Course description
Algorithms Specialization
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.
Do you work at this organisation and want to update this page?
Is there out-of-date information about your organisation or courses published here? Fill out this form to get in touch with us.
Upcoming start dates
Suitability - Who should attend?
Some related experience required.
Outcome / Qualification etc.
Learners will practice and master the fundamentals of algorithms through several types of assessments. Every week, there is a multiple choice quiz to test your understanding of the most important concepts. There are also weekly programming assignments, where you implement one of the algorithms covered in lecture in a programming language of your choosing. Each course concludes with a multiple-choice final exam.
Training Course Content
- 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 The
Course delivery details
This course is offered through Stanford University, a partner institute of Coursera.
Suggested pace of 4 hours/week
Expenses
Please visit the Institute website for more information about tuition fees