Об этом курсе
Недавно просмотрено: 49,528

100% онлайн

Начните сейчас и учитесь по собственному графику.

Гибкие сроки

Назначьте сроки сдачи в соответствии со своим графиком.

Промежуточный уровень

Английский

Субтитры: Английский

Приобретаемые навыки

Graph TheoryGraphsGraph Algorithms

100% онлайн

Начните сейчас и учитесь по собственному графику.

Гибкие сроки

Назначьте сроки сдачи в соответствии со своим графиком.

Промежуточный уровень

Английский

Субтитры: Английский

Программа курса: что вы изучите

Неделя
1
4 ч. на завершение

Decomposition of Graphs 1

Graphs arise in various real-world situations as there are road networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get to work, cheapest way to connect set of computers into a network or efficient algorithm to automatically find communities and opinion leaders hot in Facebook, you're going to work with graphs and algorithms on graphs. In this module, you will learn ways to represent a graph as well as basic algorithms for decomposing graphs into parts. In the programming assignment of this module, you will apply the algorithms that you’ve learned to implement efficient programs for exploring mazes, analyzing Computer Science curriculum, and analyzing road networks. In the first week of the module, we focus on undirected graphs.

...
5 видео ((всего 43 мин.)), 3 материалов для самостоятельного изучения, 1 тест
5 видео
Representing Graphs9мин
Exploring Graphs14мин
Connectivity5мин
Previsit and Postvisit Orderings7мин
3 материала для самостоятельного изучения
Welcome10мин
Slides and External References10мин
Slides and External References10мин
Неделя
2
4 ч. на завершение

Decomposition of Graphs 2

This week we continue to study graph decomposition algorithms, but now for directed graphs.

...
4 видео ((всего 36 мин.)), 1 материал для самостоятельного изучения, 1 тест
4 видео
Topological Sort9мин
Strongly Connected Components7мин
Computing Strongly Connected Components10мин
1 материал для самостоятельного изучения
Slides and External References10мин
Неделя
3
4 ч. на завершение

Paths in Graphs 1

In this module you will study algorithms for finding Shortest Paths in Graphs. These algorithms have lots of applications. When you launch a navigation app on your smartphone like Google Maps or Yandex.Navi, it uses these algorithms to find you the fastest route from work to home, from home to school, etc. When you search for airplane tickets, these algorithms are used to find a route with the minimum number of plane changes. Unexpectedly, these algorithms can also be used to determine the optimal way to do currency exchange, sometimes allowing to earh huge profit! We will cover all these applications, and you will learn Breadth-First Search, Dijkstra's Algorithm and Bellman-Ford Algorithm. These algorithms are efficient and lay the foundation for even more efficient algorithms which you will learn and implement in the Shortest Paths Capstone Project to find best routes on real maps of cities and countries, find distances between people in Social Networks. In the end you will be able to find Shortest Paths efficiently in any Graph. This week we will study Breadth-First Search algorithm.

...
8 видео ((всего 55 мин.)), 1 материал для самостоятельного изучения, 1 тест
8 видео
Breadth-First Search7мин
Breadth-First Search (continued)6мин
Implementation and Analysis9мин
Proof of Correctness7мин
Proof of Correctness (continued)5мин
Shortest-Path Tree6мин
Reconstructing the Shortest Path3мин
1 материал для самостоятельного изучения
Slides and External References10мин
Неделя
4
5 ч. на завершение

Paths in Graphs 2

This week we continue to study Shortest Paths in Graphs. You will learn Dijkstra's Algorithm which can be applied to find the shortest route home from work. You will also learn Bellman-Ford's algorithm which can unexpectedly be applied to choose the optimal way of exchanging currencies. By the end you will be able to find shortest paths efficiently in any Graph.

...
12 видео ((всего 86 мин.)), 2 материалов для самостоятельного изучения, 1 тест
12 видео
Naive Algorithm10мин
Dijkstra's Algorithm: Intuition and Example7мин
Dijkstra's Algorithm: Implementation3мин
Dijkstra's Algorithm: Proof of Correctness4мин
Dijkstra's Algorithm: Running Time7мин
Currency Exchange6мин
Currency Exchange: Reduction to Shortest Paths8мин
Bellman-Ford Algorithm6мин
Bellman-Ford Algorithm: Proof of Correctness6мин
Negative Cycles7мин
Infinite Arbitrage10мин
2 материала для самостоятельного изучения
Slides and External References10мин
Slides and External References10мин
4.7
Рецензии: 176Chevron Right

27%

начал новую карьеру, пройдя эти курсы

20%

получил значимые преимущества в карьере благодаря этому курсу

15%

стал больше зарабатывать или получил повышение

Лучшие отзывы о курсе Algorithms on Graphs

автор: CCOct 7th 2018

Good balance between theory and practice. The assignments are well thought to measure the understanding of videos, which I had to watch many times to grasp the hidden tips from the instructor.

автор: SKApr 24th 2018

This course is very much helpful for the graph beginners. As a suggestion, i would like to say that add some extra contents on the data structures which is to be used in the algorithm.

Преподаватели

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Michael Levin

Lecturer
Computer Science
Avatar

Daniel M Kane

Assistant Professor
Department of Computer Science and Engineering / Department of Mathematics
Avatar

Neil Rhodes

Adjunct Faculty
Computer Science and Engineering

О Калифорнийский университет в Сан-Диего

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory....

О Национальный исследовательский университет "Высшая школа экономики"

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more. Learn more on www.hse.ru...

О специализации ''Структуры и алгоритмы данных'

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms...or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine....
Структуры и алгоритмы данных

Часто задаваемые вопросы

  • Зарегистрировавшись на сертификацию, вы получите доступ ко всем видео, тестам и заданиям по программированию (если они предусмотрены). Задания по взаимной оценке сокурсниками можно сдавать и проверять только после начала сессии. Если вы проходите курс без оплаты, некоторые задания могут быть недоступны.

  • Записавшись на курс, вы получите доступ ко всем курсам в специализации, а также возможность получить сертификат о его прохождении. После успешного прохождения курса на странице ваших достижений появится электронный сертификат. Оттуда его можно распечатать или прикрепить к профилю LinkedIn. Просто ознакомиться с содержанием курса можно бесплатно.

Остались вопросы? Посетите Центр поддержки учащихся.