Descripción de “Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera)”
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).
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.
Higher School of Economics (HSE) - National Research University University of California, San Diego
Añadido a tus favoritosEliminado de tus favoritos0
Añadir para comparar
Este sitio web utiliza cookies para un correcto funcionamiento. Si continúas navegando estás dando tu consentimiento para estas cookies y aceptas nuestra política de cookies, clic para más información.
Aún no hay reseñas.