The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
ofrecido por
Programa especializado: AlgoritmosUniversidad de StanfordAcerca de este Curso
37.179 vistas recientes
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Curso 3 de 4 en
Nivel intermedio
Aprox. 15 horas para completar
Inglés (English)
Subtítulos: Árabe (Arabic), Francés (French), Portugués (europeo), Italiano, Vietnamita, Alemán (German), Ruso (Russian), Inglés (English), Español (Spanish)
Habilidades que obtendrás
Spanning TreeAlgorithmsDynamic ProgrammingGreedy Algorithm
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Curso 3 de 4 en
Nivel intermedio
Aprox. 15 horas para completar
Inglés (English)
Subtítulos: Árabe (Arabic), Francés (French), Portugués (europeo), Italiano, Vietnamita, Alemán (German), Ruso (Russian), Inglés (English), Español (Spanish)
ofrecido por
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.
Programa - Qué aprenderás en este curso
4 horas para completar
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
4 horas para completar
16 videos (Total 160 minutos), 4 lecturas, 2 cuestionarios
4 horas para completar
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
4 horas para completar
16 videos (Total 188 minutos), 2 lecturas, 2 cuestionarios
3 horas para completar
Week 3
Huffman codes; introduction to dynamic programming.
3 horas para completar
11 videos (Total 105 minutos), 1 lectura, 2 cuestionarios
4 horas para completar
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
4 horas para completar
10 videos (Total 107 minutos), 3 lecturas, 3 cuestionarios
Reseñas
Principales reseñas sobre GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING
por FC29 de jun. de 2018
Tim Roughgarden is a fantastic teacher! He really cares about explaining in a simple manner and also give you useful hints and advices to dive deeper in all the topics of the course. Thanks, Tim!
por RG26 de abr. de 2020
I learned more about Greedy Algorithms and Algorithms to compute MST's and their importance on real world problems. Also I got to start to understand Dynamic Programming in a way I didn't before.
por AB22 de abr. de 2020
Like the other courses in this specialization, the material is interesting and coherent. The pace is not fast enough to get lost and not so slow to insult your intelligence. I enjoyed it a lot!
por SW24 de feb. de 2019
One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.
Acerca de 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.
Preguntas Frecuentes
¿Cuándo podré acceder a las lecciones y tareas?
¿Qué recibiré si me suscribo a este Programa especializado?
¿Hay ayuda económica disponible?
¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.
