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).
Этот курс входит в специализацию ''Специализация Алгоритмы'
от партнера
Об этом курсе
Приобретаемые навыки
- Graphs
- Data Structure
- Algorithms
- Hash Table
от партнера
Программа курса: что вы изучите
Week 1
Week 2
Week 3
Week 4
Рецензии
- 5 stars86,17 %
- 4 stars11,48 %
- 3 stars1,71 %
- 2 stars0,25 %
- 1 star0,36 %
Лучшие отзывы о курсе GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
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.
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.
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.
This is an excellent course. Though the assignments are quite challenging, it is rewarding to complete them. Professor Roughgarden's explanations are wonderful.
Специализация Алгоритмы: общие сведения

Часто задаваемые вопросы
Когда я получу доступ к лекциям и заданиям?
Что я получу, оформив подписку на специализацию?
Можно ли получить финансовую помощь?
Остались вопросы? Посетите Центр поддержки учащихся.