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
Ofrecido Por
Acerca de este Curso
Habilidades que obtendrás
- Graphs
- Data Structure
- Algorithms
- Hash Table
Ofrecido por
Programa - Qué aprenderás en este curso
Week 1
Week 2
Week 3
Week 4
Reseñas
- 5 stars86,17 %
- 4 stars11,48 %
- 3 stars1,71 %
- 2 stars0,25 %
- 1 star0,36 %
Principales reseñas sobre GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
assignments didn't seem as interesting or complex as class 1, besides week 1 of class 2. Lecture material was high quality however, and the advanced optional material is appreciated
This is an excellent course. Though the assignments are quite challenging, it is rewarding to complete them. Professor Roughgarden's explanations are wonderful.
Very well put together course. Problem sets are tricky; however, by the end of the course, you feel quite accomplished and comfortable dealing with graphs and basic data structures.
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.
Acerca de Programa especializado: Algoritmos

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 Estudiante.