Algorithmic Design and Techniques

Обучение бесплатное
Сертификация платная
1 час курса
О курсе

In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn basic algorithmic techniques and ideas for computational problems, which arise in practical applications such as sorting and searching, divide and conquer, greedy algorithms and dynamic programming.

This course will cover theories, including:

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

Algorithmic Design and Techniques
Learn how to design algorithms, solve computational problems and implement solutions efficiently.
Что Вы изучите?
  • Essential algorithmic techniques - greedy algorithms, divide and conquer, binary search, sorting, dynamic programming
  • Best practices of implementing algorithms efficiently
  • Ways of testing and debugging programs
Pavel Pevzner
Pavel Pevzner
Ronald R. Taylor Professor of Computer Science The University of California, San Diego
Pavel Pevzner is Ronald R. Taylor Professor of Computer Science at the University of California, San Diego. He holds a Ph.D. from Moscow Institute of Physics and Technology, Russia. He is a Howard Hughes Medical Institute Professor (2006-present), an Association for Computing Machinery Fellow (2010), and an International Society for Computational Biology Fellow (2012). In addition to Bioinformatics Algorithms: An Active Learning Approach, he has authored the textbooks Computational Molecular Biology: An Algorithmic Approach (2000) and An Introduction to Bioinformatics Algorithms (2004) (jointly with Neil Jones).
Daniel Kane
Daniel Kane
Assistant Professor, Computer Science and Engineering & Dept. of Mathematics UC San Diego
Daniel is an assistant professor at UCSD with a joint appointment between the Department of Computer Science and Engineering and the Department of Mathematics. He holds B.S. from MIT and Ph.D. from Harvard.
Alexander S. Kulikov
Alexander S. Kulikov
Visiting Professor UC San Diego
Alexander is a research fellow at Steklov Mathematical Institute at St. Petersburg, Russia and a visiting professor at University of California, San Diego. He have been teaching algorithms classes for more than eight years.
Michael Levin
Michael Levin
Chief Data Scientist Yandex.Market
Michael serves as chief data scientist at Yandex.Market (Yandex is the leading Internet company in Russia, and Yandex.Market is the leading service for price comparison online shopping in Russia). He has a degree in mathematics from Moscow State University. During his studies Michael was a silver and bronze medalist of ACM ICPC World Finals as a member of Moscow State University team.
Neil Rhodes
Neil Rhodes
Lecturer UC San Diego
Neil is Lecturer at University of California San Diego (UCSD), formerly Staff Software Engineer at Google.
Эта платформа предоставляет все курсы бесплатно. Авторами выступают топовые университеты и корпорации, которые стараются удерживать стандарты качества. За несоблюдение дедлайнов, невыполнение домашнего задания студенты теряют баллы. Как и в других платформах, лекционные видео чередуются с практическими заданиями. Обучение проводится на английском, китайском, испанском, французском и хинди.
Algorithmic Design and Techniques