About this course: The primary topics in this part of the specialization 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).
Who is this class for: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
Created by: Stanford University
Taught by: Tim Roughgarden, Professor
Computer Science
| Basic Info |
Course 4 of 4 in the
Algorithms Specialization.
|
| Level | Intermediate |
| Commitment | 4 weeks of study, 4-8 hours/week |
| Language | English |
| How To Pass | Pass all graded assignments to complete the course. |
| User Ratings |
Syllabus
WEEK 1
Week 1
The Bellman-Ford algorithm; all-pairs shortest paths.
14 videos, 4 readings
Graded: Problem Set #1
Graded: Programming Assignment #1
WEEK 2
Week 2
NP-complete problems and exact algorithms for them.
11 videos, 2 readings
Graded: Problem Set #2
Graded: Programming Assignment #2
WEEK 3
Week 3
Approximation algorithms for NP-complete problems.
6 videos, 1 reading
Graded: Problem Set #3
Graded: Programming Assignment #3
WEEK 4
Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.
11 videos, 3 readings
Graded: Problem Set #4
Graded: Programming Assignment #4
Graded: Final Exam
FAQs
How It Works
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
Creators
Stanford University
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
Pricing
| Audit | Purchase Course | |
|---|---|---|
| Access to course materials | Available | Available |
| Access to graded materials | Not available | Available |
| Receive a final grade | Not available | Available |
| Earn a shareable Course Certificate | Not available | Available |
Ratings and Reviews
Good introductory coverage and challenging assignments.
I´ve done all 4 courses on the Algorithms series from Stanford, and I have to say this is a top notch, very high standing course on the subject. Tim Roughgarden is an incredible teacher/instructor, the material is excelent and the assignements are challenging yet very useful and engaging. Funny how this course made me wish going back to college even at my age. Will definetely follow up with similar courses if I can find them in Coursera.
Thoroughly enjoyed this course! Problems and assignments are quite challenging but doable
Coursera provides universal access to the world’s best education, partnering with top universities and organizations to offer courses online.
© 2017 Coursera Inc. All rights reserved.
李
Challenge course! Good course!