Informações sobre o curso

89,793 visualizações recentes

Resultados de carreira do aprendiz

38%

comecei uma nova carreira após concluir estes cursos

45%

consegui um benefício significativo de carreira com este curso

14%

recebi um aumento ou promoção
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Nível intermediário
Aprox. 12 horas para completar
Inglês
Legendas: Inglês

Habilidades que você terá

Spanning TreeAlgorithmsDynamic ProgrammingGreedy Algorithm

Resultados de carreira do aprendiz

38%

comecei uma nova carreira após concluir estes cursos

45%

consegui um benefício significativo de carreira com este curso

14%

recebi um aumento ou promoção
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Nível intermediário
Aprox. 12 horas para completar
Inglês
Legendas: Inglês

Instrutores

oferecido por

Logotipo de Universidade de Stanford

Universidade de Stanford

Programa - O que você aprenderá com este curso

Classificação do conteúdoThumbs Up94%(1,604 classificações)Info
Semana
1

Semana 1

4 horas para concluir

Week 1

4 horas para concluir
16 vídeos (Total 160 mín.), 4 leituras, 2 testes
16 videos
Application: Sequence Alignment8min
Introduction to Greedy Algorithms12min
Application: Optimal Caching10min
Problem Definition5min
A Greedy Algorithm12min
Correctness Proof - Part I6min
Correctness Proof - Part II4min
Handling Ties [Advanced - Optional]7min
MST Problem Definition11min
Prim's MST Algorithm7min
Correctness Proof I15min
Correctness Proof II8min
Proof of Cut Property [Advanced - Optional]11min
Fast Implementation I14min
Fast Implementation II9min
4 leituras
Week 1 Overview10min
Overview, Resources, and Policies10min
Lecture slides10min
Optional Theory Problems (Week 1)10min
2 exercícios práticos
Problem Set #110min
Programming Assignment #16min
Semana
2

Semana 2

4 horas para concluir

Week 2

4 horas para concluir
16 vídeos (Total 188 mín.), 2 leituras, 2 testes
16 videos
Correctness of Kruskal's Algorithm9min
Implementing Kruskal's Algorithm via Union-Find I9min
Implementing Kruskal's Algorithm via Union-Find II13min
MSTs: State-of-the-Art and Open Questions [Advanced - Optional]9min
Application to Clustering11min
Correctness of Clustering Algorithm9min
Lazy Unions [Advanced - Optional]10min
Union-by-Rank [Advanced - Optional]12min
Analysis of Union-by-Rank [Advanced - Optional]14min
Path Compression [Advanced - Optional]14min
Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]9min
Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional]11min
The Ackermann Function [Advanced - Optional]16min
Path Compression: Tarjan's Analysis I [Advanced - Optional]14min
Path Compression: Tarjan's Analysis II [Advanced - Optional]13min
2 leituras
Week 2 Overview10min
Optional Theory Problems (Week 2)10min
2 exercícios práticos
Problem Set #210min
Programming Assignment #24min
Semana
3

Semana 3

2 horas para concluir

Week 3

2 horas para concluir
11 vídeos (Total 105 mín.), 1 leitura, 2 testes
11 videos
Problem Definition10min
A Greedy Algorithm16min
A More Complex Example4min
Correctness Proof I10min
Correctness Proof II12min
Introduction: Weighted Independent Sets in Path Graphs7min
WIS in Path Graphs: Optimal Substructure9min
WIS in Path Graphs: A Linear-Time Algorithm9min
WIS in Path Graphs: A Reconstruction Algorithm6min
Principles of Dynamic Programming7min
1 leituras
Week 3 Overview10min
2 exercícios práticos
Problem Set #310min
Programming Assignment #36min
Semana
4

Semana 4

3 horas para concluir

Week 4

3 horas para concluir
10 vídeos (Total 107 mín.), 3 leituras, 3 testes
10 videos
A Dynamic Programming Algorithm9min
Example [Review - Optional]12min
Optimal Substructure13min
A Dynamic Programming Algorithm12min
Problem Definition12min
Optimal Substructure9min
Proof of Optimal Substructure6min
A Dynamic Programming Algorithm I9min
A Dynamic Programming Algorithm II9min
3 leituras
Week 4 Overview10min
Optional Theory Problems (Week 4)10min
Info and FAQ for final exam10min
3 exercícios práticos
Problem Set #410min
Programming Assignment #44min
Final Exam20min

Avaliações

Principais avaliações do GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING

Visualizar todas as avaliações

Sobre Programa de cursos integrados 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. About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications....
Algoritmos

Perguntas Frequentes – FAQ

  • Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:

    • The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.

    • The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.

  • When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

  • If you subscribed, you get a 7-day free trial during which you can cancel at no penalty. After that, we don’t give refunds, but you can cancel your subscription at any time. See our full refund policy.

  • Yes, Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You'll be prompted to complete an application and will be notified if you are approved. You'll need to complete this step for each course in the Specialization, including the Capstone Project. Learn more.

Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.