Chevron Left
Вернуться к Graph Search, Shortest Paths, and Data Structures

Отзывы учащихся о курсе Graph Search, Shortest Paths, and Data Structures от партнера Стэнфордский университет

4.8
звезд
Оценки: 1,493
Рецензии: 164

О курсе

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)....

Лучшие рецензии

TG

Dec 01, 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.

JA

Oct 16, 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.

Фильтр по:

151–160 из 160 отзывов о курсе Graph Search, Shortest Paths, and Data Structures

автор: ALLA K R

Jan 15, 2020

i understand algorithms very well thank u for learning me more detail

автор: Sandeep P

Sep 08, 2018

Very nice introduction to Graph Search. Thanks to the instructors!

автор: Mohit S

Jun 28, 2017

NICE CONTENT.

автор: Rakshit G

Dec 17, 2016

Good learning

автор: Sudhanshu B

Mar 04, 2020

I feel it is an ok course, however the assignments can be made better. The assignments in Alogorithms offered by princeton are more interesting and meaningful.

автор: Michael B

Aug 07, 2017

Some of the problem sets were a little fiddly. Especially the last one, which was crushingly terrible if you tried to actual use the solution he told you to.

автор: Joern K

Aug 30, 2018

Sometimes badly synchronized, there are also mistakes in the videos which haven't been corrected.

автор: Nadanai L

Mar 30, 2019

Wonderful material but some issues with programming assignments which need updating

автор: Tianyi Z

Jul 16, 2018

The first programming assignment is just too bad.

автор: Prasanna M R

Apr 05, 2017

good in depth knowedge.