0
Views
Preparation for programming competitions for entry-level, grades 5-7 - free course from Foxford, training 30 lessons, Date: December 4, 2023.
Miscellaneous / / December 04, 2023
Who will benefit from the course?
The course is suitable for those who want to learn the Python programming language from scratch and participate in programming competitions.
What knowledge does the course provide?
During the classes, theoretical issues are discussed, solutions to programming problems and the basics of the Python language are discussed.
How is the course useful?
The course provides the basics of the Python language, introduces classic Olympiad stories, helps you start performing at Olympiads, and provides a basis for future in-depth study of Olympiad programming.
We manually check samples and homework.
We do not leave the written part assignments for self-testing - this is done by OGE experts.
We check “for real”, like in an exam, and as a result you receive detailed feedback. All this is for the sake of speed of preparation and your results. A personal curator will answer questions within two hours, 24/7.
The curators understand the program and the subject, so they can easily answer your questions about the course and homework - at any time.
They know well how difficult it can be to prepare and understand your worries.
The most important task of a tutor is to help you cope with stress and fear before exams.
The lesson lasts 2 academic hours.
Arithmetic problems, divisibility, combinatorics
- Introduction to the Python programming language. Installation, input/output
- What is a testing system?
- Integer division and remainder operations
- Arithmetic problems
- Division with rounding up. Miscellaneous tasks
- Date and time
- Divisibility problems
- Problems about numbers and numbers
- Combinatorial problems
Conditional statement and loops
- Conditional if-else statement
- Conditions on the chessboard
- For loop
- While loop
- Nested loops
- Bust
- Simulation
Strings
- Strings, string slices, string tasks
- Masks, different tasks per line
- Ciphers and cryptography
Lists, two-dimensional lists
- Lists, slices, tasks on lists
- Two-dimensional lists
- Various tasks
Functions and recursion
- Functions in Python
- Recursion in Python
- Classic recursive plots
- Wave algorithm
Search and sort
- Sorting
- The largest and the smallest. Greedy algorithm
- Linear search
- Two pointer method
Dynamic programming
- One-dimensional dynamic programming: number of ways
- One-Dimensional Dynamic Programming: The Best Way
- Restoring the answer in dynamic programming problems
- 2D dynamic programming
Subscribe
YOU MIGHT ALSO LIKE