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
86,340 уже зарегистрированы!
Чему вы научитесь
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.
Приобретаемые навыки
Специализация: общие сведения
Недавно просмотрено: 147,226
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.
Сертификат, ссылками на который можно делиться с другими людьми
Получите сертификат по завершении
Только онлайн-курсы
Начните сейчас и учитесь по собственному графику.
Гибкий график
Установите гибкие сроки сдачи заданий.
Промежуточный уровень
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.
Прибл. 6 месяца на выполнение
Около 8 ч/неделю
Английский
Субтитры: Английский, Испанский
О специализации
Пройти курсы
Специализация Coursera — это серия курсов, помогающих в совершенстве овладеть определенным навыком. Можно сразу записаться на специализацию или просмотреть курсы, из которых она состоит и выбрать тот, с которого вы хотите начать. Подписываясь на курс, который входит в специализацию, вы автоматически подписываетесь на всю специализацию. Можно завершить всего один курс, а потом сделать паузу в обучении или в любой момент отменить подписку. Отслеживайте свои курсы и прогресс на панели управления учащегося.
Практический проект
В каждой специализации есть практический проект, который нужно успешно выполнить, чтобы завершить специализацию и получить сертификат. Если для практического проекта в специализации предусмотрен отдельный курс, прежде чем начать его, необходимо завершить все остальные курсы.
Получите сертификат
Когда вы пройдете все курсы и завершите практический проект, вы получите сертификат, которым можно поделиться с потенциальными работодателями и коллегами.
Специализация включает несколько курсов: 6
Algorithmic Toolbox
Оценки: 6,002
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,546
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,350
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.
Строковые алгоритмы
Оценки: 688
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 (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
Рецензии
Лучшие отзывы о курсе СТРУКТУРЫ И АЛГОРИТМЫ ДАННЫХ
от партнера SDAug 3, 2017
I really enjoy this course, and I can definitely say that this specialization is perfect for those who would like to learn programming from the base and use it in different languages
от партнера KTDec 1, 2018
The course is fundamentally useful, this helped me out a lot to discover my enthusiasm since my background is non-IT. I'm on the way to the second course in this specialization!
от партнера RVMay 6, 2018
The only thing I missed in this course (and specialization) was more visual, intuitive approach to explanation. Programming assignments are rewarding.
от партнера ASJun 14, 2018
Another great course in this specialization with challenging and interesting assignments. However, this one is somewhat harder but rewarding.
от партнера SSDec 6, 2016
This course is the basic of specialization and helped a lot to understand algorithms in a better way. Thanks so much to are the teachers
от партнера YZJul 22, 2019
Great course, and part of a great specialization. Lesson are well constructed, and the assignments reflect the lectures very well.
от партнера ASAug 4, 2018
I would like to say thank you to all who have created this course and specialization! Good material, excellent lecturers!
от партнера YCMay 14, 2019
This is a very challenging course in the specialization. I learned a lot form going through the programming assignments!
Часто задаваемые вопросы
Какие правила возврата средств?
Можно ли зарегистрироваться только на один курс?
Да! Чтобы начать, нажмите карточку интересующего вас курса и зарегистрируйтесь. Зарегистрировавшись, вы можете пройти курс и получить сертификат, ссылкой на который можно делиться с другими людьми. Просто ознакомиться с содержанием курса можно бесплатно. При подписке на курс, входящий в специализацию, вы автоматически подписываетесь на всю специализацию. Ход учебы можно отслеживать в панели управления учащегося.
Можно ли получить финансовую помощь?
Могу ли я пройти курс бесплатно?
Действительно ли это полностью дистанционный курс? Нужно ли мне посещать какие-либо занятия лично?
Это полностью дистанционный курс, потому вам не нужно ничего посещать. Все лекции, материалы для самостоятельного изучения и задания доступны всегда и везде по Интернету и с мобильных устройств.
What will I be able to do upon completing the Specialization?
You will be able to apply the right algorithms and data structures in your day-to-day work and write programs that work in some cases many orders of magnitude faster. You'll be able to solve algorithmic problems like those used in the technical interviews at Google, Facebook, Microsoft, Yandex, etc. If you do data science, you'll be able to significantly increase the speed of some of your experiments. You'll also have a completed Capstone either in Bioinformatics or in the Shortest Paths in Road Networks and Social Networks that you can demonstrate to potential employers.
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!
Сколько времени занимает получение специализации?
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.
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.
Получу ли я зачеты в университете за прохождение специализации?
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.
Do I need to buy a textbook for this specialization?
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.
Остались вопросы? Посетите Центр поддержки учащихся.