• Application Deadline
  • 42 days
    Duration

About

If you have ever used a navigation service to find the optimal route and estimate time to destination, you've used algorithms on graphs.

Graphs arise in various real-world situations, as there are road networks, water and electricity supply networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get to work, cheapest way to connect set of computers into a network or efficient algorithm to automatically find communities and opinion leaders in Facebook, you're going to work with graphs and algorithms on graphs.

In the Graph Algorithms Certificate, part of the Algorithms and Data Structures MicroMasters Program from EdX in partnership with University of California, San Diego - UC San DiegoX, you will learn what a graph is and its most important properties. You’ll learn several ways to traverse graphs and how you can do useful things while traversing the graph in some order. We will also talk about shortest paths algorithms. We will finish with minimum spanning trees, which are used to plan road, telephone and computer networks and also find applications in clustering and approximate algorithms.

What you'll learn

  • Graph exploration and decomposition into connected components
  • Shortest paths algorithms, including breadth-first search, Dijkstra’s algorithm and Bellman-Ford algorithm
  • Minimum spanning tree algorithms

Detailed Programme Facts

  • Deadline and start date Application deadline and start date were not specified by the programme.
  • Programme intensity Part-time
    • Average part-time duration 42 days
    • Intensity 10 hrs/week
    • Part-time variant
      Flexible
    • Duration description
      6 weeks, 8-10 hours per week
  • Languages
    • English
  • Delivery mode
    Online
  • More information Go to the programme website

Programme Structure

Courses Include:

  • Modules 1 and 2: Decomposition of Graphs
  • Modules 3 and 4: Shortest Paths 
  • Module 5: Minimum Spanning Trees 
  • Module 6: Flows in Networks 

English Language Requirements

This programme may require students to demonstrate proficiency in English.

Academic Requirements

Prerequisites

Basic knowledge of:

  • At least one programming language-loops, arrays, stacks, recursion.
  • Math-proof by induction, proof by contradiction
  • The Algorithmic Toolbox and Data Structures classes

Tuition Fee

  • International

    150 USD/full
    Tuition Fee
    Based on the original amount of 150 USD for the full programme and a duration of 42 days.
  • National

    150 USD/full
    Tuition Fee
    Based on the original amount of 150 USD for the full programme and a duration of 42 days.
We've labeled the tuition fee that applies to you because we think you are from and prefer over other currencies.
5% discount coupon: Z7LZNQ4TN3B2JTWU valid for any free course + certificate upgrade

Funding

Check the programme website for information about funding options.

StudyPortals Tip: Students can search online for independent or external scholarships that can help fund their studies. Check the scholarships to see whether you are eligible to apply. Many scholarships are either merit-based or needs-based.

The Global Study Awards: get funded with up to £10,000 to study abroad

Together with the ISIC Association and British Council IELTS, Studyportals offers you the chance to receive up to £10000 to expand your horizon and study abroad. We want to ultimately encourage you to study abroad in order to experience and explore new countries, cultures and languages.