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).
ofrecido por
Programa Especializado - AlgoritmosUniversidad de StanfordAcerca de este Curso
94,420 vistas recientes
Resultados profesionales del estudiante
41%
comenzó una nueva carrera después de completar estos cursos
48%
consiguió un beneficio tangible en su carrera profesional gracias a este curso
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
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Nivel intermedio
Aprox. 12 horas para completar
Inglés (English)
Subtítulos: Inglés (English)
Habilidades que obtendrás
GraphsData StructureAlgorithmsHash Table
Resultados profesionales del estudiante
41%
comenzó una nueva carrera después de completar estos cursos
48%
consiguió un beneficio tangible en su carrera profesional gracias a este curso
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
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Nivel intermedio
Aprox. 12 horas para completar
Inglés (English)
Subtítulos: Inglés (English)
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
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
2 horas para completar
Week 2
Dijkstra's shortest-path algorithm.
2 horas para completar
4 videos (Total 79 minutos), 2 lecturas, 2 cuestionarios
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
3 horas para completar
Week 3
Heaps; balanced binary search trees.
3 horas para completar
9 videos (Total 142 minutos), 1 lectura, 2 cuestionarios
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
4 horas para completar
Week 4
Hashing; bloom filters.
4 horas para completar
9 videos (Total 171 minutos), 3 lecturas, 3 cuestionarios
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
Revisiones
Principales revisiones 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 GM21 de may. de 2018
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
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.
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
When will I have access to the lectures and assignments?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
What will I get if I subscribe to this Specialization?
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
What is the refund policy?
If you subscribed, you get a 7-day free trial during which you can cancel at no penalty. After that, we don’t give refunds, but you can cancel your subscription at any time. See our full refund policy.
Is financial aid available?
Yes, Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You'll be prompted to complete an application and will be notified if you are approved. You'll need to complete this step for each course in the Specialization, including the Capstone Project. Learn more.
¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.
© 2020 Coursera Inc. Todos los derechos reservados.
