Informações sobre o curso: 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).
Para quem é direcionado este curso: 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.
Desenvolvido por: Universidade de Stanford
Ministrado por: Tim Roughgarden, Professor
Computer Science
| Informações básicas | Curso 4 de 4 no Algorithms Specialization |
| Nível | Intermediário |
| Compromisso | 4 weeks of study, 4-8 hours/week |
| Idioma | English |
| Como ser aprovado | Seja aprovado em todas as tarefas para concluir o curso. |
| Classificação do usuário |
Programa
SEMANA 1
Week 1
The Bellman-Ford algorithm; all-pairs shortest paths.
14 videos, 4 leituras
- Reading: Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: Lecture Slides
- Vídeo: Optimal Substructure
- Vídeo: The Basic Algorithm I
- Vídeo: The Basic Algorithm II
- Vídeo: Detecting Negative Cycles
- Vídeo: A Space Optimization
- Vídeo: Internet Routing I [Optional]
- Vídeo: Internet Routing II [Optional]
- Vídeo: Problem Definition
- Vídeo: Optimal Substructure
- Vídeo: The Floyd-Warshall Algorithm
- Vídeo: A Reweighting Technique
- Vídeo: Johnson's Algorithm I
- Vídeo: Johnson's Algorithm II
- Reading: Optional Theory Problems (Week 1)
Nota atribuída: Problem Set #1
Nota atribuída: Programming Assignment #1
SEMANA 2
Week 2
NP-complete problems and exact algorithms for them.
11 videos, 2 leituras
- Reading: Week 2 Overview
- Vídeo: Reductions and Completeness
- Vídeo: Definition and Interpretation of NP-Completeness I
- Vídeo: Definition and Interpretation of NP-Completeness II
- Vídeo: The P vs. NP Question
- Vídeo: Algorithmic Approaches to NP-Complete Problems
- Vídeo: The Vertex Cover Problem
- Vídeo: Smarter Search for Vertex Cover I
- Vídeo: Smarter Search for Vertex Cover II
- Vídeo: The Traveling Salesman Problem
- Vídeo: A Dynamic Programming Algorithm for TSP
- Reading: Optional Theory Problems (Week 2)
Nota atribuída: Problem Set #2
Nota atribuída: Programming Assignment #2
SEMANA 3
Week 3
Approximation algorithms for NP-complete problems.
6 videos, 1 leituras
- Reading: Week 3 Overview
- Vídeo: Analysis of a Greedy Knapsack Heuristic I
- Vídeo: Analysis of a Greedy Knapsack Heuristic II
- Vídeo: A Dynamic Programming Heuristic for Knapsack
- Vídeo: Knapsack via Dynamic Programming, Revisited
- Vídeo: Ananysis of Dynamic Programming Heuristic
Nota atribuída: Problem Set #3
Nota atribuída: Programming Assignment #3
SEMANA 4
Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.
11 videos, 3 leituras
- Reading: Week 4 Overview
- Vídeo: The Maximum Cut Problem II
- Vídeo: Principles of Local Search I
- Vídeo: Principles of Local Search II
- Vídeo: The 2-SAT Problem
- Vídeo: Random Walks on a Line
- Vídeo: Analysis of Papadimitriou's Algorithm
- Vídeo: Stable Matching [Optional]
- Vídeo: Matchings, Flows, and Braess's Paradox [Optional]
- Vídeo: Linear Programming and Beyond [Optional]
- Vídeo: Epilogue
- Reading: Optional Theory Problems (Week 4)
- Reading: Info and FAQ for final exam
Nota atribuída: Problem Set #4
Nota atribuída: Programming Assignment #4
Nota atribuída: Final Exam
Perguntas frequentes
Como funciona
Travail en cours
Chaque cours fonctionne comme un manuel interactif en proposant des vidéos préenregistrées, des quiz et des projets.
Aide de la part de vos pairs
Connectez-vous à des milliers d'autres étudiants et débattez sur des idées, discutez le contenu du cours et obtenez de l'aide pour en maîtriser les concepts.
Certificats
Obtenez une reconnaissance officielle pour votre travail et partagez votre réussite avec vos amis, vos collègues et vos employeurs.
Desenvolvedores
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.
Custo
| Comprar curso | |
|---|---|
| Acesso aos materiais do curso | Disponível |
| Acesso a materiais valendo nota | Disponível |
| Receba uma nota final | Disponível |
| Obtenha um Certificado de Curso compartilhável | Disponível |
Classificações e avaliações
Really happy to finish this specialization and I will still study algorithms in the future.
Excellent course! Bravo to the teacher for the commitment provided in this course. Kind regards.
A very nice introduction to algorithms from a high-level mathematical perspective. This course is great for building intuition about key concepts. Highly recommended. I did the Princeton algorithms course first. Both are great. The first tests one more on the implementation side and requires Java. This course is more focused on theory and a great complement. Too bad there is not a Part 5, 6, ….
O Coursera proporciona acesso universal à melhor educação do mundo fazendo parcerias com as melhores universidades e organizações para oferecer cursos on-line.
© 2018 Coursera Inc. Todos os direitos reservados.
This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.
One of the best courses I did on Coursera.