19/12/2019
0
Views
Express preparation course for the Unified State Exam in computer science for grade 11 - free course from Foxford, training 28 subject lessons and 7 workshops, Date: December 5, 2023.
Miscellaneous / / December 08, 2023
All tasks from KIM-2022
You will work through different options for each of the 27 problems and gain an understanding of programming.
Preparation six months in advance
You will study 2 times a week for 2 academic hours and go through everything you need before the exam.
FIPI codifier topics
You will review all the theory that is needed to pass computer science.
Learn from a teacher you can trust to teach you
Timofey Khiryanov
Unified State Exam expert in computer science
Senior Lecturer, Department of Informatics and Computational Mathematics, MIPT
Associate Member of the Free Software Foundation
Worked as a programmer at Parallels, Samsung Electronics
Review all Unified State Exam topics in computer science
The main goal of the teachers is for you to understand the subject itself, to see its structure and logic. Then in the exam you will cope with the task even in an unusual wording that was not found in the trial versions.
Manage your time and don’t worry about running out of time
From February to May you will get acquainted with all types of tasks, learn about this year's changes and design details. The teacher will pay special attention to programming problems - you will understand how to solve them, even if you have never done it before.
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
Class lasts 2 academic hours. Classes are held online twice a week on Tuesdays and Thursdays at 16.00 (Moscow time).
Workshop lasts 2 academic hours. The workshop takes place online once every two weeks on Wednesdays at 18.00 (Moscow time).
Introduction to Python Programming
What is an algorithm? Basic programming with turtle executor
- Programming with an executor in Python
Information and information processes
Combinatorics problems. Units of information. Sound and raster information. Tasks on the speed of information transfer. Uniform coding. Hartley's formula. Fano condition. Number of permutations, placements and combinations
- Combinatorics
- Measure of information
- Uniform and uneven encoding
Simulation and computer experiment
Spreadsheet LibreOffice.org Calc. Formulas for statistical processing of information. Logical operators in a table processor. Relational databases. Text editor. Two-dimensional dynamic programming (USE-18) with a table processor
- Graph Theory
- Table processor
- Database
- Text processing
- 2D dynamic programming
Number systems
Positional number systems. Expanded form of the number and Horner's scheme. Arithmetic operations. Analysis of the algorithm in natural language. Quick translation from k-th to k^n-th. Complex problems on number systems. Complementary binary code
- Number systems
Logic and algorithms
Set theory. Euler-Venn diagrams. Type set(). Operations with sets. Algebra of logic. Operations AND, OR, NOT. Truth tables. Bit conjunction. Logical functions and truth tables. Laws of algebra logic
- Set theory
- Algebra of logic
Elements of the theory of algorithms and programming
Recursion in Python. Game theory. Address functions: INDEX, ROW, COLUMN. Non-standard use of a table processor. Imperative programming. Arithmetic and geometric progression. A task to analyze the operation of a program. Cascading Conditional Instructions
- Recursion
- Game theory
- Imperative programming
- Program branches
- Divisibility in algorithms
- Working with strings
Composing complex programs
Dynamic programming from above and below. Problems about recursion with solutions without Python. Lists in Python. Cyclic shifts. The problem of finding numbers with a given number of divisors. A task for processing character strings from a file. Checking if an array is sorted
- Dynamic programming
- Lists in Python
- Processing lines from a file
- Asymptotics of algorithms
- Efficient algorithms
Repetition
Repeating the course. Let's remember the main topics
- Repetition
Subscribe
YOU MIGHT ALSO LIKE
