À propos de ce cours : 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).
Les destinataires de ce cours : 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.
Créé par : Stanford University
Enseigné par : Tim Roughgarden, Professor
Computer Science
| Informations de base | Cours 3 de 4 dans Algorithms Specialization |
| Niveau | Intermédiaire |
| Engagement | 4 weeks of study, 4-8 hours/week |
| Langue | English |
| Comment réussir | Réussissez tous les devoirs notés pour terminer le cours. |
| Notes des utilisateurs |
Programme de cours
SEMAINE 1
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
16 vidéos, 4 lectures
- 阅读: Week 1 Overview
- 阅读: Overview, Resources, and Policies
- 阅读: Lecture slides
- Vidéo: Application: Sequence Alignment
- Vidéo: Introduction to Greedy Algorithms
- Vidéo: Application: Optimal Caching
- Vidéo: Problem Definition
- Vidéo: A Greedy Algorithm
- Vidéo: Correctness Proof - Part I
- Vidéo: Correctness Proof - Part II
- Vidéo: Handling Ties [Advanced - Optional]
- Vidéo: MST Problem Definition
- Vidéo: Prim's MST Algorithm
- Vidéo: Correctness Proof I
- Vidéo: Correctness Proof II
- Vidéo: Proof of Cut Property [Advanced - Optional]
- Vidéo: Fast Implementation I
- Vidéo: Fast Implementation II
- 阅读: Optional Theory Problems (Week 1)
Noté: Problem Set #1
Noté: Programming Assignment #1
SEMAINE 2
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
16 vidéos, 2 lectures
- 阅读: Week 2 Overview
- Vidéo: Correctness of Kruskal's Algorithm
- Vidéo: Implementing Kruskal's Algorithm via Union-Find I
- Vidéo: Implementing Kruskal's Algorithm via Union-Find II
- Vidéo: MSTs: State-of-the-Art and Open Questions [Advanced - Optional]
- Vidéo: Application to Clustering
- Vidéo: Correctness of Clustering Algorithm
- Vidéo: Lazy Unions [Advanced - Optional]
- Vidéo: Union-by-Rank [Advanced - Optional]
- Vidéo: Analysis of Union-by-Rank [Advanced - Optional]
- Vidéo: Path Compression [Advanced - Optional]
- Vidéo: Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]
- Vidéo: Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional]
- Vidéo: The Ackermann Function [Advanced - Optional]
- Vidéo: Path Compression: Tarjan's Analysis I [Advanced - Optional]
- Vidéo: Path Compression: Tarjan's Analysis II [Advanced - Optional]
- 阅读: Optional Theory Problems (Week 2)
Noté: Problem Set #2
Noté: Programming Assignment #2
SEMAINE 3
Week 3
Huffman codes; introduction to dynamic programming.
11 vidéos, 1 lecture
- 阅读: Week 3 Overview
- Vidéo: Problem Definition
- Vidéo: A Greedy Algorithm
- Vidéo: A More Complex Example
- Vidéo: Correctness Proof I
- Vidéo: Correctness Proof II
- Vidéo: Introduction: Weighted Independent Sets in Path Graphs
- Vidéo: WIS in Path Graphs: Optimal Substructure
- Vidéo: WIS in Path Graphs: A Linear-Time Algorithm
- Vidéo: WIS in Path Graphs: A Reconstruction Algorithm
- Vidéo: Principles of Dynamic Programming
Noté: Problem Set #3
Noté: Programming Assignment #3
SEMAINE 4
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
10 vidéos, 3 lectures
- 阅读: Week 4 Overview
- Vidéo: A Dynamic Programming Algorithm
- Vidéo: Example [Review - Optional]
- Vidéo: Optimal Substructure
- Vidéo: A Dynamic Programming Algorithm
- Vidéo: Problem Definition
- Vidéo: Optimal Substructure
- Vidéo: Proof of Optimal Substructure
- Vidéo: A Dynamic Programming Algorithm I
- Vidéo: A Dynamic Programming Algorithm II
- 阅读: Optional Theory Problems (Week 4)
- 阅读: Info and FAQ for final exam
Noté: Problem Set #4
Noté: Programming Assignment #4
Noté: Final Exam
FAQ
Comment cela fonctionne
课程作业
每门课程都像是一本互动的教科书，具有预先录制的视频、测验和项目。
来自同学的帮助
与其他成千上万的学生相联系，对想法进行辩论，讨论课程材料，并寻求帮助来掌握概念。
证书
获得正式认证的作业，并与朋友、同事和雇主分享您的成功。
Créateurs
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.
Tarification
| Acheter le cours | |
|---|---|
| Accéder au contenu du cours | Disponible |
| Accéder au contenu noté | Disponible |
| Recevoir une Note Finale | Disponible |
| Obtenir un Certificat de Cours partageable | Disponible |
Notation et examens
excellent course
A great course, likewise the other courses in the series. It is probably the best series of algorithmic thinking courses.
Tim Roughgarden is a fantastic teacher! He really cares about explaining in a simple manner and also give you useful hints and advices to dive deeper in all the topics of the course. Thanks, Tim!
Coursera propose un accès universel à la meilleure formation au monde,
en partenariat avec des universités et des organisations du plus haut niveau, pour proposer des cours en ligne.
© 2018 Coursera Inc. Tous droits réservés.
Not bad programming tests. At least it made me try