DebuggingSoftware TestingAlgorithmsData StructureComputer ProgrammingDynamic ProgrammingBinary Search TreePriority QueueHash TableStack (Abstract Data Type)ListGraph Theory
データ構造とアルゴリズム専門講座
Master Algorithmic Programming Techniques. Learn algorithms through programming and advance your software engineering or data science career
提供：
カリフォルニア大学サンディエゴ校
ロシア国立研究大学経済高等学院（National Research University Higher School of Economics）
データ構造とアルゴリズム専門講座カリフォルニア大学サンディエゴ校学習内容
Apply basic algorithmic techniques such as greedy algorithms, binary search, sorting and dynamic programming to solve programming challenges.
Apply various data structures such as stack, queue, hash table, priority queue, binary search tree, graph and string to solve programming challenges.
Apply graph and string algorithms to solve real-world challenges: finding shortest paths on huge maps and assembling genomes from millions of pieces.
Solve complex programming challenges using advanced techniques: maximum flow, linear programming, approximate algorithms, SAT-solvers, streaming.
習得するスキル
この専門講座について
171,013 最近の表示
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.
応用学習プロジェクト
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.
受講生の就業成果
37%
この専門講座終了後に新しいキャリアをスタートしました
25%
昇給や昇進につながった
共有できる証明書
修了時に証明書を取得
100%オンラインコース
自分のスケジュールですぐに学習を始めてください。
フレキシブルなスケジュール
柔軟性のある期限の設定および維持
中級レベル
Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction.
約8か月で修了
推奨6時間/週
英語
字幕：英語, スペイン語, フランス語, ポルトガル語（ブラジル）, ロシア語
受講生の就業成果
37%
この専門講座終了後に新しいキャリアをスタートしました
25%
昇給や昇進につながった
共有できる証明書
修了時に証明書を取得
100%オンラインコース
自分のスケジュールですぐに学習を始めてください。
フレキシブルなスケジュール
柔軟性のある期限の設定および維持
中級レベル
Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction.
約8か月で修了
推奨6時間/週
英語
字幕：英語, スペイン語, フランス語, ポルトガル語（ブラジル）, ロシア語
この専門講座には6コースあります。
Algorithmic Toolbox
9,126件の評価
The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem into pieces and solve them recursively; when it makes sense to proceed greedily; how dynamic programming is used in genomic studies. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second).
データ構造
3,455件の評価
A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures.
Algorithms on Graphs
1,763件の評価
If you have ever used a navigation service to find optimal route and estimate time to destination, you've used algorithms on graphs. 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 in Facebook, you're going to work with graphs and algorithms on graphs.
文字列アルゴリズム
881件の評価
World and internet is full of textual information. We search for information using textual queries, we read websites, books, e-mails. All those are strings from the point of view of computer science. To make sense of all that information and make search efficient, search engines use many string algorithms. Moreover, the emerging field of personalized medicine uses many search algorithms to find disease-causing mutations in the human genome.
提供：
カリフォルニア大学サンディエゴ校
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.
よくある質問
専門講座を修了することで大学の単位は付与されますか？
If you subscribed, you get a 7-day free trial during which you can cancel at no penalty. After that, we don’t give refunds, but you can cancel your subscription at any time. See our full refund policy.
Can I just enroll in a single course?
サブスクライブすると、7日間の無料トライアルを体験できます。この期間中は解約金なしでキャンセルできます。それ以降、払い戻しはありませんが、サブスクリプションをいつでもキャンセルできます。返金ポリシーをすべて表示します。
1つのコースだけに登録することは可能ですか？
はい。まず始めに興味のあるコースカードをクリックして登録します。コースに登録して修了することによって、共有できる修了証を取得するか、無料でコースを聴講してコースの教材を確認することができます。専門講座の一部であるコースにサブスクライブすると、専門講座全体に自動的にサブスクライブされます。進捗を追跡するには、受講生のダッシュボードにアクセスしてください。
Can I take the course for free?
はい。受講料の支払いが難しい受講生に、Coursera（コーセラ）は学資援助を提供しています。左側の［登録］ボタンの下にある［学資援助］のリンクをクリックして申請してください。申請書の入力を促すメッセージが表示され、承認されると通知が届きます。キャップストーンプロジェクトを含む専門講座の各コースでこのステップを完了する必要があります。詳細。
無料でコースを受講できますか？
コースに登録すると専門講座のすべてのコースにアクセスできるようになり、コースを修了すると修了証を取得できます。コース内容の閲覧のみを希望する場合は、無料でコースを聴講することができます。受講料の支払いが難しい場合は、学資援助を申請することができます。
このコースは100%オンラインで提供されますか？実際に出席する必要のあるクラスはありますか？
このコースは完全にオンラインで提供されているため、実際に教室に出席する必要はありません。Webまたはモバイル機器からいつでもどこからでも講義、学習用教材、課題にアクセスできます。
What background knowledge is necessary?
1. Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala.
We expect you to be able to implement programs that: 1) read data from the standard input (in most cases, the input is a sequence of integers); 2) compute the result (in most cases, a few loops are enough for this); 3) print the result to the standard output. For each programming challenge in this course, we provide starter solutions in C++, Java, and Python. The best way to check whether your programming skills are enough to go through problems in this specialization is to solve two problems from the first week. If you are able to pass them (after reading our tutorials), then you will definitely be able to pass the course.
2. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction.
Knowledge of discrete mathematics is necessary for analyzing algorithms (proving correctness, estimating running time) and for algorithmic thinking in general. If you want to refresh your discrete mathematics skills, we encourage you to go through our partner specialization — Introduction to Discrete Mathematics for Computer Science (https://www.coursera.org/specializations/discrete-mathematics). It teaches the basics of discrete mathematics in try-this-before-we-explain-everything approach: you will be solving many interactive puzzles that were carefully designed to allow you to invent many of the important ideas and concepts yoursel
What is the difference between this course and other courses covering algorithms?
We believe that learning the theory behind algorithms (like in most Algorithms 101 courses taught at 1000s universities) is important but not sufficient for a professional computer scientist today. This specialization combines the theory of algorithms with many programming challenges. In contrast with many Algorithms 101 courses, you will implement over 100 algorithmic problems in the programming language of your choice. And you will see yourself that the best way to understand an algorithm is to implement it!
How long does it take to complete the Specialization?
Time to completion can vary based on your schedule, but most learners are able to complete the Specialization in 6-8 months.
専門講座を修了するのにどのくらいの期間かかりますか？
Each course in the Specialization is offered on a regular schedule, with sessions starting about once per month. If you don't complete a course on the first try, you can easily transfer to the next session, and your completed work and grades will carry over.
専門講座の各コースはどのくらいの頻度で提供されますか？
Basic knowledge of at least one programming language (C/C++, Java, Python): loops, arrays, stacks, recursion. Basic knowledge of mathematics: proof by induction, proof by contradiction.
Do I need to take the courses in a specific order?
We recommend taking the courses in the order presented, as each subsequent course will build on material from previous courses.
Will I earn university credit for completing the Specialization?
Coursera courses and certificates don't carry university credit, though some universities may choose to accept Specialization Certificates for credit. Check with your institution to learn more.
専門講座を修了することで大学の単位は付与されますか？
The lectures in this specialization will be self-contained. Most lectures will be based on the bestselling textbook "Algorithms" co-authored by Sanjoy Dasgupta from University of California at San Diego as well as Christos Papadimitriou and Umesh Vazirani from University of California at Berkeley. In addition to UCSD and Berkeley, the textbook has been adopted in over 100 top universities and is available on Internet.
さらに質問がある場合は、受講者向けヘルプセンターにアクセスしてください。
