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

Graph Search, Shortest Paths, and Data Structures

Graph Search, Shortest Paths, and Data Structures
This course is part of Algorithms Specialization

Instructor: Tim Roughgarden
Access provided by SVEC + MBU
93,666 already enrolled
2,000 reviews
Details to know

Add to your LinkedIn profile
9 assignments
See how employees at top companies are mastering in-demand skills

Build your subject-matter expertise
- Learn new concepts from industry experts
- Gain a foundational understanding of a subject or tool
- Develop job-relevant skills with hands-on projects
- Earn a shareable career certificate

There are 4 modules in this course
Earn a career certificate
Add this credential to your LinkedIn profile, resume, or CV. Share it on social media and in your performance review.
Instructor

Offered by
Why people choose Coursera for their career

Felipe M.

Jennifer J.

Larry W.

Chaitanya A.
Learner reviews
- 5 stars
86.10%
- 4 stars
11.49%
- 3 stars
1.69%
- 2 stars
0.24%
- 1 star
0.44%
Showing 3 of 2000
Reviewed on Nov 11, 2017
Focused on principles and motivations behind algorithms. You might forget an algorithm you learned, but you will definitely be able to come up with one quickly after this course.
Reviewed on Jun 8, 2021
Thanks a lot to Prof Roughgarden for great lectures, to course mentors and fellow students for fruitful discussions. It was a hard, but insanely informative course.
Reviewed on Dec 27, 2019
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.
Explore more from Computer Science

Birla Institute of Technology & Science, Pilani

Stanford University


