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).
Este curso forma parte de Programa especializado: Algoritmos
65.024 ya inscrito
ofrecido por
Programa especializado: AlgoritmosUniversidad de StanfordAcerca de este Curso
42.738 vistas recientes
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Curso 2 de 4 en
Nivel intermedio
Aprox. 15 horas para completar
Inglés (English)
Subtítulos: Árabe (Arabic), Francés (French), Portugués (europeo), Italiano, Vietnamita, Alemán (German), Ruso (Russian), Inglés (English), Español (Spanish)
Habilidades que obtendrás
GraphsData StructureAlgorithmsHash Table
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Curso 2 de 4 en
Nivel intermedio
Aprox. 15 horas para completar
Inglés (English)
Subtítulos: Árabe (Arabic), Francés (French), Portugués (europeo), Italiano, Vietnamita, Alemán (German), Ruso (Russian), Inglés (English), Español (Spanish)
ofrecido por
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.
Programa - Qué aprenderás en este curso
4 horas para completar
Week 1
Breadth-first and depth-first search; computing strong components; applications.
4 horas para completar
9 videos (Total 162 minutos), 4 lecturas, 2 cuestionarios
3 horas para completar
Week 2
Dijkstra's shortest-path algorithm.
3 horas para completar
4 videos (Total 79 minutos), 2 lecturas, 2 cuestionarios
4 horas para completar
Week 3
Heaps; balanced binary search trees.
4 horas para completar
9 videos (Total 142 minutos), 1 lectura, 2 cuestionarios
5 horas para completar
Week 4
Hashing; bloom filters.
5 horas para completar
9 videos (Total 171 minutos), 3 lecturas, 3 cuestionarios
Reseñas
Principales reseñas sobre GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
por CS12 de abr. de 2018
Good course, but instructor does start to move fast and a few walk-throughs in certain spots would be beneficial . However the lack of it makes you do your own research, which is also beneficial.
por DS29 de mar. de 2020
Awesome course! Professor Roughgarden is fantastic. The material was appropriately challenging. Perfect amount of rigor. Only one minor squabble: the hash problem set is terribly misleading.
por TG30 de nov. de 2019
It was an awesome experience to learn from such a teacher. Now I have a much clear view of the graph algorithms. I have enjoyed this course. Thanks to Stanford for offering this course.
por HL1 de mar. de 2021
There is very little hand-holding in this course and no code provided. This really challenges you to implement the ideas taught in the most efficient and appropriate manner possible.
Acerca de Programa especializado: Algoritmos
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.
Preguntas Frecuentes
¿Cuándo podré acceder a las lecciones y tareas?
¿Qué recibiré si me suscribo a este Programa especializado?
¿Hay ayuda económica disponible?
¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.
