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).
Acerca de este Curso
Habilidades que obtendrás
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.
- 5 stars86,51 %
- 4 stars11,49 %
- 3 stars1,66 %
- 2 stars0,08 %
- 1 star0,24 %
Principales reseñas sobre GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING
Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.
A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.
Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.
This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.
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.
¿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.