Informações sobre o curso: 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).
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: Stanford University
Ministrado por: Tim Roughgarden, Professor
Computer Science
| Informações básicas | Curso 3 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
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
16 videos, 4 leituras
- Reading: Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: Lecture slides
- Vídeo: Application: Sequence Alignment
- Vídeo: Introduction to Greedy Algorithms
- Vídeo: Application: Optimal Caching
- Vídeo: Problem Definition
- Vídeo: A Greedy Algorithm
- Vídeo: Correctness Proof - Part I
- Vídeo: Correctness Proof - Part II
- Vídeo: Handling Ties [Advanced - Optional]
- Vídeo: MST Problem Definition
- Vídeo: Prim's MST Algorithm
- Vídeo: Correctness Proof I
- Vídeo: Correctness Proof II
- Vídeo: Proof of Cut Property [Advanced - Optional]
- Vídeo: Fast Implementation I
- Vídeo: Fast Implementation II
- Reading: Optional Theory Problems (Week 1)
Nota atribuída: Problem Set #1
Nota atribuída: Programming Assignment #1
SEMANA 2
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
16 videos, 2 leituras
- Reading: Week 2 Overview
- Vídeo: Correctness of Kruskal's Algorithm
- Vídeo: Implementing Kruskal's Algorithm via Union-Find I
- Vídeo: Implementing Kruskal's Algorithm via Union-Find II
- Vídeo: MSTs: State-of-the-Art and Open Questions [Advanced - Optional]
- Vídeo: Application to Clustering
- Vídeo: Correctness of Clustering Algorithm
- Vídeo: Lazy Unions [Advanced - Optional]
- Vídeo: Union-by-Rank [Advanced - Optional]
- Vídeo: Analysis of Union-by-Rank [Advanced - Optional]
- Vídeo: Path Compression [Advanced - Optional]
- Vídeo: Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]
- Vídeo: Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional]
- Vídeo: The Ackermann Function [Advanced - Optional]
- Vídeo: Path Compression: Tarjan's Analysis I [Advanced - Optional]
- Vídeo: Path Compression: Tarjan's Analysis II [Advanced - Optional]
- Reading: Optional Theory Problems (Week 2)
Nota atribuída: Problem Set #2
Nota atribuída: Programming Assignment #2
SEMANA 3
Week 3
Huffman codes; introduction to dynamic programming.
11 videos, 1 leituras
- Reading: Week 3 Overview
- Vídeo: Problem Definition
- Vídeo: A Greedy Algorithm
- Vídeo: A More Complex Example
- Vídeo: Correctness Proof I
- Vídeo: Correctness Proof II
- Vídeo: Introduction: Weighted Independent Sets in Path Graphs
- Vídeo: WIS in Path Graphs: Optimal Substructure
- Vídeo: WIS in Path Graphs: A Linear-Time Algorithm
- Vídeo: WIS in Path Graphs: A Reconstruction Algorithm
- Vídeo: Principles of Dynamic Programming
Nota atribuída: Problem Set #3
Nota atribuída: Programming Assignment #3
SEMANA 4
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
10 videos, 3 leituras
- Reading: Week 4 Overview
- Vídeo: A Dynamic Programming Algorithm
- Vídeo: Example [Review - Optional]
- Vídeo: Optimal Substructure
- Vídeo: A Dynamic Programming Algorithm
- Vídeo: Problem Definition
- Vídeo: Optimal Substructure
- Vídeo: Proof of Optimal Substructure
- Vídeo: A Dynamic Programming Algorithm I
- Vídeo: A Dynamic Programming Algorithm II
- 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
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
Desenvolvedores
Stanford University
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 great and challenging course!!!!
Great material, explained very well, but the lack of feedback on tough problem sets can be frustrating;
The most difficult course in the specialization so far. I learned a lot.
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.
Amazing course! Great content indeed!