Acerca de este Curso
4.8
423 calificaciones
55 revisiones

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.

Nivel intermedio

Aprox. 19 horas para completar

Sugerido: 4 weeks of study, 4-8 hours/week...

Inglés (English)

Subtítulos: Inglés (English)

Habilidades que obtendrás

Data StructureAlgorithmsNp-CompletenessDynamic Programming

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.

Nivel intermedio

Aprox. 19 horas para completar

Sugerido: 4 weeks of study, 4-8 hours/week...

Inglés (English)

Subtítulos: Inglés (English)

Programa - Qué aprenderás en este curso

Semana
1
3 horas para completar

Week 1

The Bellman-Ford algorithm; all-pairs shortest paths....
14 videos (Total 151 minutos), 4 readings, 2 quizzes
14 videos
Optimal Substructure10m
The Basic Algorithm I8m
The Basic Algorithm II10m
Detecting Negative Cycles9m
A Space Optimization12m
Internet Routing I [Optional]11m
Internet Routing II [Optional]6m
Problem Definition7m
Optimal Substructure12m
The Floyd-Warshall Algorithm13m
A Reweighting Technique14m
Johnson's Algorithm I11m
Johnson's Algorithm II11m
4 lecturas
Week 1 Overview10m
Overview, Resources, and Policies10m
Lecture Slides10m
Optional Theory Problems (Week 1)10m
2 ejercicios de práctica
Problem Set #110m
Programming Assignment #12m
Semana
2
3 horas para completar

Week 2

NP-complete problems and exact algorithms for them....
11 videos (Total 122 minutos), 2 readings, 2 quizzes
11 videos
Reductions and Completeness13m
Definition and Interpretation of NP-Completeness I10m
Definition and Interpretation of NP-Completeness II7m
The P vs. NP Question9m
Algorithmic Approaches to NP-Complete Problems12m
The Vertex Cover Problem8m
Smarter Search for Vertex Cover I9m
Smarter Search for Vertex Cover II7m
The Traveling Salesman Problem14m
A Dynamic Programming Algorithm for TSP12m
2 lecturas
Week 2 Overview10m
Optional Theory Problems (Week 2)10m
2 ejercicios de práctica
Problem Set #210m
Programming Assignment #22m
Semana
3
2 horas para completar

Week 3

Approximation algorithms for NP-complete problems....
6 videos (Total 68 minutos), 1 reading, 2 quizzes
6 videos
Analysis of a Greedy Knapsack Heuristic I7m
Analysis of a Greedy Knapsack Heuristic II9m
A Dynamic Programming Heuristic for Knapsack11m
Knapsack via Dynamic Programming, Revisited10m
Ananysis of Dynamic Programming Heuristic15m
1 lectura
Week 3 Overview10m
2 ejercicios de práctica
Problem Set #310m
Programming Assignment #32m
Semana
4
3 horas para completar

Week 4

Local search algorithms for NP-complete problems; the wider world of algorithms....
11 videos (Total 124 minutos), 3 readings, 3 quizzes
11 videos
The Maximum Cut Problem II9m
Principles of Local Search I8m
Principles of Local Search II10m
The 2-SAT Problem14m
Random Walks on a Line16m
Analysis of Papadimitriou's Algorithm14m
Stable Matching [Optional]15m
Matchings, Flows, and Braess's Paradox [Optional]13m
Linear Programming and Beyond [Optional]11m
Epilogue1m
3 lecturas
Week 4 Overview10m
Optional Theory Problems (Week 4)10m
Info and FAQ for final exam10m
3 ejercicios de práctica
Problem Set #410m
Programming Assignment #42m
Final Exam20m
4.8
55 revisionesChevron Right

71%

comenzó una nueva carrera después de completar estos cursos

60%

consiguió un beneficio tangible en su carrera profesional gracias a este curso

Principales revisiones

por AAFeb 28th 2017

This challenging course improves understanding of algorithms and is intellectually stimulating. I learnt the theory behind algorithms and how they are applied to solve real world problems.

por ASAug 23rd 2018

This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.\n\nOne of the best courses I did on Coursera.

Instructor

Avatar

Tim Roughgarden

Professor
Computer Science

Acerca de Universidad de Stanford

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....

Acerca del programa especializado Algoritmos

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists. About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications....
Algoritmos

Preguntas Frecuentes

  • Una vez que te inscribes para obtener un Certificado, tendrás acceso a todos los videos, cuestionarios y tareas de programación (si corresponde). Las tareas calificadas por compañeros solo pueden enviarse y revisarse una vez que haya comenzado tu sesión. Si eliges explorar el curso sin comprarlo, es posible que no puedas acceder a determinadas tareas.

  • Cuando te inscribes en un curso, obtienes acceso a todos los cursos que forman parte del Programa especializado y te darán un Certificado cuando completes el trabajo. Se añadirá tu Certificado electrónico a la página Logros. Desde allí, puedes imprimir tu Certificado o añadirlo a tu perfil de LinkedIn. Si solo quieres leer y visualizar el contenido del curso, puedes auditar el curso sin costo.

¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.