Tim Roughgarden
9.1/10
(Our Score)
Product is rated as #13 in category Data Structures and Algorithms
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). The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180–acre (3,310 ha) campus near Palo Alto, California, United States.
Instructor Details
Votes: 0
Courses : 5
Specification: Graph Search, Shortest Paths, and Data Structures
|
52 reviews for Graph Search, Shortest Paths, and Data Structures
Show all
Most Helpful
Highest Rating
Lowest Rating
Add a review
| Price | Free |
|---|---|
| Provider | |
| Duration | 18 hours |
| Year | 2016 |
| Level | Intermediate |
| Language | English |
| Certificate | Yes |
| Quizzes | Yes |
Graph Search, Shortest Paths, and Data Structures
FREE
Yifeng L –
More challenging than first course, very good for beginners. Specially useful for those not in CS major.
Mikhail K –
It is very interesting course that gives an opportunity to improve the fundamental knowledge and skills that are connected with programming.
Anton B –
Awesome. Thought one improvement idea: when the questions are asked about some dataset shown in a picture it would be nice to retain the picture when the form is shown. Otherwise one need to rewind to recall the dataset.
Garrett S –
Love the course and the instructor. The projects are very interesting, though the first one took a lot of effort to keep from crashing.
Ning K –
Super super cool explanation of the shortest path, minimum spanning tree, and all other algorithms!
clayton w –
excellent
Genyu Z –
This course is well useful. It helps me understand much I’m curious about. Thanks for teacher. He is quite good and I can’t wait to enroll the third course!
Bianca D –
Great course; especially on Data Structures and when certain ones are appropriate. I do wish the final exam solutions would be posted after completing the exam successfully in the same way the problem set solutions, hints and comments are provided.
Saurav M –
NIce course
Nicolas T –
Another great, in depth, course on algorithms. Now that the book is also available it’s even better. Please just rework the assignment of week 4, it is unrelated to the week’s lecture if you want to complete it in a reasonable time.
Nadanai L –
Wonderful material but some issues with programming assignments which need updating
Yuanzhan W –
A good introduction to graph search algorithms
Neo –
Awesome!
Stacy I –
This course is making me a better programmer. I am more likely con consider the efficiency of my code, as opposed to just getting it to work.
Sui X –
excellent course
Ishan B –
Best professor I have ever had.
Neil S –
I like the content and structure of the course. Helped me understand data structures and algorithms even more. Excited to take future courses.
Krishna K –
I think this is an excellent class. However, I really needed to both watch these AND read Cormen’s Algorithms textbook to understand and grasp the concpets (And even answer the quizes). I think the pseudo code could be better guided as it is a struggle to really understand what it is supposed to contain. I think a nice additional feature that should be added to the class is a solutions explanations for the quizzes and final exams. This should only be unlocked after passing the quiz, but it would be useful as an aid to understanding why the solution is right, rather than just guessing. Some other coursera classes do these, and I think for this class in particular, it would be a big help.
Aishwarya R –
Learnt about graphs, trees, heaps, hashing! The course is enlightening.
Oleksandr S –
Nice that this course gives ability to learn the inner implementation details of data structures. That was required for my work and was covered in the course on great level.
Mario R G –
Magnificent, well structured and explained, with some creative ways to see algorithms. The only thing I would recommend is to use additional references for the graphs section, CLRS and KT for example helped me a lot.
Jingxuan W –
the later graph algorithms are implemented rather cursory. It is quite hard for us to implement it at home using a “big idea” as given in the video. I wish the instructor could give us some intuitions of how Java, C++, or Python handle the case.
Pratik P –
Really cleared some vital concepts on Data Strucctures
Madhurya R –
Great job
Frank J M –
Great course. The programming problems really added to the material.
Christopher E –
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.
Xiaohui X –
Excellent course !!! Thank you, dear professor !
Venkatesh M S –
Surely a tough one to go through. Not so if you are a level 2 or 3 programmer as mentioned by Tim.
Songmao L –
Hope the professor could teach more about hashing and give a detailed implementation of some data structures or supply some interface template code.
Alexander L –
Very interesting. I learned a lot of new things. 5 stars! Just a few things that could be improved: The video and its audio are not really synchronized (maybe because the video is pretty old) The subtitles are not good. Even the english ones were not written by someone who knows what the professor is talking about… Nowadays there are better solutions to validate whether someone solved a programming task. geeksforgeeks.org and hackerrank.com for example just execute the program with test input. But all in all: Very positive experience.
Jingyuan W –
Great!
Minsub L –
excellent course for algorithm specialization
Peregrine D –
Overall well pitched course. One questionable assignment given the context.
wuhanwen –
Good course succinctly explained!
Sani M –
Very informative. Questions are challenging.
Tarit G –
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.
Maxim M –
brilliant!
linh t –
this course is a lot more difficult and challenging than the first course because of the concepts are more abstract, but it’s really interesting!
Dinghan X –
I have to say it is getting challenging. Like the one programing assignment where python will encounter stack overflow issue. But, having the capability to identify and solve the problem is pretty fun. Nice course.
Jephte E –
I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.
Georgios K –
Great course, the first exercise was a little bit hard but the material is useful, if you read the relevant book then the course is even easier. Last I want to mention that writing the code in Python makes the course easier.
Chella T N –
Awesome and to the point course
fesri h –
Great Exercise!!!
Yuxing C –
great course, can’t wait to take the next one.
Marko D –
Great coverage of graphs and basic implementations. Wish hash implementation was discussed in more details.
ALLA K R –
i understand algorithms very well thank u for learning me more detail
Alexey Z –
Extremely useful course for programmers.
yangyunlong –
very nice algorithm course! very helpful for non cs students to enhance the knowledge about algorithm!
Muskan K –
The course was great. But the assignments were challenging and little time consuming.
Manu A –
more examples of hashing algorithms could have been introduced (like consistent hashing, Murmur hash etc.)
Manol D –
Useful refresher!
Derek A S –
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.