Chevron Left
Volver a Graph Search, Shortest Paths, and Data Structures

Opiniones y comentarios de aprendices correspondientes a Graph Search, Shortest Paths, and Data Structures por parte de Universidad de Stanford

1,891 calificaciones

Acerca del Curso

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

Principales reseñas


29 de mar. de 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.


30 de oct. de 2021

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.

Filtrar por:

201 - 224 de 224 revisiones para Graph Search, Shortest Paths, and Data Structures

por Garrett M

22 de may. de 2018

assignments didn't seem as interesting or complex as class 1, besides week 1 of class 2. Lecture material was high quality however, and the advanced optional material is appreciated

por Songmao L

3 de nov. de 2019

Hope the professor could teach more about hashing and give a detailed implementation of some data structures or supply some interface template code.

por Hao W

23 de mar. de 2021

The first programming assignment is most challenging, while the rest are easier. I expect the assignments are designed in a more consistent way.

por Joseph B

9 de ago. de 2018

This course was much harder than the first one. Plan to spend extra time doing the assignments. However, it is totally worth it!

por PLN R

17 de jun. de 2018

Great course! Best one for refreshing concepts! Can act as a starting point too! Absolutely love the explanation.

por Marko D

15 de ene. de 2020

Great coverage of graphs and basic implementations. Wish hash implementation was discussed in more details.

por Manu A

9 de feb. de 2020

more examples of hashing algorithms could have been introduced (like consistent hashing, Murmur hash etc.)

por Rudransh J

4 de may. de 2020

An exhaustive and engaging course. Recommended if you can work hard with dedication. Overall very nice

por Fan Y

1 de may. de 2018

The optional components seem to be important to answer the quizzes and questions for some weeks.

por Utsav S

27 de jul. de 2020

it helped me a lot specially the hash table content portion..Thanks a lot

por ALLA K R

15 de ene. de 2020

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

por Sandeep P

8 de sep. de 2018

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

por Toader A

6 de dic. de 2020

Mentor help is almost non-existent.

por Mohit S

28 de jun. de 2017


por Rakshit G

17 de dic. de 2016

Good learning

por Christophe K

29 de dic. de 2020


por Sudhanshu B

4 de mar. de 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.

por Michael B

7 de ago. de 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.

por Joern K

30 de ago. de 2018

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

por Nadanai L

30 de mar. de 2019

Wonderful material but some issues with programming assignments which need updating

por Tianyi Z

16 de jul. de 2018

The first programming assignment is just too bad.

por Prasanna M R

5 de abr. de 2017

good in depth knowedge.

por Aditya A

29 de jul. de 2020

the audio is not in sync with the video.