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
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them is an online programme designed for intermediate-level students. The online course administered by Stanford University will give the students a deep dive into the shortest paths and related aspects. Shortest Paths Revisited, NP-Complete Problems and What To Do About Them Certification Syllabus, prepared by Tim Roughgarden, the Professor of Computer Science, will walk the candidates through various topics of algorithms such asBellman-Ford, Floyd-Warshall, Johnson, etc.
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them Certification Course, administered by Coursera, is a flexibly developed course and the students can set their deadlines as per their comfort. The students will also be given subtitles in multiple languages. Shortest Paths Revisited, NP-Complete Problems and What To Do About Them Certification by Coursera is the fourth and the last course in the Algorithms Specialization.
The Highlights
- Provided by Coursera
- Approximately 13 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 |
The fees for the course Shortest Paths Revisited, NP-Complete Problems and What To Do About Them is -
Description | Total Fee in INR |
Course Fee, 1 month | Rs. 4,117 |
Course Fee, 3 months | Rs. 12,352 |
Course Fee, 6 months | Rs. 24,704 |
Eligibility Criteria
Certification Qualifying Details
To get certified with the Shortest Paths Revisited, NP-Complete Problems, and What To Do About Them Certification, the students will have to finish the whole process of the programme such as course videos, reading materials, quizzes, assignments, and whatnot.
What you will learn
By the end of the Shortest Paths Revisited, NP-Complete Problems and What To Do About Them Training, the candidates will learn:
- Data Structure
- Algorithms
- Np-Completeness
- Shortest Paths
- Dynamic Programming
Who it is for
Shortest Paths Revisited, NP-Complete Problems, and What To Do About Them Classes will be a better option for the professionals such as
- Data Scientist
- Programmer
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 ‘Shortest Paths Revisited, NP-Complete Problems and What To Do About Them’ 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
- Single-Source Shortest Paths, Revisted
- Optimal Substructure
- The Basic Algorithm I
- The Basic Algorithm II
- Detecting Negative Cycles
- A Space Optimization
- Internet Routing I [Optional]
- Internet Routing II [Optional]
- Problem Definition
- Optimal Substructure
- The Floyd-Warshall Algorithm
- A Reweighting Technique
- Johnson's Algorithm I
- Johnson's Algorithm II
Readings
- Week 1 Overview
- Overview, Resources, and Policies
- Lecture Slides
- Optional Theory Problems (Week 1)
Practice Exercises
- Problem Set #1
- Programming Assignment #1
Videos
- Polynomial-Time Solvable Problems
- Reductions and Completeness
- Definition and Interpretation of NP-Completeness I
- Definition and Interpretation of NP-Completeness II
- The P vs. NP Question
- Algorithmic Approaches to NP-Complete Problems
- The Vertex Cover Problem
- Smarter Search for Vertex Cover I
- Smarter Search for Vertex Cover II
- The Traveling Salesman Problem
- A Dynamic Programming Algorithm for TSP
Readings
- Week 2 Overview
- Optional Theory Problems (Week 2)
Practice Exercises
- Problem Set #2
- Programming Assignment #2
Videos
- A Greedy Knapsack Heuristic
- Analysis of a Greedy Knapsack Heuristic I
- Analysis of a Greedy Knapsack Heuristic II
- A Dynamic Programming Heuristic for Knapsack
- Knapsack via Dynamic Programming, Revisited
- Ananysis of Dynamic Programming Heuristic1
Reading
- Week 3 Overview
Practice Exercises
- Problem Set #3
- Programming Assignment #3
Videos
- The Maximum Cut Problem I
- The Maximum Cut Problem II
- Principles of Local Search I
- Principles of Local Search II
- The 2-SAT Problem
- Random Walks on a Line
- Analysis of Papadimitriou's Algorithm
- Stable Matching [Optional]
- Matchings, Flows, and Braess's Paradox [Optional]
- Linear Programming and Beyond [Optional]
- Epilogue
Readings
- Week 4 Overview
- Optional Theory Problems (Week 4)
- Info and FAQ for final exam
Practice Exercises
- Problem Set #4
- Programming Assignment #4
- Final Exam
Instructors
Stanford Frequently Asked Questions (FAQ's)
The course has been designed for intermediate-level students.
The programme is offered by Stanford University.
The course can be completed within approximately 13 hours.
The subtitles are available in the languages of Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, and Spanish.
Yes, the learners can pay the fee in the mode of instalments.