Para quién es esta clase: 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.


Creada por:   Universidad de Stanford

Información básica
Curso 2 de 4 en el Programa especializado Algorithms.
NivelIntermediate
Compromiso4 weeks of study, 4-8 hours/week
Idioma
English
Cómo aprobarAprueba todas las tareas calificadas para completar el curso.
Calificaciones del usuario
4.8 stars
Average User Rating 4.8Ve los que los estudiantes dijeron
Programa

Preguntas Frecuentes
Cómo funciona
Trabajo del curso
Trabajo del curso

Cada curso es como un libro de texto interactivo, con videos pregrabados, cuestionarios y proyectos.

Ayuda de tus compañeros
Ayuda de tus compañeros

Conéctate con miles de estudiantes y debate ideas y materiales del curso, y obtén ayuda para dominar los conceptos.

Certificados
Certificados

Obtén reconocimiento oficial por tu trabajo y comparte tu éxito con amigos, compañeros y empleadores.

Creadores
Universidad de Stanford
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.
Tarifa
AuditarComprar curso
Accede a los materiales del curso

Disponible

Disponible

Accede a los materiales con calificación

No disponible

Disponible

Recibe una calificación final

No disponible

Disponible

Earn a Shareable Course Certificate

No disponible

Disponible

Calificaciones y revisiones
Calificado 4.8 de 5 138 calificaciones

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!

I learned a lot lot lot, no more to say. Fantastic.