Latest Courses
ISTQB Artificial Intelligence Tester Sample ExamsCheck course
JAVA Programming Online Practice ExamCheck course
Programming for Kids and Beginners: Learn to Code in PythonCheck course
Practice Exams | Codeigniter 4 developer certificationCheck course
WordPress Practice Tests & Interview Questions (Basic/Adv)Check course
Git &Github Practice Tests & Interview Questions (Basic/Adv)Check course
Machine Learning and Deep Learning for Interviews & ResearchCheck course
Laravel | Build Pizza E-commerce WebsiteCheck course
101 - F5 CERTIFICATION EXAMCheck course
Master Python by Practicing 100 QuestionCheck course
ISTQB Artificial Intelligence Tester Sample ExamsCheck course
JAVA Programming Online Practice ExamCheck course
Programming for Kids and Beginners: Learn to Code in PythonCheck course
Practice Exams | Codeigniter 4 developer certificationCheck course
WordPress Practice Tests & Interview Questions (Basic/Adv)Check course
Graph Search, Shortest Paths, and Data Structures

Graph Search, Shortest Paths, and Data Structures

FREE

Add your review
Add to wishlistAdded to wishlistRemoved from wishlist 0
Add to compare
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

Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University. He received a BS in Applied Mathematics from Stanford in 1997, and a PhD in Computer Science from Cornell in 2002. His research interests include the many connections between computer science and economics, as well as the design, analysis, applications, and limitations of algorithms. For his research, he has been awarded the ACM Grace Murray Hopper Award, the Presidential Early Career Award for Scientists and Engineers (PECASE), the Kalai Prize in Computer Science and Game Theory, the Shapley Lecturership of the Game Theory Society, the Social Choice and Welfare Prize, INFORM’s Optimization Prize for Young Researchers, the Mathematical Programming Society’s Tucker Prize, the EATCS-SIGACT Godel Prize, and a Guggenheim Fellowship.

Specification: Graph Search, Shortest Paths, and Data Structures

Duration

18 hours

Year

2016

Level

Intermediate

Certificate

Yes

Quizzes

Yes

52 reviews for Graph Search, Shortest Paths, and Data Structures

4.6 out of 5
42
9
1
0
0
Write a review
Show all Most Helpful Highest Rating Lowest Rating
  1. Yifeng L

    More challenging than first course, very good for beginners. Specially useful for those not in CS major.

    Helpful(0) Unhelpful(0)You have already voted this
  2. Mikhail K

    It is very interesting course that gives an opportunity to improve the fundamental knowledge and skills that are connected with programming.

    Helpful(0) Unhelpful(0)You have already voted this
  3. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  4. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  5. Ning K

    Super super cool explanation of the shortest path, minimum spanning tree, and all other algorithms!

    Helpful(0) Unhelpful(0)You have already voted this
  6. clayton w

    excellent

    Helpful(0) Unhelpful(0)You have already voted this
  7. 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!

    Helpful(0) Unhelpful(0)You have already voted this
  8. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  9. Saurav M

    NIce course

    Helpful(0) Unhelpful(0)You have already voted this
  10. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  11. Nadanai L

    Wonderful material but some issues with programming assignments which need updating

    Helpful(0) Unhelpful(0)You have already voted this
  12. Yuanzhan W

    A good introduction to graph search algorithms

    Helpful(0) Unhelpful(0)You have already voted this
  13. Neo

    Awesome!

    Helpful(0) Unhelpful(0)You have already voted this
  14. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  15. Sui X

    excellent course

    Helpful(0) Unhelpful(0)You have already voted this
  16. Ishan B

    Best professor I have ever had.

    Helpful(0) Unhelpful(0)You have already voted this
  17. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  18. 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.

    Helpful(3) Unhelpful(0)You have already voted this
  19. Aishwarya R

    Learnt about graphs, trees, heaps, hashing! The course is enlightening.

    Helpful(0) Unhelpful(0)You have already voted this
  20. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  21. 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.

    Helpful(1) Unhelpful(0)You have already voted this
  22. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  23. Pratik P

    Really cleared some vital concepts on Data Strucctures

    Helpful(0) Unhelpful(0)You have already voted this
  24. Madhurya R

    Great job

    Helpful(0) Unhelpful(0)You have already voted this
  25. Frank J M

    Great course. The programming problems really added to the material.

    Helpful(0) Unhelpful(0)You have already voted this
  26. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  27. Xiaohui X

    Excellent course !!! Thank you, dear professor !

    Helpful(0) Unhelpful(0)You have already voted this
  28. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  29. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  30. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  31. Jingyuan W

    Great!

    Helpful(0) Unhelpful(0)You have already voted this
  32. Minsub L

    excellent course for algorithm specialization

    Helpful(0) Unhelpful(0)You have already voted this
  33. Peregrine D

    Overall well pitched course. One questionable assignment given the context.

    Helpful(0) Unhelpful(0)You have already voted this
  34. wuhanwen

    Good course succinctly explained!

    Helpful(0) Unhelpful(0)You have already voted this
  35. Sani M

    Very informative. Questions are challenging.

    Helpful(0) Unhelpful(0)You have already voted this
  36. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  37. Maxim M

    brilliant!

    Helpful(0) Unhelpful(0)You have already voted this
  38. 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!

    Helpful(0) Unhelpful(0)You have already voted this
  39. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  40. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  41. 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.

    Helpful(0) Unhelpful(0)You have already voted this
  42. Chella T N

    Awesome and to the point course

    Helpful(0) Unhelpful(0)You have already voted this
  43. fesri h

    Great Exercise!!!

    Helpful(0) Unhelpful(0)You have already voted this
  44. Yuxing C

    great course, can’t wait to take the next one.

    Helpful(0) Unhelpful(0)You have already voted this
  45. Marko D

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

    Helpful(0) Unhelpful(0)You have already voted this
  46. ALLA K R

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

    Helpful(0) Unhelpful(0)You have already voted this
  47. Alexey Z

    Extremely useful course for programmers.

    Helpful(0) Unhelpful(0)You have already voted this
  48. yangyunlong

    very nice algorithm course! very helpful for non cs students to enhance the knowledge about algorithm!

    Helpful(0) Unhelpful(0)You have already voted this
  49. Muskan K

    The course was great. But the assignments were challenging and little time consuming.

    Helpful(0) Unhelpful(0)You have already voted this
  50. Manu A

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

    Helpful(0) Unhelpful(0)You have already voted this
  51. Manol D

    Useful refresher!

    Helpful(0) Unhelpful(0)You have already voted this
  52. 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.

    Helpful(0) Unhelpful(0)You have already voted this

    Add a review

    Your email address will not be published. Required fields are marked *

    This site uses Akismet to reduce spam. Learn how your comment data is processed.

    Graph Search, Shortest Paths, and Data Structures
    Graph Search, Shortest Paths, and Data Structures

    Price tracking

    Java Code Geeks
    Logo
    Register New Account
    Compare items
    • Total (0)
    Compare