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).
Informações sobre o curso
Habilidades que você terá
- 5 stars86,17%
- 4 stars11,48%
- 3 stars1,71%
- 2 stars0,25%
- 1 star0,36%
Principais avaliações do GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
The course was very interesting. As a person who struggles with problem-solving, I found this course very helpful because the professor's ideas are well explained. It makes me to learn more.
Very useful information for thorough programmers. Especially liked analysis of hash tables implementation and handling collisions in real applications.
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.
There is very little hand-holding in this course and no code provided. This really challenges you to implement the ideas taught in the most efficient and appropriate manner possible.
Sobre Programa de cursos integrados Algoritmos
Perguntas Frequentes – FAQ
Quando terei acesso às palestras e às tarefas?
O que recebo ao me inscrever nesta Especialização?
Existe algum auxílio financeiro disponível?
Mais dúvidas? Visite o Central de Ajuda ao estudante.