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 Algorithms
Graph Search, Shortest Paths, and Data Structures
oferecido por
Informações sobre o curso
4.8
913 classificações
Habilidades que você terá
GraphsData StructureAlgorithmsHash Table
Programa - O que você aprenderá com este curso
Semana
1Week 1
Breadth-first and depth-first search; computing strong components; applications.
9 vídeos (Total de 162 min), 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
Semana
2Week 2
Dijkstra's shortest-path algorithm.
4 vídeos (Total de 79 min), 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
Semana
3Week 3
Heaps; balanced binary search trees.
9 vídeos (Total de 142 min), 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
Semana
4Week 4
Hashing; bloom filters.
9 vídeos (Total de 171 min), 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
4.8
33%
83%
Melhores avaliações
por JA•Oct 16th 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 HC•Nov 12th 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.
Instrutores
Tim Roughgarden
ProfessorComputer Science
Sobre Stanford University
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.
Sobre o Programa de cursos integrados Algorithms
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.
O Coursera proporciona acesso universal à melhor educação do mundo fazendo parcerias com as melhores universidades e organizações para oferecer cursos on-line.
© 2018 Coursera Inc. Todos os direitos reservados.
