Para quem é direcionado este curso: 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.


Desenvolvido por:   Stanford University

  • Tim Roughgarden

    Ministrado por:    Tim Roughgarden, Associate Professor

    Computer Science
Basic Info
Course 2 of 4 in the Algorithms Specialization.
LevelIntermediate
Commitment4 weeks of study, 4-8 hours/week
Language
English
How To PassPass all graded assignments to complete the course.
User Ratings
4.8 stars
Average User Rating 4.8See what learners said
Programa

Perguntas frequentes
Como funciona
Trabalho
Trabalho

Cada curso é como um livro didático interativo, com vídeos pré-gravados, testes e projetos.

Ajuda dos seus colegas
Ajuda dos seus colegas

Conecte-se com milhares de outros aprendizes, debata ideias, discuta sobre os materiais do curso e obtenha ajuda para dominar conceitos.

Certificados
Certificados

Obtenha reconhecimento oficial pelo seu trabalho e compartilhe seu sucesso com amigos, colegas e empregadores.

Desenvolvedores
Stanford University
Custo
Participar como ouvinteComprar curso
Acesso aos materiais do curso

Disponível

Disponível

Acesso a materiais valendo nota

Não disponível

Disponível

Receba uma nota final

Não disponível

Disponível

Obtenha um certificado compartilhável

Não disponível

Disponível

Classificações e avaliações
Avaliado em 4.8 de 5 decorrente de 112 avaliações

Thank you professor and mentors for making this a great course! Very useful data structures and algorithms for every software professional. This course is well balanced between theory and practical programming questions!

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!



Compartilhar