Interested in this College?
Get updates on Eligibility, Admission, Placements Fees Structure

Quick Facts

Medium Of Instructions	Mode Of Learning	Mode Of Delivery
English	Self Study	Video and Text Based

Course Overview

Graph Search, Shortest Paths, and Data Structures is an online certification course offered by Stanford University intended for the pool of intermediate-level students. The course will expose the candidates to the data structures, graph primitives, graph searches, and their applications. Graph Search, Shortest Paths, and Data Structures Certification Syllabus, developed by Tim Roughgarden, the Professor of Computer Science, will shed light on the heaps, hash tables, balanced search trees, and bloom filters, and the like.

The Graph Search, Shortest Paths, and Data Structures Certification Course, administered by Coursera, will also provide the students with a sheer insight into breadth-first and depth-first search, shortest paths, connectivity, and their applications. Graph Search, Shortest Paths, and Data Structures Certification by Coursera, the second course in four programmes of the Algorithms Specialization, is a flexibly designed course that can be pursued by students as per their own schedule.

The Highlights

Provided by Coursera
Approximately 15 hours of programme
Offered by the Stanford University
Flexible Deadlines
Self-Paced Learning Option
Shareable Certificate
Intermediate Level Course
Financial Aid Available
100% Online Course

Programme Offerings

English videos with multiple subtitles
practice quizzes
Graded Assignments with peer feedback
graded Quizzes with feedback
Graded Programming Assignments
Course Videos & Readings
EMI payment options
14 day refund period

Courses and Certificate Fees

Certificate Availability	Certificate Providing Authority
yes	Coursera

Graph Search, Shortest Paths, and Data Structures Certification Fee will differ based on the number of months the learners intend to stay on the programme. The fee structure prescribed by Coursera is provided in the table below:

Description	Total Fee in INR
Course Fee, 1 month	Rs. 4,074
Course Fee, 3 months	Rs. 12,224
Course Fee, 6 months	Rs. 24,448

Eligibility Criteria

Certification Qualifying Details

The Graph Search, Shortest Paths, and Data Structures Certification will be awarded only to the candidates who have finished the course proceedings in a successful way by going through all aspects of the programme including the course materials, readings, assignments, and quizzes, etc.

What you will learn

Knowledge of Algorithms

By completing the Graph Search, Shortest Paths, and Data Structure Training, the candidates will be able to develop a deep understanding of:

Graphs
Data Structure
Algorithms
Hash Table

Who it is for

Data ScientistComputer Programmer

Graph Search, Shortest Paths, and Data Structures Classes can be pursued by the following professionals:

Admission Details

Step 1- First, the students are required to register and sign up on https://www.coursera.org/ to get access to the courses offered by Coursera.

Step 2 - After activating the Coursera account, the candidate can sign in.

Step 3 - Then, the candidate can search the ‘Stanford University’ in the search column, and then, the courses offered by Stanford University will appear on the screen.

Step 4 - Then, find the course ‘Graph Search, Shortest Paths, and Data Structures’ in the list and click on it.

Step 5- Then, the page of the course will appear on the screen, and then, click on the option ‘enroll’. The students can enroll in the programme either free of cost or pay the fee prescribed by Coursera.

The Syllabus

Videos

Graph Search - Overview
Breadth-First Search (BFS): The Basics
BFS and Shortest Paths
BFS and Undirected Connectivity
Depth-First Search (DFS): The Basics
Topological Sort
Computing Strong Components: The Algorithm
Computing Strong Components: The Analysis
Structure of the Web [Optional]

Readings

Week 1 Overview
Overview, Resources, and Policies
Lecture slides
Optional Theory Problems (Week 1)

Quiz

Problem Set #
Programming Assignment #1

Videos

Dijkstra's Shortest-Path Algorithm
Dijkstra's Algorithm: Examples
Correctness of Dijkstra's Algorithm
Dijkstra's Algorithm: Implementation and Running Time

Readings

Week 2 Overview
Optional Theory Problems (Week 2)

Quiz

Problem Set #2
Programming Assignment #2

Videos

Data Structures: Overview
Heaps: Operations and Applications
Heaps: Implementation Details [Advanced - Optional]
Balanced Search Trees: Operations and Applications
Binary Search Tree Basics, Part I
Binary Search Tree Basics, Part II
Red-Black Trees
Rotations [Advanced - Optional]
Insertion in a Red-Black Tree [Advanced]

Reading

Week 3 Overview

Quiz

Problem Set #3
Programming Assignment #3

Videos

Hash Tables: Operations and Applications
Hash Tables: Implementation Details, Part I
Hash Tables: Implementation Details, Part II
Pathological Data Sets and Universal Hashing Motivation
Universal Hashing: Definition and Example [Advanced - Optional]
Universal Hashing: Analysis of Chaining [Advanced - Optional]
Hash Table Performance with Open Addressing [Advanced - Optional]
Bloom Filters: The Basics
Bloom Filters: Heuristic Analysis

Readings

Week 4 Overview
Optional Theory Problems (Week 4)
Info and FAQ for final exam

Quiz

Problem Set #4
Programming Assignment #4
Final Exam

Instructors

Stanford Frequently Asked Questions (FAQ's)

1: In which mode the Graph Search, Shortest Paths, and Data Structures Online Certification are offered?

The programme is offered completely in online mode.

2: Who is the tutor of the Graph Search, Shortest Paths, and Data Structures Online Course?

The tutor of the programme is Tim Roughgarden who is the Professor of Computer Science at Stanford University.

3: Which are the enrolment options provided by Coursera for the programme?

Coursera provides two enrolment options to the programme, namely, the free enrolment and taking the course by paying the fee. Candidates can get the full advantage only by opting for the second option.

4: In which time duration can the course be completed?

The course can be completed within about 15 hours.

5: In which languages the subtitles are available for the course videos?

The subtitles are available in the languages of Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, and Spanish.