This online course will help you to join the world of competitive programming and even become worldwide competitions participant! The course includes theoretical and practical aspects that are necessary to solve problems of any difficulties.
5,147 already enrolled
Offered By
Competitive Programming for Beginners
Moscow Institute of Physics and TechnologyAbout this Course
5,710 recent views
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own 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
Subtitles: English
What you will learn
Basic Algorithms
Number and Graph Theories
Dynamic Programming
Skills you will gain
- Algorithms
- Competitive Programming
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own 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
Subtitles: English
Offered by
Moscow Institute of Physics and Technology
Московский физико-технический институт (Физтех) является одним из ведущих вузов страны и входит в основные рейтинги лучших университетов мира. Институт обладает не только богатой историей – основателями и профессорами института были Нобелевские лауреаты Пётр Капица, Лев Ландау и Николай Семенов – но и большой научно-исследовательской базой.
Syllabus - What you will learn from this course
38 hours to complete
Basic Algorithms
In this first module of our course we will: talk about how to measure efficiency of the developed algorithm; learn what is asymptotics; learn how to implement some simplest algorithms.
38 hours to complete
7 videos (Total 54 min)
33 hours to complete
Number Theory
In this module of our course we will: talk about integer data types in existing programming languages, limitations of these types and ways to pass those limitations in competitive programming tasks; look at some applications of the modulo calculations related to the calculation of the greatest common divisor; learn what the regular and extended Euclid's algorithm is and how they are used in math (to prove important theorems) and in programming.
33 hours to complete
4 videos (Total 52 min)
42 hours to complete
Dynamic Programming
In this module we will talk about the dynamic programming. You surely have been faced with it when you implemented prefix sums or the sieve of Erathosphenes. Also it turns out to be a part of a large number of algorithms, so it’s extremely important to learn the topic in small details.
42 hours to complete
9 videos (Total 69 min)
40 hours to complete
Graph Theory
In this closing part of our course we shall get acquainted with the basic definitions and algorithms of graph theory in regard to competitive programming in general
40 hours to complete
8 videos (Total 53 min)
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I purchase the Certificate?
Is financial aid available?
More questions? Visit the Learner Help Center.
