Об этом курсе: The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
Для кого этот курс: 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
| Основные сведения | Курс 2 из 4 — Algorithms Specialization |
| Уровень | Учащийся среднего уровня |
| Выполнение | 4 weeks of study, 4-8 hours/week |
| Язык | English |
| Как пройти курс | Чтобы пройти курс, выполните все оцениваемые задания. |
| Оценки пользователей |
Программа курса
НЕДЕЛЯ 1
Week 1
Breadth-first and depth-first search; computing strong components; applications.
9 видео, 4 материала для самостоятельного изучения
- Reading: Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: Lecture slides
- Видео: Breadth-First Search (BFS): The Basics
- Видео: BFS and Shortest Paths
- Видео: BFS and Undirected Connectivity
- Видео: Depth-First Search (DFS): The Basics
- Видео: Topological Sort
- Видео: Computing Strong Components: The Algorithm
- Видео: Computing Strong Components: The Analysis
- Видео: Structure of the Web [Optional]
- Reading: Optional Theory Problems (Week 1)
Оцениваемый: Problem Set #1
Оцениваемый: Programming Assignment #1
НЕДЕЛЯ 2
Week 2
Dijkstra's shortest-path algorithm.
4 видео, 2 материала для самостоятельного изучения
- Reading: Week 2 Overview
- Видео: Dijkstra's Algorithm: Examples
- Видео: Correctness of Dijkstra's Algorithm
- Видео: Dijkstra's Algorithm: Implementation and Running Time
- Reading: Optional Theory Problems (Week 2)
Оцениваемый: Problem Set #2
Оцениваемый: Programming Assignment #2
НЕДЕЛЯ 3
Week 3
Heaps; balanced binary search trees.
9 видео, 1 материал для самостоятельного изучения
- Reading: Week 3 Overview
- Видео: Heaps: Operations and Applications
- Видео: Heaps: Implementation Details [Advanced - Optional]
- Видео: Balanced Search Trees: Operations and Applications
- Видео: Binary Search Tree Basics, Part I
- Видео: Binary Search Tree Basics, Part II
- Видео: Red-Black Trees
- Видео: Rotations [Advanced - Optional]
- Видео: Insertion in a Red-Black Tree [Advanced]
Оцениваемый: Problem Set #3
Оцениваемый: Programming Assignment #3
НЕДЕЛЯ 4
Week 4
Hashing; bloom filters.
9 видео, 3 материала для самостоятельного изучения
- Reading: Week 4 Overview
- Видео: Hash Tables: Implementation Details, Part I
- Видео: Hash Tables: Implementation Details, Part II
- Видео: Pathological Data Sets and Universal Hashing Motivation
- Видео: Universal Hashing: Definition and Example [Advanced - Optional]
- Видео: Universal Hashing: Analysis of Chaining [Advanced - Optional]
- Видео: Hash Table Performance with Open Addressing [Advanced - Optional]
- Видео: Bloom Filters: The Basics
- Видео: Bloom Filters: Heuristic Analysis
- 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.
Стоимость
| Приобрести курс | |
|---|---|
| Получить доступ к материалам курса | Доступен |
| Получить доступ к оцениваемым материалам курса | Доступен |
| Получить итоговую оценку | Доступен |
| Получите сертификат о прохождении курса, ссылкой на который можно делиться с другими людьми | Доступен |
Рейтинги и отзывы
Very nice introduction to Graph Search. Thanks to the instructors!
Learning algorithms is a must for all computer scientists. This course propels you on the path and kindles the spirit of inquiry and knack for finding better solutions.
This course was much harder than the first one. Plan to spend extra time doing the assignments. However, it is totally worth it!
Coursera делает лучшее в мире образование доступным каждому, предлагая онлайн-курсы от ведущих университетов и организаций.
© Coursera Inc., 2018 Все права защищены.
clearly instruction to learn algorithm and well-designed assignment to practice