Для кого этот курс: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.


Автор:   Stanford University

  • Tim Roughgarden

    Преподаватели:    Tim Roughgarden, Associate Professor

    Computer Science
Основные сведения
УровеньIntermediate
Выполнение4 weeks of study, 4-8 hours/week
Язык
English
Как пройти курсЧтобы пройти курс, выполните все оцениваемые задания.
Оценки пользователей
Программа курса

Часто задаваемые вопросы
Как это работает
Задания курса
Задания курса

Каждый курс — это интерактивный учебник, который содержит видеоматериалы, тесты и проекты.

Помощь сокурсников
Помощь сокурсников

Общайтесь с тысячами других учащихся: обсуждайте идеи, материалы курса и помогайте друг другу осваивать новые понятия.

Сертификаты
Сертификаты

Получите документы о прохождении курсов и поделитесь своим успехом с друзьями, коллегами и работодателями.

Авторы
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.
Стоимость
ПрослушатьПриобрести курс
Получить доступ к материалам курса

Доступен

Доступен

Получить доступ к оцениваемым материалам курса

Недоступен

Доступен

Получить итоговую оценку

Недоступен

Доступен

Earn a Shareable Course Certificate

Недоступен

Доступен

Рейтинги и отзывы
Оценка 4.8 из 5 по 139 отзывам

The professor is amazing. He has the ability to present the material very clearly, concise, and with a good dose of humour! I would definitely recommend it to anyone interested in algorithms and data structures as an undergraduate or a professional.

This was another good one, providing a slightly deeper dive than I had seen in other courses. The big revelation here, for me, was the addition of Bellman-Ford algorithm for evaluating shortest path in networks (graphs) that have some negative distance values between nodes.

I also like the approach to data structures (high-level, then drilling down into increasing detail for level of interest) I find it hard to say I understand a data structure based on "Interface and Theory" and I would have felt the certification meant more with at least a rudimentary implementation. I guess that makes me a coder at at heart.

I am about to jump into the next course of the specialization: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming As with the two courses before, I am expecting new revelations about the kind of programming issues I've been solving for more than fifteen years.

A really good course

Useful refresher!