このコースについて
49,224 最近の表示

100%オンライン

自分のスケジュールですぐに学習を始めてください。

柔軟性のある期限

スケジュールに従って期限をリセットします。

中級レベル

約17時間で修了

推奨:5 weeks of study, 3-4 hours/week...

英語

字幕:英語

習得するスキル

Graph TheoryGraphsGraph Algorithms

100%オンライン

自分のスケジュールですぐに学習を始めてください。

柔軟性のある期限

スケジュールに従って期限をリセットします。

中級レベル

約17時間で修了

推奨:5 weeks of study, 3-4 hours/week...

英語

字幕:英語

シラバス - 本コースの学習内容

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 readings, 1 quiz
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 reading, 1 quiz
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 reading, 1 quiz
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 readings, 1 quiz
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
182件のレビューChevron Right

27%

コース終了後に新しいキャリアをスタートした

20%

コースが具体的なキャリアアップにつながった

15%

昇給や昇進につながった

Algorithms on Graphs からの人気レビュー

by CSJul 1st 2019

Excellent Course for anyone looking to expertise Graph Algorithm. Professor's explained each problem and algorithm in a very easy to learn approach. Grades are tough and yet func to get challenged.

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

講師

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)について

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のプロフィールに追加したりできます。コースの内容の閲覧のみを希望する場合は、無料でコースを聴講できます。

さらに質問がある場合は、受講者向けヘルプセンターにアクセスしてください。