Informações sobre o curso
4.7
891 classificações
155 avaliações
Programa de cursos integrados
100% online

100% online

Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis

Prazos flexíveis

Redefinir os prazos de acordo com sua programação.
Nível intermediário

Nível intermediário

Horas para completar

Aprox. 18 horas para completar

Sugerido: 5 weeks of study, 3-4 hours/week...
Idiomas disponíveis

Inglês

Legendas: Inglês

Habilidades que você terá

Graph TheoryGraphsGraph Algorithms
Programa de cursos integrados
100% online

100% online

Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis

Prazos flexíveis

Redefinir os prazos de acordo com sua programação.
Nível intermediário

Nível intermediário

Horas para completar

Aprox. 18 horas para completar

Sugerido: 5 weeks of study, 3-4 hours/week...
Idiomas disponíveis

Inglês

Legendas: Inglês

Programa - O que você aprenderá com este curso

Semana
1
Horas para completar
4 horas para concluir

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....
Reading
5 vídeos (total de (Total 43 mín.) min), 3 leituras, 1 teste
Video5 videos
Representing Graphs9min
Exploring Graphs14min
Connectivity5min
Previsit and Postvisit Orderings7min
Reading3 leituras
Welcome10min
Slides and External References10min
Slides and External References10min
Semana
2
Horas para completar
4 horas para concluir

Decomposition of Graphs 2

This week we continue to study graph decomposition algorithms, but now for directed graphs....
Reading
4 vídeos (total de (Total 36 mín.) min), 1 leitura, 1 teste
Video4 videos
Topological Sort9min
Strongly Connected Components7min
Computing Strongly Connected Components10min
Reading1 leituras
Slides and External References10min
Semana
3
Horas para completar
4 horas para concluir

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....
Reading
8 vídeos (total de (Total 55 mín.) min), 1 leitura, 1 teste
Video8 videos
Breadth-First Search7min
Breadth-First Search (continued)6min
Implementation and Analysis9min
Proof of Correctness7min
Proof of Correctness (continued)5min
Shortest-Path Tree6min
Reconstructing the Shortest Path3min
Reading1 leituras
Slides and External References10min
Semana
4
Horas para completar
5 horas para concluir

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....
Reading
12 vídeos (total de (Total 86 mín.) min), 2 leituras, 1 teste
Video12 videos
Naive Algorithm10min
Dijkstra's Algorithm: Intuition and Example7min
Dijkstra's Algorithm: Implementation3min
Dijkstra's Algorithm: Proof of Correctness4min
Dijkstra's Algorithm: Running Time7min
Currency Exchange6min
Currency Exchange: Reduction to Shortest Paths8min
Bellman-Ford Algorithm6min
Bellman-Ford Algorithm: Proof of Correctness6min
Negative Cycles7min
Infinite Arbitrage10min
Reading2 leituras
Slides and External References10min
Slides and External References10min
4.7
155 avaliaçõesChevron Right

Melhores avaliações

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

por EMSep 23rd 2017

Great!\n\nHard concepts explained clearly and in depth, in the same fashion as the previous two courses (Algo Toolbox and Data Structure).\n\nGood job!

Instrutores

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

Sobre University of California San Diego

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

Sobre National Research University Higher School of Economics

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 communications, IT, mathematics, engineering, and more. Learn more on www.hse.ru...

Sobre o Programa de cursos integrados Data Structures and Algorithms

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....
Data Structures and Algorithms

Perguntas Frequentes – FAQ

  • Ao se inscrever para um Certificado, você terá acesso a todos os vídeos, testes e tarefas de programação (se aplicável). Tarefas avaliadas pelos colegas apenas podem ser enviadas e avaliadas após o início da sessão. Caso escolha explorar o curso sem adquiri-lo, talvez você não consiga acessar certas tarefas.

  • Quando você se inscreve no curso, tem acesso a todos os cursos na Especialização e pode obter um certificado quando concluir o trabalho. Seu Certificado eletrônico será adicionado à sua página de Participações e você poderá imprimi-lo ou adicioná-lo ao seu perfil no LinkedIn. Se quiser apenas ler e assistir o conteúdo do curso, você poderá frequentá-lo como ouvinte sem custo.

Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.