Careers360 Logo
ask-icon
share
    Compare

    Quick Facts

    Medium Of InstructionsMode Of LearningMode Of Delivery
    EnglishSelf StudyVideo and Text Based

    Course Overview

    Algorithms on graphs is a much-used concept in navigation services and has thus found supreme applicability in the current scenario. Whether it be road networks, social networks or computer networks, this domain offers a lot of scope for learning, especially for engineers. To think of the fastest time to commute, people often resort to a connected set of computers which are strewn through an efficient algorithm or a dense network. This also helps in detecting communities and leaders on Facebook.

    Algorithms on Graphs course is one another valuable offering by Coursera which delves deep into the insights of graphs and its varied properties. Candidates will learn traversing graphs and orderly traversing of the same to perform meaningful tasks. Discussion on shortest paths algorithms from basic level used to open doors till faster ones used in Google Maps will be conducted. Pursuing this course will also help candidates in pursuing Fast Shortest Routes industrial capstone projects if they wish to.

    This course concludes with minimum spanning trees utilised in road planning and telephone and computer networks.

    The Highlights

    • Course by University of California San Diego National Research University Higher School of Economics
    • Intermediate level learning
    • Comprehensive course series.
    • Online learning
    • Professional Certification
    • 54 hours course duration of approximately

    Programme Offerings

    • Online Classrooms
    • video series
    • practice assignments
    • quizzes.

    Courses and Certificate Fees

    Certificate AvailabilityCertificate Providing Authority
    yesUCI IrvineCoursera

    Algorithms on Graphs Fees Structure :

    Fees components

    Fees

    1 month 

    Rs. 6,757

    3 months

    Rs. 13,514 

    6 months

    Rs. 20,271 



    Eligibility Criteria

    Certification Qualifying Details

    Since Algorithms on Graphs course is a part of Data Structures and Algorithms Specialisation, learners pursuing the paid course will get a Professional shareable certificate from Coursera. There are no separate requirements to get the certificate. Certification will be visible on “My Accomplishments” tab on the dashboard after learners have completed all the learnings in totality and after the grading of their assignments by their staff and peers.

    What you will learn

    Knowledge of Algorithms
    • Candidates will learn about a series of tools and skills in this course.
    • They will learn about Dijkstra’s Algorithm, Yandex. Navi, Google maps and other areas.

    Who it is for


    Admission Details

    Candidates have to register themselves for the course by acknowledging the stepwise guidelines as stated below-

    Step 1: Visit the course page. https://www.coursera.org/learn/algorithms-on-graphs

    Step 2: Check “Enrol for Free” tab to study the free course.

    Step 3: If the candidate opts for the paid version, he/she must pay the fee immediately to access the course.

    Step 4: Course takers opting for the free version can access every course material except quizzes.

    Step 5: Candidates will then select “Start Learning” to begin learning.

    The Syllabus

    Videos
    • Graph Basics
    • Representing Graphs
    • Exploring Graphs
    • Connectivity
    • Previsit and Post-visit Orderings
    Readings
    • Welcome
    • Slides and External References
    • Slides and External References
    Programming Assignment
    • Programming Assignment 1: Decomposition of Graphs

    Videos
    • Directed Acyclic Graphs
    • Topological Sort
    • Strongly Connected Components
    • Computing Strongly Connected Components
    Reading
    • Slides and External Reference
    Programming Assignment
    • Programming Assignment 2: Decomposition of Graphs

    Videos
    • Applications
    • Paths and Distance
    • Breadth-First Search
    • Breadth-First Search (continued)
    • Implementation and Analysis
    • BFS Properties
    • Correct Distances
    • Shortest Path Tree
    Reading
    • Slides and External References
    Programming Assignment
    • Programming Assignment 3: Paths in Graphs

    Videos
    • Fastest Route
    • Naive Algorithm
    • Dijkstra's Algorithm
    • Dijkstra Example
    • Implementation
    • Proof of Correctness
    • Analysis
    • Currency Exchange
    • Reduction to Shortest Paths
    • Bellman-Ford Algorithm
    • Proof of Correctness
    • Negative Cycles
    • Infinite Arbitrage

    Readings
    • Slides and External References
    • Slides and External References
    Programming Assignment
    • Programming Assignment 4: Paths in Graphs

    Videos
    • Building a Network
    • Greedy Algorithms
    • Cut Property
    • Kruskal's Algorithm
    • Prim's Algorithm
    Reading
    • Slides and External References
    Programming Assignment
    • Programming Assignment 5: Minimum Spanning Trees

    Videos
    • Programming Project: Introduction
    • Bidirectional Search
    • Six Handshakes
    • Bidirectional Dijkstra
    • Finding Shortest Path after Meeting in the Middle
    • Computing the Distance
    • A* Algorithm
    • Performance of A*
    • Bidirectional A*
    • Potential Functions and Lower Bounds
    • Landmarks (Optional)
    • Highway Hierarchies and Node Importance
    • Preprocessing
    • Witness Search
    • Query
    • Proof of Correctness
    • Node Ordering
    Readings
    • Slides and External References
    • Slides and External References
    • Slides and External References
    Assignment
    • Bidirectional Dijkstra, A* and Contraction Hierarchies
    Programming Assignment
    • Advanced Shortest Paths

    Instructors

    UC San Diego Frequently Asked Questions (FAQ's)

    1: Are there any restrictions to access the course material?

    Coursera doesn’t allow countries such as Crimea, North Korea, Iran, Sudan, Cuba and Syria to access all or some parts of the content according to the U.S. export control regulations.

    2: What does the Professional Certification consist of?

    This professional certificate will confirm that the student has completed the programme. The certificate is issued by the institution that developed the program.

    3: What are the payment methods unavailable to Indian students?

    Learners in India cannot make payments using-

    • Local debit/credit cards
    • eWallet (PayTM) 
    • NetBanking
    4: How can candidates utilise a promo code?

    Got to the “My Purchases” page, or the payment screen to use the promo code. Candidates can also apply the coupon code automatically if required.

    5: How do I add deadlines?

    Candidates need to visit Coursera’s website or use the app to log in. Go to the settings and select “Calendar Sync”. Connect the calendar by following the instructions.

    Articles

    Student Community: Where Questions Find Answers

    Ask and get expert answers on exams, counselling, admissions, careers, and study options.