Специализация Algorithms

Начинается мар 27

Специализация Algorithms

Learn To Think Like A Computer Scientist

Master the fundamentals of the design and analysis of algorithms.

Об этой специализации

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists. About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

Автор:

courses
4 courses

Следуйте предложенному порядку или выберите свой.

projects
Проекты

Поможет на практике применить полученные навыки.

certificates
Сертификаты

Отметьте новые навыки в резюме и на LinkedIn.

Обзор проектов

Курсы
Intermediate Specialization.
Some related experience required.
  1. 1-Й КУРС

    Divide and Conquer, Sorting and Searching, and Randomized Algorithms

    Предстоящая сессия: мар 27–май 1.
    Выполнение
    4 weeks of study, 4-8 hours/week
    Субтитры
    English

    О курсе

    The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
  2. 2-Й КУРС

    Graph Search, Shortest Paths, and Data Structures

    Предстоящая сессия: мар 27–май 1.
    Выполнение
    4 weeks of study, 4-8 hours/week
    Субтитры
    English

    О курсе

    The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
  3. 3-Й КУРС

    Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

    Предстоящая сессия: мар 27–май 1.
    Выполнение
    4 weeks of study, 4-8 hours/week
    Субтитры
    English

    О курсе

    The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
  4. 4-Й КУРС

    Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

    Предстоящая сессия: апр 3–май 8.
    Выполнение
    4 weeks of study, 4-8 hours/week
    Субтитры
    English

    О курсе

    The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).

Авторы

  • Стэнфордский университет

    Stanford University is one of the world's leading teaching and research universities. Since its opening in 1891, Stanford has been dedicated to finding solutions to big challenges and to preparing students for leadership in a complex world.

    The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.

  • Tim Roughgarden

    Tim Roughgarden

    Associate Professor

FAQs

More questions? Visit the Learner Help Center.