Об этом курсе: 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).
Для кого этот курс: 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.
Автор: Stanford University
Преподаватели: Tim Roughgarden, Professor
Computer Science
| Основные сведения | Course 3 of 4 in the Algorithms Specialization |
| Уровень | Intermediate |
| Выполнение | 4 weeks of study, 4-8 hours/week |
| Язык | English |
| Как пройти курс | Чтобы пройти курс, выполните все оцениваемые задания. |
| Оценки пользователей |
Программа курса
НЕДЕЛЯ 1
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
16 видео, 4 материалов для самостоятельного изучения
- Reading: Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: Lecture slides
- Видео: Application: Internet Routing
- Видео: Application: Sequence Alignment
- Видео: Introduction to Greedy Algorithms
- Видео: Application: Optimal Caching
- Видео: Problem Definition
- Видео: A Greedy Algorithm
- Видео: Correctness Proof - Part I
- Видео: Correctness Proof - Part II
- Видео: Handling Ties [Advanced - Optional]
- Видео: MST Problem Definition
- Видео: Prim's MST Algorithm
- Видео: Correctness Proof I
- Видео: Correctness Proof II
- Видео: Proof of Cut Property [Advanced - Optional]
- Видео: Fast Implementation I
- Видео: Fast Implementation II
- Reading: Optional Theory Problems (Week 1)
Оцениваемый: Problem Set #1
Оцениваемый: Programming Assignment #1
НЕДЕЛЯ 2
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
16 видео, 2 материалов для самостоятельного изучения
- Reading: Week 2 Overview
- Видео: Kruskal's MST Algorithm
- Видео: Correctness of Kruskal's Algorithm
- Видео: Implementing Kruskal's Algorithm via Union-Find I
- Видео: Implementing Kruskal's Algorithm via Union-Find II
- Видео: MSTs: State-of-the-Art and Open Questions [Advanced - Optional]
- Видео: Application to Clustering
- Видео: Correctness of Clustering Algorithm
- Видео: Lazy Unions [Advanced - Optional]
- Видео: Union-by-Rank [Advanced - Optional]
- Видео: Analysis of Union-by-Rank [Advanced - Optional]
- Видео: Path Compression [Advanced - Optional]
- Видео: Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]
- Видео: Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional]
- Видео: The Ackermann Function [Advanced - Optional]
- Видео: Path Compression: Tarjan's Analysis I [Advanced - Optional]
- Видео: Path Compression: Tarjan's Analysis II [Advanced - Optional]
- Reading: Optional Theory Problems (Week 2)
Оцениваемый: Problem Set #2
Оцениваемый: Programming Assignment #2
НЕДЕЛЯ 3
Week 3
Huffman codes; introduction to dynamic programming.
11 видео, 1 материал для самостоятельного изучения
- Reading: Week 3 Overview
- Видео: Introduction and Motivation
- Видео: Problem Definition
- Видео: A Greedy Algorithm
- Видео: A More Complex Example
- Видео: Correctness Proof I
- Видео: Correctness Proof II
- Видео: Introduction: Weighted Independent Sets in Path Graphs
- Видео: WIS in Path Graphs: Optimal Substructure
- Видео: WIS in Path Graphs: A Linear-Time Algorithm
- Видео: WIS in Path Graphs: A Reconstruction Algorithm
- Видео: Principles of Dynamic Programming
Оцениваемый: Problem Set #3
Оцениваемый: Programming Assignment #3
НЕДЕЛЯ 4
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
10 видео, 3 материалов для самостоятельного изучения
- Reading: Week 4 Overview
- Видео: The Knapsack Problem
- Видео: A Dynamic Programming Algorithm
- Видео: Example [Review - Optional]
- Видео: Optimal Substructure
- Видео: A Dynamic Programming Algorithm
- Видео: Problem Definition
- Видео: Optimal Substructure
- Видео: Proof of Optimal Substructure
- Видео: A Dynamic Programming Algorithm I
- Видео: A Dynamic Programming Algorithm II
- Reading: Optional Theory Problems (Week 4)
- Reading: Info and FAQ for final exam
Оцениваемый: Problem Set #4
Оцениваемый: Programming Assignment #4
Оцениваемый: Final Exam
Часто задаваемые вопросы
Как это работает
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.
Авторы
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.
Стоимость
| Приобрести курс | |
|---|---|
| Получить доступ к материалам курса | Доступен |
| Получить доступ к оцениваемым материалам курса | Доступен |
| Получить итоговую оценку | Доступен |
| Earn a shareable Course Certificate | Доступен |
Рейтинги и отзывы
Very difficult! That's what heroes do.
Excellent Course. I really enjoyed it. Stretched my imagination and analytical capacity to new frontiers. The problems studied during the course stimulate you to learn more about new algorithms and coding, There's so much more to learn now. Many thanks to Professor Roughgarden and his team for making this available. Keep the great work!
I thought this course was kind of harder than the 2 previous one in the specialization (mainly the problems sets which require way more thinking)
It's a very good quality course to strenghten the basics, but in depth.
Coursera делает лучшее в мире образование доступным каждому, предлагая онлайн-курсы от ведущих университетов и организаций.
© Coursera Inc., 2018 Все права защищены.
Tim Roughgarden manages to turn a dry topic like "Algos" into a sexy hot one!!