Master Algorithmic Programming Techniques. Advance your Software Engineering or Data Science Career by Learning Algorithms through Programming and Puzzle Solving. Ace coding interviews by implementing each algorithmic challenge in this Specialization. Apply the newly-learned algorithmic techniques to real-life problems, such as analyzing a huge social network or sequencing a genome of a deadly pathogen.

4.6

звезд

Оценки: 11,387

Alexander S. Kulikov и еще 4 преподавателя

245 280 уже зарегистрированы

от партнера

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

НИУ ВШЭ

Специализация Структуры и алгоритмы данныхКалифорнийский университет в Сан-Диего

Чему вы научитесь

Play with 50 algorithmic puzzles on your smartphone to develop your algorithmic intuition! Apply algorithmic techniques (greedy algorithms, binary search, dynamic programming, etc.) and data structures (stacks, queues, trees, graphs, etc.) to solve 100 programming challenges that often appear at interviews at high-tech companies. Get an instant feedback on whether your solution is correct.

Apply the newly learned algorithms to solve real-world challenges: navigating in a Big Network or assembling a genome of a deadly pathogen from millions of short substrings of its DNA.

Learn exactly the same material as undergraduate students in “Algorithms 101” at top universities and more! If you decide to venture beyond Algorithms 101, try to solve more complex programming challenges (flows in networks, linear programming, streaming algorithms, etc.) and complete an equivalent of a graduate course in algorithms!

Solve complex programming challenges using advanced techniques: maximum flow, linear programming, approximate algorithms, SAT-solvers, streaming.

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

DebuggingSoftware TestingAlgorithmsData StructureComputer ProgrammingDynamic ProgrammingBinary Search TreePriority QueueHash TableStack (Abstract Data Type)ListGraph Theory

Специализация: общие сведения

Недавно просмотрено: 164 552

Computer science legend Donald Knuth once said “I don’t understand things unless I try to program them.” We also believe that the best way to learn an algorithm is to program it. However, many excellent books and online courses on algorithms, that excel in introducing algorithmic ideas, have not yet succeeded in teaching you how to implement algorithms, the crucial computer science skill that you have to master at your next job interview. We tried to fill this gap by forming a diverse team of instructors that includes world-leading experts in theoretical and applied algorithms at UCSD (Daniel Kane, Alexander Kulikov, and Pavel Pevzner), a chief data scientist at Yandex (Michael Levin), and a former software engineer at Google (Neil Rhodes). This unique combination of skills makes this Specialization different from other excellent MOOCs on algorithms that are all developed by theoretical computer scientists. While these MOOCs focus on theory, our Specialization is a mix of algorithmic theory/practice/applications with software engineering. You will learn algorithms by implementing nearly 100 coding problems in a programming language of your choice. To the best of knowledge, no other online course in Algorithms comes close to offering you a wealth of programming challenges (and puzzles!) that you may face at your next job interview. We invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs.

Проект прикладного обучения

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 shortest path algorithms you learn in the standard Algorithms 101 course! 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.

Сертификат, ссылками на который можно делиться с другими людьми

Получите сертификат по завершении

Только онлайн-курсы

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

Гибкий график

Установите гибкие сроки сдачи заданий.

Средний уровень

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 ч/неделю

Английский

Субтитры: Английский, Арабский, Французский, Португальский (Европа), Итальянский, Вьетнамский, Немецкий, Русский, Испанский

Сертификат, ссылками на который можно делиться с другими людьми

Получите сертификат по завершении

Только онлайн-курсы

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

Гибкий график

Установите гибкие сроки сдачи заданий.

Средний уровень

Ориентировочное время на прохождение: 8 месяцев

Рекомендуемый темп: 6 ч/неделю

Английский

О специализации

Пройти курсы

Специализация Coursera — это серия курсов, помогающих в совершенстве овладеть определенным навыком. Можно сразу записаться на специализацию или просмотреть курсы, из которых она состоит и выбрать тот, с которого вы хотите начать. Подписываясь на курс, который входит в специализацию, вы автоматически подписываетесь на всю специализацию. Можно завершить всего один курс, а потом сделать паузу в обучении или в любой момент отменить подписку. Отслеживайте свои курсы и прогресс на панели управления учащегося.

