Acerca de este curso: 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).
Para quién es esta clase: 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.
Creada por: Stanford University
Enseñado por: Tim Roughgarden, Professor
Computer Science
| Información básica | Curso 4 de 4 en Algorithms Specialization |
| Nivel | Intermedio |
| Compromiso | 4 weeks of study, 4-8 hours/week |
| Idioma | Inglés (English) |
| Cómo aprobar | Aprueba todas las tareas calificadas para completar el curso. |
| Calificaciones del usuario |
Programa
SEMANA 1
Week 1
The Bellman-Ford algorithm; all-pairs shortest paths.
14 videos, 4 lecturas
- Reading: Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: Lecture Slides
- Vídeo: Optimal Substructure
- Vídeo: The Basic Algorithm I
- Vídeo: The Basic Algorithm II
- Vídeo: Detecting Negative Cycles
- Vídeo: A Space Optimization
- Vídeo: Internet Routing I [Optional]
- Vídeo: Internet Routing II [Optional]
- Vídeo: Problem Definition
- Vídeo: Optimal Substructure
- Vídeo: The Floyd-Warshall Algorithm
- Vídeo: A Reweighting Technique
- Vídeo: Johnson's Algorithm I
- Vídeo: Johnson's Algorithm II
- Reading: Optional Theory Problems (Week 1)
Calificado: Problem Set #1
Calificado: Programming Assignment #1
SEMANA 2
Week 2
NP-complete problems and exact algorithms for them.
11 videos, 2 lecturas
- Reading: Week 2 Overview
- Vídeo: Reductions and Completeness
- Vídeo: Definition and Interpretation of NP-Completeness I
- Vídeo: Definition and Interpretation of NP-Completeness II
- Vídeo: The P vs. NP Question
- Vídeo: Algorithmic Approaches to NP-Complete Problems
- Vídeo: The Vertex Cover Problem
- Vídeo: Smarter Search for Vertex Cover I
- Vídeo: Smarter Search for Vertex Cover II
- Vídeo: The Traveling Salesman Problem
- Vídeo: A Dynamic Programming Algorithm for TSP
- Reading: Optional Theory Problems (Week 2)
Calificado: Problem Set #2
Calificado: Programming Assignment #2
SEMANA 3
Week 3
Approximation algorithms for NP-complete problems.
6 videos, 1 lectura
- Reading: Week 3 Overview
- Vídeo: Analysis of a Greedy Knapsack Heuristic I
- Vídeo: Analysis of a Greedy Knapsack Heuristic II
- Vídeo: A Dynamic Programming Heuristic for Knapsack
- Vídeo: Knapsack via Dynamic Programming, Revisited
- Vídeo: Ananysis of Dynamic Programming Heuristic
Calificado: Problem Set #3
Calificado: Programming Assignment #3
SEMANA 4
Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.
11 videos, 3 lecturas
- Reading: Week 4 Overview
- Vídeo: The Maximum Cut Problem II
- Vídeo: Principles of Local Search I
- Vídeo: Principles of Local Search II
- Vídeo: The 2-SAT Problem
- Vídeo: Random Walks on a Line
- Vídeo: Analysis of Papadimitriou's Algorithm
- Vídeo: Stable Matching [Optional]
- Vídeo: Matchings, Flows, and Braess's Paradox [Optional]
- Vídeo: Linear Programming and Beyond [Optional]
- Vídeo: Epilogue
- Reading: Optional Theory Problems (Week 4)
- Reading: Info and FAQ for final exam
Calificado: Problem Set #4
Calificado: Programming Assignment #4
Calificado: Final Exam
Preguntas Frecuentes
Cómo funciona
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.
Creadores
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.
Tarifa
| Comprar curso | |
|---|---|
| Accede a los materiales del curso | Disponible |
| Accede a los materiales con calificación | Disponible |
| Recibe una calificación final | Disponible |
| Obtén un Certificado de curso para compartir | Disponible |
Calificaciones y revisiones
This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.
One of the best courses I did on Coursera.
Really happy to finish this specialization and I will still study algorithms in the future.
Excellent course! Bravo to the teacher for the commitment provided in this course. Kind regards.
Coursera brinda acceso universal a la mejor educación del mundo, al asociarse con las mejores universidades y organizaciones, para ofrecer cursos en línea.
© 2018 Coursera Inc. Todos los derechos reservados.
b
Great material!