Overview
The primary topics in this part of the Shortest Paths Revisited, NP-Complete Problems and What To Do About Them course offered by Coursera in partnership with Stanford are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).
Skills You Will Gain
- Algorithms
- Graph Theory
- Problem Solving
- Theoretical Computer Science
- Computer Programming
- Mathematics
- Mathematical Theory & Analysis
- Data Structures
Programme Structure
Courses included:
- Week 1: The Bellman-Ford algorithm; all-pairs shortest paths.
- Week 2: NP-complete problems and exact algorithms for them.
- Week 3: Approximation algorithms for NP-complete problems.
- Week 4: Local search algorithms for NP-complete problems; the wider world of algorithms.
Key information
Duration
- Part-time
- 7 days
- 10 hrs/week
Start dates & application deadlines
Language
Delivered
Campus Location
- Mountain View, United States
Disciplines
Computer Sciences Human Computer Interaction Web Technologies & Cloud Computing View 113 other Short Courses in Human Computer Interaction in United StatesWhat students do after studying
Academic requirements
We are not aware of any specific GRE, GMAT or GPA grading score requirements for this programme.
English requirements
We are not aware of any English requirements for this programme.
Other requirements
General requirements
- Intermediate Level
- Some related experience required
Tuition Fees
-
International Applies to you
Applies to youNon-residentsFree - Out-of-StateFree
-
Domestic
Applies to youIn-StateFree
Funding
Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You'll be prompted to complete an application and will be notified if you are approved. You'll need to complete this step for each course in the Specialization, including the Capstone Project.