О специализации

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.

...
Globe

Только онлайн-курсы

Начните сейчас и учитесь по собственному графику.
Calendar

Гибкий график

Установите гибкие сроки сдачи заданий.
Intermediate Level

Промежуточный уровень

Clock

Approx. 4 months to complete

Suggested 7 hours/week
Comment Dots

English

Субтитры: English...

Приобретаемые навыки

AlgorithmsDynamic ProgrammingGreedy AlgorithmDivide And Conquer Algorithms
Globe

Только онлайн-курсы

Начните сейчас и учитесь по собственному графику.
Calendar

Гибкий график

Установите гибкие сроки сдачи заданий.
Intermediate Level

Промежуточный уровень

Clock

Approx. 4 months to complete

Suggested 7 hours/week
Comment Dots

English

Субтитры: English...

О специализации

Пройти курсы

Специализация Coursera — это серия курсов, помогающих в совершенстве овладеть определенным навыком. Можно сразу записаться на специализацию или просмотреть курсы, из которых она состоит и выбрать тот, с которого вы хотите начать. Подписываясь на курс, который входит в специализацию, вы автоматически подписываетесь на всю специализацию. Можно завершить всего один курс, а потом сделать паузу в обучении или в любой момент отменить подписку. Отслеживайте свои курсы и прогресс на панели управления учащегося.

Практический проект

В каждой специализации есть практический проект, который нужно успешно выполнить, чтобы завершить специализацию и получить сертификат. Если для практического проекта в специализации предусмотрен отдельный курс, прежде чем начать его, необходимо завершить все остальные курсы.

Получите сертификат

Когда вы пройдете все курсы и завершите практический проект, вы получите сертификат, которым можно поделиться с потенциальными работодателями и коллегами.

how it works

Специализация включает несколько курсов: 4

Курс1

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

4.8
Оценки: 2,017
Рецензии: 397
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts)....
Курс2

Graph Search, Shortest Paths, and Data Structures

4.8
Оценки: 886
Рецензии: 106
The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis)....
Курс3

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

4.8
Оценки: 560
Рецензии: 65
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees)....
Курс4

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

4.8
Оценки: 343
Рецензии: 41
The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search)....

Преподавателя

Tim Roughgarden

Professor
Computer Science

О Stanford University

The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States....

Часто задаваемые вопросы

  • Yes! To get started, click the course card that interests you and enroll. You can enroll and complete the course to earn a shareable certificate, or you can audit it to view the course materials for free. When you subscribe to a course that is part of a Specialization, you’re automatically subscribed to the full Specialization. Visit your learner dashboard to track your progress.

  • This course is completely online, so there’s no need to show up to a classroom in person. You can access your lectures, readings and assignments anytime and anywhere via the web or your mobile device.

  • This Specialization doesn't carry university credit, but some universities may choose to accept Specialization Certificates for credit. Check with your institution to learn more.

  • The Specialization has four four-week courses, for a total of sixteen weeks.

  • Learners should know how to program in at least one programming language (like C, Java, or Python); some familiarity with proofs, including proofs by induction and by contradiction; and some discrete probability, like how to compute the probability that a poker hand is a full house. At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors.

  • For best results, the courses should be taken in order.

  • Having taken your programming and thinking skills to the next level, you will be well positioned to ace your technical interviews, pursue serious software engineering, and study advanced topics in algorithms.

Остались вопросы? Посетите Центр поддержки учащихся.