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
Graph Search, Shortest Paths, and Data Structures
ofrecido por
Acerca de este Curso
4.8
1,102 calificaciones
Habilidades que obtendrƔs
GraphsData StructureAlgorithmsHash Table
Programa - QuƩ aprenderƔs en este curso
Semana
14 horas para completar
Week 1
Breadth-first and depth-first search; computing strong components; applications.
9 videos (Total 162 minutos), 4 readings, 2 quizzes
9 videos
Breadth-First Search (BFS): The Basics14m
BFS and Shortest Paths7m
BFS and Undirected Connectivity13m
Depth-First Search (DFS): The Basics7m
Topological Sort21m
Computing Strong Components: The Algorithm29m
Computing Strong Components: The Analysis26m
Structure of the Web [Optional]18m
4 lecturas
Week 1 Overview10m
Overview, Resources, and Policies10m
Lecture slides10m
Optional Theory Problems (Week 1)10m
2 ejercicios de prƔctica
Problem Set #110m
Programming Assignment #12m
Semana
22 horas para completar
Week 2
Dijkstra's shortest-path algorithm.
4 videos (Total 79 minutos), 2 readings, 2 quizzes
4 videos
Dijkstra's Algorithm: Examples12m
Correctness of Dijkstra's Algorithm19m
Dijkstra's Algorithm: Implementation and Running Time26m
2 lecturas
Week 2 Overview10m
Optional Theory Problems (Week 2)10m
2 ejercicios de prƔctica
Problem Set #210m
Programming Assignment #22m
Semana
33 horas para completar
Week 3
Heaps; balanced binary search trees.
9 videos (Total 142 minutos), 1 reading, 2 quizzes
9 videos
Heaps: Operations and Applications18m
Heaps: Implementation Details [Advanced - Optional]20m
Balanced Search Trees: Operations and Applications10m
Binary Search Tree Basics, Part I13m
Binary Search Tree Basics, Part II30m
Red-Black Trees21m
Rotations [Advanced - Optional]7m
Insertion in a Red-Black Tree [Advanced]14m
1 lectura
Week 3 Overview10m
2 ejercicios de prƔctica
Problem Set #310m
Programming Assignment #32m
Semana
44 horas para completar
Week 4
Hashing; bloom filters.
9 videos (Total 171 minutos), 3 readings, 3 quizzes
9 videos
Hash Tables: Implementation Details, Part I18m
Hash Tables: Implementation Details, Part II22m
Pathological Data Sets and Universal Hashing Motivation21m
Universal Hashing: Definition and Example [Advanced - Optional]25m
Universal Hashing: Analysis of Chaining [Advanced - Optional]18m
Hash Table Performance with Open Addressing [Advanced - Optional]15m
Bloom Filters: The Basics15m
Bloom Filters: Heuristic Analysis13m
3 lecturas
Week 4 Overview10m
Optional Theory Problems (Week 4)10m
Info and FAQ for final exam10m
3 ejercicios de prƔctica
Problem Set #410m
Programming Assignment #42m
Final Exam20m
38%
comenzĆ³ una nueva carrera despuĆ©s de completar estos cursos
45%
consiguiĆ³ un beneficio tangible en su carrera profesional gracias a este curso
Principales revisiones
Interesting problems and explanations. But mathematical analysis is going off of my mind. It has very good explanation. Not sure, whether I can carry forward that knowledge or not.
Focused on principles and motivations behind algorithms. You might forget an algorithm you learned, but you will definitely be able to come up with one quickly after this course.
Instructor
Tim Roughgarden
ProfessorComputer Science
Acerca de 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.
Acerca del 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.
About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.
Preguntas Frecuentes
ĀæCuĆ”ndo podrĆ© acceder a las lecciones y tareas?
Una vez que te inscribes para obtener un Certificado, tendrĆ”s acceso a todos los videos, cuestionarios y tareas de programaciĆ³n (si corresponde). Las tareas calificadas por compaƱeros solo pueden enviarse y revisarse una vez que haya comenzado tu sesiĆ³n. Si eliges explorar el curso sin comprarlo, es posible que no puedas acceder a determinadas tareas.
ĀæQuĆ© recibirĆ© si me suscribo a este Programa especializado?
Cuando te inscribes en un curso, obtienes acceso a todos los cursos que forman parte del Programa especializado y te darĆ”n un Certificado cuando completes el trabajo. Se aƱadirĆ” tu Certificado electrĆ³nico a la pĆ”gina Logros. Desde allĆ, puedes imprimir tu Certificado o aƱadirlo a tu perfil de LinkedIn. Si solo quieres leer y visualizar el contenido del curso, puedes auditar el curso sin costo.
ĀæCuĆ”l es la polĆtica de reembolsos?
ĀæHay ayuda econĆ³mica disponible?
ĀæTienes mĆ”s preguntas? Visita el Centro de Ayuda al Alumno.
Coursera brinda acceso universal a la mejor educaciĆ³n del mundo, al asociarse con las mejores universidades y organizaciones, para ofrecer cursos en lĆnea.
Ā© 2019 Coursera Inc. Todos los derechos reservados.
