About this Course

Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Beginner Level

You should know the basics of at least one of the following programming languages: C/C++, Java, Pascal/Delphi, Python.

Approx. 153 hours to complete
English

What you will learn

  • Basic Algorithms

  • Number and Graph Theories

  • Dynamic Programming

Skills you will gain

AlgorithmsCompetitive Programming
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Beginner Level

You should know the basics of at least one of the following programming languages: C/C++, Java, Pascal/Delphi, Python.

Approx. 153 hours to complete
English

Offered by

Placeholder

Moscow Institute of Physics and Technology

Syllabus - What you will learn from this course

Week
1

Week 1

38 hours to complete

Basic Algorithms

38 hours to complete
7 videos (Total 54 min)
7 videos
Linear Algorithms10m
Linear Algorithms: sums on subsegment6m
Binary Search8m
Binary Search: search of an element in an array4m
Binary Search in real numbers5m
Binary Search over answer4m
Week
2

Week 2

33 hours to complete

Number Theory

33 hours to complete
4 videos (Total 52 min)
4 videos
Modulo calculations: basic operations13m
Basic and Extended Euclidean Algorithm14m
Fast exponentiation, multiplicative inverse12m
Week
3

Week 3

42 hours to complete

Dynamic Programming

42 hours to complete
9 videos (Total 69 min)
9 videos
Linear dynamic programming. The hopper problem6m
The hopper problem: advanced version10m
Two-dimensional dynamic programming. The tortoise problem7m
The tortoise problem — an alternative base6m
Recovery of answer5m
Recovery of answer: storing the parents4m
The knapsack problem8m
The knapsack problem: an alternative version9m
Week
4

Week 4

40 hours to complete

Graph Theory

40 hours to complete
8 videos (Total 53 min)
8 videos
Ways of graph storage7m
Depth first search6m
DFS: edges classification5m
Search for a cycle7m
Topological sorting6m
Breadth first search3m
BFS: shortest distances5m

Frequently Asked Questions

More questions? Visit the Learner Help Center.