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 faz parte do Programa de cursos integrados Algoritmos
Graph Search, Shortest Paths, and Data Structures
oferecido por
Informações sobre o curso
73,129 visualizações recentes
Resultados de carreira do aprendiz
41%
comecei uma nova carreira após concluir estes cursos
48%
consegui um benefício significativo de carreira com este curso
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Curso 2 de 4 no
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Nível intermediário
Aprox. 12 horas para completar
Inglês
Legendas: Inglês
Habilidades que você terá
GraphsData StructureAlgorithmsHash Table
Resultados de carreira do aprendiz
41%
comecei uma nova carreira após concluir estes cursos
48%
consegui um benefício significativo de carreira com este curso
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Curso 2 de 4 no
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Nível intermediário
Aprox. 12 horas para completar
Inglês
Legendas: Inglês
oferecido por
Universidade 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 - O que você aprenderá com este curso
4 horas para concluir
Week 1
Breadth-first and depth-first search; computing strong components; applications.
4 horas para concluir
9 vídeos (Total 162 mín.), 4 leituras, 2 testes
9 videos
Breadth-First Search (BFS): The Basics14min
BFS and Shortest Paths7min
BFS and Undirected Connectivity13min
Depth-First Search (DFS): The Basics7min
Topological Sort21min
Computing Strong Components: The Algorithm29min
Computing Strong Components: The Analysis26min
Structure of the Web [Optional]18min
4 leituras
Week 1 Overview10min
Overview, Resources, and Policies10min
Lecture slides10min
Optional Theory Problems (Week 1)10min
2 exercícios práticos
Problem Set #110min
Programming Assignment #12min
2 horas para concluir
Week 2
Dijkstra's shortest-path algorithm.
2 horas para concluir
4 vídeos (Total 79 mín.), 2 leituras, 2 testes
4 videos
Dijkstra's Algorithm: Examples12min
Correctness of Dijkstra's Algorithm19min
Dijkstra's Algorithm: Implementation and Running Time26min
2 leituras
Week 2 Overview10min
Optional Theory Problems (Week 2)10min
2 exercícios práticos
Problem Set #210min
Programming Assignment #22min
3 horas para concluir
Week 3
Heaps; balanced binary search trees.
3 horas para concluir
9 vídeos (Total 142 mín.), 1 leitura, 2 testes
9 videos
Heaps: Operations and Applications18min
Heaps: Implementation Details [Advanced - Optional]20min
Balanced Search Trees: Operations and Applications10min
Binary Search Tree Basics, Part I13min
Binary Search Tree Basics, Part II30min
Red-Black Trees21min
Rotations [Advanced - Optional]7min
Insertion in a Red-Black Tree [Advanced]14min
1 leituras
Week 3 Overview10min
2 exercícios práticos
Problem Set #310min
Programming Assignment #32min
4 horas para concluir
Week 4
Hashing; bloom filters.
4 horas para concluir
9 vídeos (Total 171 mín.), 3 leituras, 3 testes
9 videos
Hash Tables: Implementation Details, Part I18min
Hash Tables: Implementation Details, Part II22min
Pathological Data Sets and Universal Hashing Motivation21min
Universal Hashing: Definition and Example [Advanced - Optional]25min
Universal Hashing: Analysis of Chaining [Advanced - Optional]18min
Hash Table Performance with Open Addressing [Advanced - Optional]15min
Bloom Filters: The Basics15min
Bloom Filters: Heuristic Analysis13min
3 leituras
Week 4 Overview10min
Optional Theory Problems (Week 4)10min
Info and FAQ for final exam10min
3 exercícios práticos
Problem Set #410min
Programming Assignment #42min
Final Exam20min
Avaliações
Principais avaliações do GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
por CSApr 12, 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 DSMar 29, 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 TGNov 30, 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 GMMay 21, 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
por JAOct 15, 2018
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.
por HCNov 11, 2017
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.
por HNJul 29, 2017
One of the greatest courses on this website. However, I believe this course will be more approachable if it contains more practical guide such as sample solution for algorithms.
por OSAug 3, 2019
Nice that this course gives ability to learn the inner implementation details of data structures. That was required for my work and was covered in the course on great level.
por JEDec 27, 2019
I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.
por KSAug 31, 2018
Learning algorithms is a must for all computer scientists. This course propels you on the path and kindles the spirit of inquiry and knack for finding better solutions.
por CFJan 20, 2018
Excellent video lectures. Great forums that discuss the problems and programming assignments. Challenging material, with satisfying rewards on finding solutions.
por KSJul 11, 2018
This is an excellent course. Though the assignments are quite challenging, it is rewarding to complete them. Professor Roughgarden's explanations are wonderful.
por GZFeb 9, 2019
This course is well useful. It helps me understand much I'm curious about. Thanks for teacher. He is quite good and I can't wait to enroll the third course!
por SLNov 2, 2019
Hope the professor could teach more about hashing and give a detailed implementation of some data structures or supply some interface template code.
por LTDec 8, 2019
this course is a lot more difficult and challenging than the first course because of the concepts are more abstract, but it's really interesting!
por NSJun 28, 2019
I like the content and structure of the course. Helped me understand data structures and algorithms even more. Excited to take future courses.
por SIMay 31, 2019
This course is making me a better programmer. I am more likely con consider the efficiency of my code, as opposed to just getting it to work.
por MKNov 26, 2018
It is very interesting course that gives an opportunity to improve the fundamental knowledge and skills that are connected with programming.
por JFJan 13, 2018
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
por NCJun 29, 2017
A brilliant. The first assignment was particularly challenging, and really really interesting. The rest of the course was pretty good too.
Sobre Programa de cursos integrados 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.
Perguntas Frequentes – FAQ
Quando terei acesso às palestras e às tarefas?
Ao se inscrever para um Certificado, você terá acesso a todos os vídeos, testes e tarefas de programação (se aplicável). Tarefas avaliadas pelos colegas apenas podem ser enviadas e avaliadas após o início da sessão. Caso escolha explorar o curso sem adquiri-lo, talvez você não consiga acessar certas tarefas.
O que recebo ao me inscrever nesta Especialização?
Quando você se inscreve no curso, tem acesso a todos os cursos na Especialização e pode obter um certificado quando concluir o trabalho. Seu Certificado eletrônico será adicionado à sua página de Participações e você poderá imprimi-lo ou adicioná-lo ao seu perfil no LinkedIn. Se quiser apenas ler e assistir o conteúdo do curso, você poderá frequentá-lo como ouvinte sem custo.
Qual é a política de reembolso?
Existe algum auxílio financeiro disponível?
Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.