4.8 ⭐️, 5.5k+ ratings on Coursera
93% 👍, 115.2k+ students enrolled
Course Description
“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.
About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.
Applied Learning Project
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.”
Course Outline
Course 1: Divide and Conquer, Sorting and Searching, and Randomized Algorithms • 16 hours • 4.8 ⭐️ (5.1k+ ratings)
Course 2: Graph Search, Shortest Paths, and Data Structures • 15 hours • 4.8 ⭐️ (1.9k+ ratings)
Course 3: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming • 15 hours • 4.8 ⭐️ (1.2k+ ratings)
Course 4: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them • 13 hours • 4.8 ⭐️ (800+ ratings)
Be sure to visit the link above to learn more.