Chevron Left
Zurück zu Graph Search, Shortest Paths, and Data Structures

Kursteilnehmer-Bewertung und -Feedback für Graph Search, Shortest Paths, and Data Structures von Stanford University

4.8
Sterne
1,569 Bewertungen
176 Bewertungen

Über den Kurs

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

Top-Bewertungen

DS

Mar 30, 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.

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.

Filtern nach:

126 - 150 von 175 Bewertungen für Graph Search, Shortest Paths, and Data Structures

von Luiz C

Mar 19, 2018

Fantastic course!

von Sui X

Jun 05, 2019

excellent course

von Bastin J

May 28, 2018

Fantastic Course

von Deleted A

Oct 15, 2017

Excellent course

von Khan M A

Jul 16, 2017

Very Nice Course

von luketerry

Jul 13, 2017

It's so helpful!

von 秦天

Jun 12, 2019

amazing course

von Karim E

Jan 15, 2018

Awesome course

von Rishabh K

Jan 11, 2018

just awesome!

von Ryan S

Jun 28, 2017

Great course

von Saurav M

Mar 22, 2019

NIce course

von Maxim M

Dec 08, 2019

brilliant!

von Misrab F

Jun 24, 2018

great fun!

von Madhurya R

Sep 14, 2019

Great job

von clayton w

Feb 03, 2019

excellent

von Neo

May 13, 2019

Awesome!

von goldkeytom

Jan 03, 2018

excelent

von ryan

Sep 25, 2017

Awesome!

von Yisheng Y

Dec 01, 2016

Awesome!

von Jingyuan W

Nov 13, 2019

Great!

von dynasty919

Feb 20, 2018

nice!

von Christopher E

Sep 21, 2019

The only reason this is not a 5-star review is because of the Week 4 programming assignment. The point of Week 4 is to demonstrate the usefulness of using a hash table when frequent look-ups are necessary. However, the constants inherent to the assignment problem make the suggested algorithm take anywhere from 30 min to hours. Meanwhile, there is another algorithm that can accomplish the task in mere seconds, but this is not apparent without scouring the message boards for help. I feel it would be better to either rethink the assignment to bring it more in line with the point of the teaching material, or deliver some instruction on the actually useful algorithm, which is fascinating in its own right.

Otherwise, this course is excellent as usual.

von Gonzalo G A E

Apr 22, 2020

In general, the specialization is great (it's challenging, full of interesting material, and the Prof. is interesting yet light to watch for hours in video). However, two of the programming exercises in this course seemed required solutions that were not related to the covered topics and for which the week's material provided sub-optimal (hence ultra slow) solutions. That was a bit frustrating. Nonetheless, it forced me to explore more about the algorithms, data structures and other solutions.

Still a great and challenging course!

von Sivaramakrishnan

May 11, 2020

Algorithms part of the course was phenomenal as always. But the Data Structure side of the course was (a bit of shuffling around the point?) little less engaging. I realize that DS is as important as Algorithms but is certainly not as fun to teach as Algorithms. Maybe the assignments and Quizzes could be restructured to make DS lessons more engaging. Just my 2 cents, otherwise Prof. Tim was cool as always!

von Ahmad B E

Jun 02, 2017

Great course for computer scientists. It is easy to understand but it takes too much time to be completed. The video lectures were long and full of too much explanation. And the week 4 programming assignment took very long running time to complete using the algorithm specified in the course but less time using other algorithms.