Filipp Rukhovich +3 more instructors

Offered By

Moscow Institute of Physics and Technology

Competitive Programming for Beginners

Moscow Institute of Physics and Technology

About this Course

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.
After this course, you will learn what types of problems you will have to solve at the competitions, what is the effective program, how to estimate the algorithms efficiency, how to use basic algorithms and ideas during the problems solution. You will also learn how to submit your solution to the testing system.

There are four modules in the course — each for one week of education.

Program Modules:
Module 1: Basic Algorithms
Module 2: Number Theory
Module 3: Dynamic Programming
Module 4: Graph Theory

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

Subtitles: 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

Subtitles: English

Instructors

Offered by

Moscow Institute of Physics and Technology

Московский физико-технический институт (Физтех) является одним из ведущих вузов страны и входит в основные рейтинги лучших университетов мира. Институт обладает не только богатой историей – основателями и профессорами института были Нобелевские лауреаты Пётр Капица, Лев Ландау и Николай Семенов – но и большой научно-исследовательской базой.

Основой образования в МФТИ является уникальная «система Физтеха», сформулированная Петром Капицей: кропотливый отбор одаренных и склонных к творческой работе абитуриентов; участие в обучении ведущих научных работников; индивидуальный подход к отдельным студентам с целью развития их творческих задатков; воспитание с первых шагов в атмосфере технических исследований и конструктивного творчества с использованием потенциала лучших лабораторий страны. Среди выпускников МФТИ — нобелевские лауреаты Андрей Гейм и Константин Новоселов, основатель компании ABBYY Давид Ян, один из авторов архитектурных принципов построения вычислительных комплексов Борис Бабаян и др.

Syllabus - What you will learn from this course

Week

Week 1

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)

7 videos

Asymptotics14m

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

Week 2

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)

4 videos

Integer data types structure. Sieve of Eratosthenes11m

Modulo calculations: basic operations13m

Basic and Extended Euclidean Algorithm14m

Fast exponentiation, multiplicative inverse12m

Week

Week 3

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)

9 videos

Dynamic programming: introduction9m

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

Week 4

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)

8 videos

Basic definitions9m

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

When will I have access to the lectures and assignments?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
What will I get if I purchase the Certificate?
When you purchase a Certificate you get access to all course materials, including graded assignments. Upon completing the course, your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
Is financial aid available?
Yes, Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You’ll be prompted to complete an application and will be notified if you are approved. Learn more.
Will I earn university credit for completing the Course?
This Course doesn't carry university credit, but some universities may choose to accept Course Certificates for credit. Check with your institution to learn more. Online Degrees and Mastertrack™ Certificates on Coursera provide the opportunity to earn university credit.

More questions? Visit the Learner Help Center.

Competitive Programming for Beginners

Competitive Programming for Beginners