1. To support our site, MoocLab may be compensated by some course providers through affiliate links.

Coursera Graph Search, Shortest Paths, and Data Structures

Stanford University via coursera

  • Overview
  1. Coursera
    Platform:
    Coursera
    Provider:
    Stanford University
    Length:
    4 weeks
    Effort:
    4-8 hours/week
    Language:
    English
    Credentials:
    Paid Certificate Available
    Part of:
    Algorithms | Coursera
    Overview
    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).

    Who is this class for: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.

    Syllabus
    Week 1
    Breadth-first and depth-first search; computing strong components; applications.

    Week 2
    Dijkstra's shortest-path algorithm.

    Week 3
    Heaps; balanced binary search trees.

    Week 4
    Hashing; bloom filters.

    Taught by
    Tim Roughgarden

Share This Page



  1. This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
    By continuing to use this site, you are consenting to our use of cookies.
    Dismiss Notice