# Algorithm Design and Analysis

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

How do you optimally encode a text file? How do you find shortest paths in a map? How do you design a communication network? How do you route data in a network? What are the limits of efficient computation?

This course, part of the Computer Science Essentials for Software Development Professional Certificate program, is an introduction to design and analysis of algorithms, and answers along the way these and many other interesting computational questions.

You will learn about algorithms that operate on common data structures, for instance sorting and searching; advanced design and analysis techniques such as dynamic programming and greedy algorithms; advanced graph algorithms such as minimum spanning trees and shortest paths; NP-completeness theory; and approximation algorithms.

After completing this course you will be able to design efficient and correct algorithms using sophisticated data structures for complex computational tasks.

Программа
Algorithm Design and Analysis
Learn about the core principles of computer science: algorithmic thinking and computational problem solving.
Algorithm Design and Analysis
Learn about the core principles of computer science: algorithmic thinking and computational problem solving.
Что Вы изучите?
• How to represent data in ways that allow you to access it efficiently in the ways you need to
• How to analyze the efficiency of algorithms
• How to bootstrap solutions on small inputs into algorithmic solutions on bigger inputs
• Solutions to several classic optimization problems
• How to critically analyze whether a locally optimal approach (greedy) can provide a globally optimal solution to a problem
Лекторы
Sampath Kannan
Henry Salvatori Professor and Department Chair, Computer and Information Science University of Penns...
Sampath is the Henry Salvatori Professor and Department Chair in the Department of Computer and Information Science at the University of Pennsylvania. Sampath's research spans several subfields in algorithms. In his work on massive data set algorithms, Sampath explores what can be computed efficiently, and what is not computable. He is also interested in program checking, a paradigm for ensuring the correctness of a program by observing its behavior at run-time, and in algorithmic problems in computational biology, particularly the problem of reconstructing the evolutionary history of a set of species from phenotypic and molecular sequence observations.
Платформа
Эта платформа предоставляет все курсы бесплатно. Авторами выступают топовые университеты и корпорации, которые стараются удерживать стандарты качества. За несоблюдение дедлайнов, невыполнение домашнего задания студенты теряют баллы. Как и в других платформах, лекционные видео чередуются с практическими заданиями. Обучение проводится на английском, китайском, испанском, французском и хинди.