Programa de cursos integrados Algoritmos
Learn To Think Like A Computer Scientist. Master the fundamentals of the design and analysis of algorithms.
oferecido por
Habilidades que você terá
Sobre este Programa de cursos integrados
Projeto de Aprendizagem Aplicada
Learners will practice and master the fundamentals of algorithms through several types of assessments. Every week, there is a multiple choice quiz to test your understanding of the most important concepts. There are also weekly programming assignments, where you implement one of the algorithms covered in lecture in a programming language of your choosing. Each course concludes with a multiple-choice final exam.
É necessário ter alguma experiência prévia.É necessária alguma experiência prévia.
É necessário ter alguma experiência prévia.É necessária alguma experiência prévia.
Este Programa de cursos integrados contém 4 cursos
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
Graph Search, Shortest Paths, and Data Structures
The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
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).
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
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).
oferecido por

Universidade 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.
Perguntas Frequentes – FAQ
Vou ganhar créditos universitários por concluir a Especialização?
Can I just enroll in a single course?
Posso me inscrever em um único curso?
Can I take the course for free?
Posso fazer o curso gratuitamente?
Este curso é realmente 100% on-line? Eu preciso assistir alguma aula pessoalmente?
Quanto tempo é necessário para concluir a Especialização?
Do I need to take the courses in a specific order?
Will I earn university credit for completing the Specialization?
Vou ganhar créditos universitários por concluir a Especialização?
Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.