Über diesen Kurs

76,638 kürzliche Aufrufe

Karriereergebnisse der Lernenden

38%

nahm einen neuen Beruf nach Abschluss dieser Kurse auf

45%

ziehen Sie für Ihren Beruf greifbaren Nutzen aus diesem Kurs

14%

erhalten Sie eine Gehaltserhöhung oder Beförderung
Zertifikat zur Vorlage
Erhalten Sie nach Abschluss ein Zertifikat
100 % online
Beginnen Sie sofort und lernen Sie in Ihrem eigenen Tempo.
Flexible Fristen
Setzen Sie Fristen gemäß Ihrem Zeitplan zurück.
Stufe „Mittel“
Ca. 12 Stunden zum Abschließen
Englisch
Untertitel: Englisch

Kompetenzen, die Sie erwerben

Spanning TreeAlgorithmsDynamic ProgrammingGreedy Algorithm

Karriereergebnisse der Lernenden

38%

nahm einen neuen Beruf nach Abschluss dieser Kurse auf

45%

ziehen Sie für Ihren Beruf greifbaren Nutzen aus diesem Kurs

14%

erhalten Sie eine Gehaltserhöhung oder Beförderung
Zertifikat zur Vorlage
Erhalten Sie nach Abschluss ein Zertifikat
100 % online
Beginnen Sie sofort und lernen Sie in Ihrem eigenen Tempo.
Flexible Fristen
Setzen Sie Fristen gemäß Ihrem Zeitplan zurück.
Stufe „Mittel“
Ca. 12 Stunden zum Abschließen
Englisch
Untertitel: Englisch

Dozent

von

Stanford University-Logo

Stanford University

Lehrplan - Was Sie in diesem Kurs lernen werden

InhaltsbewertungThumbs Up94%(1,605 Bewertungen)Info
Woche
1

Woche 1

4 Stunden zum Abschließen

Week 1

4 Stunden zum Abschließen
16 Videos (Gesamt 160 min), 4 Lektüren, 2 Quiz
16 Videos
Application: Sequence Alignment8m
Introduction to Greedy Algorithms12m
Application: Optimal Caching10m
Problem Definition5m
A Greedy Algorithm12m
Correctness Proof - Part I6m
Correctness Proof - Part II4m
Handling Ties [Advanced - Optional]7m
MST Problem Definition11m
Prim's MST Algorithm7m
Correctness Proof I15m
Correctness Proof II8m
Proof of Cut Property [Advanced - Optional]11m
Fast Implementation I14m
Fast Implementation II9m
4 Lektüren
Week 1 Overview10m
Overview, Resources, and Policies10m
Lecture slides10m
Optional Theory Problems (Week 1)10m
2 praktische Übungen
Problem Set #110m
Programming Assignment #16m
Woche
2

Woche 2

4 Stunden zum Abschließen

Week 2

4 Stunden zum Abschließen
16 Videos (Gesamt 188 min), 2 Lektüren, 2 Quiz
16 Videos
Correctness of Kruskal's Algorithm9m
Implementing Kruskal's Algorithm via Union-Find I9m
Implementing Kruskal's Algorithm via Union-Find II13m
MSTs: State-of-the-Art and Open Questions [Advanced - Optional]9m
Application to Clustering11m
Correctness of Clustering Algorithm9m
Lazy Unions [Advanced - Optional]10m
Union-by-Rank [Advanced - Optional]12m
Analysis of Union-by-Rank [Advanced - Optional]14m
Path Compression [Advanced - Optional]14m
Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]9m
Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional]11m
The Ackermann Function [Advanced - Optional]16m
Path Compression: Tarjan's Analysis I [Advanced - Optional]14m
Path Compression: Tarjan's Analysis II [Advanced - Optional]13m
2 Lektüren
Week 2 Overview10m
Optional Theory Problems (Week 2)10m
2 praktische Übungen
Problem Set #210m
Programming Assignment #24m
Woche
3

Woche 3

2 Stunden zum Abschließen

Week 3

2 Stunden zum Abschließen
11 Videos (Gesamt 105 min), 1 Lektüre, 2 Quiz
11 Videos
Problem Definition10m
A Greedy Algorithm16m
A More Complex Example4m
Correctness Proof I10m
Correctness Proof II12m
Introduction: Weighted Independent Sets in Path Graphs7m
WIS in Path Graphs: Optimal Substructure9m
WIS in Path Graphs: A Linear-Time Algorithm9m
WIS in Path Graphs: A Reconstruction Algorithm6m
Principles of Dynamic Programming7m
1 Lektüre
Week 3 Overview10m
2 praktische Übungen
Problem Set #310m
Programming Assignment #36m
Woche
4

Woche 4

3 Stunden zum Abschließen

Week 4

3 Stunden zum Abschließen
10 Videos (Gesamt 107 min), 3 Lektüren, 3 Quiz
10 Videos
A Dynamic Programming Algorithm9m
Example [Review - Optional]12m
Optimal Substructure13m
A Dynamic Programming Algorithm12m
Problem Definition12m
Optimal Substructure9m
Proof of Optimal Substructure6m
A Dynamic Programming Algorithm I9m
A Dynamic Programming Algorithm II9m
3 Lektüren
Week 4 Overview10m
Optional Theory Problems (Week 4)10m
Info and FAQ for final exam10m
3 praktische Übungen
Problem Set #410m
Programming Assignment #44m
Final Exam20m

Bewertungen

Top-Bewertungen von GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING

Alle Bewertungen anzeigen

Über den Spezialisierung Algorithmen

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....
Algorithmen

Häufig gestellte Fragen

  • 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.

Haben Sie weitere Fragen? Besuchen Sie das Hilfe-Center für Teiln..