Практический проект

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

Получите сертификат

Когда вы пройдете все курсы и завершите практический проект, вы получите сертификат, которым можно поделиться с потенциальными работодателями и коллегами.

Специализация включает несколько курсов: 6

Курс1

Курс 1

Algorithmic Toolbox

4.6

звезд

Оценки: 11,002

•

Рецензии: 2,345

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

Курс2

Курс 2

структуры данных

4.6

звезд

Оценки: 4,425

•

Рецензии: 759

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.

A few examples of questions that we are going to cover in this class are the following: 1. What is a good strategy of resizing a dynamic array? 2. How priority queues are implemented in C++, Java, and Python? 3. How to implement a hash table so that the amortized running time of all operations is O(1) on average? 4. What are good strategies to keep a binary tree balanced? You will also learn how services like Dropbox manage to upload some large files instantly and to save a lot of storage space!

Курс3

Курс 3

Algorithms on Graphs

4.7

звезд

Оценки: 2,025

•

Рецензии: 342

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.

In this course, you will first learn what a graph is and what are some of the most important properties. Then you'll learn several ways to traverse graphs and how you can do useful things while traversing the graph in some order. We will then talk about shortest paths algorithms — from the basic ones to those which open door for 1000000 times faster algorithms used in Google Maps and other navigational services. You will use these algorithms if you choose to work on our Fast Shortest Routes industrial capstone project. We will finish with minimum spanning trees which are used to plan road, telephone and computer networks and also find applications in clustering and approximate algorithms.

Курс4

Курс 4

Строковые алгоритмы

4.5

звезд

Оценки: 969

•

Рецензии: 168

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.

НИУ ВШЭ

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

Партнеры курса

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

Получу ли я зачеты в университете за прохождение специализации?
Эта специализация не приравнивается к зачету в университетах, однако некоторые вузы принимают сертификаты на свое усмотрение. Дополнительную информацию уточняйте в своем деканате. Онлайн-дипломы и сертификаты Mastertrack™ от Coursera позволяют получить зачеты.
Can I just enroll in a single course?
Когда вы оформите подписку, начнется семидневный бесплатный пробный период, в течение которого подписку можно отменить без штрафа. По истечении этого срока вы не сможете вернуть средства, но сможете отменить подписку в любой момент. Ознакомьтесь с нашей политикой возврата средств.
Можно ли зарегистрироваться только на один курс?
Да! Чтобы начать, нажмите карточку интересующего вас курса и зарегистрируйтесь. Зарегистрировавшись, вы можете пройти курс и получить сертификат, ссылкой на который можно делиться с другими людьми. Просто ознакомиться с содержанием курса можно бесплатно. При подписке на курс, входящий в специализацию, вы автоматически подписываетесь на всю специализацию. Ход учебы можно отслеживать в панели управления учащегося.
Можно ли получить финансовую помощь?
Да, Coursera предоставляет финансовую помощь учащимся, которые не могут оплатить обучение. Чтобы подать заявление, перейдите по ссылке "Финансовая помощь" слева под кнопкой "Зарегистрироваться". Заполните форму заявления. Если его примут, вы получите уведомление. Обратите внимание: этот шаг необходимо выполнить для каждого курса специализации, в том числе для дипломного проекта. Подробнее
Могу ли я пройти курс бесплатно?
Когда вы регистрируетесь на курс, то можете получить доступ ко всем курсам в специализации. Кроме того, вы получаете сертификат о прохождении курса.Просто ознакомиться с содержанием курса можно бесплатно. Если стоимость обучения для вас слишком велика, вы можете подать заявку на финансовую помощь.
Действительно ли это полностью дистанционный курс? Нужно ли мне посещать какие-либо занятия лично?
Это полностью дистанционный курс, потому вам не нужно ничего посещать. Все лекции, материалы для самостоятельного изучения и задания доступны всегда и везде по Интернету и с мобильных устройств.
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.

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