Preparation for the Unified State Exam in computer science in a group. Express course. — free course from Foxford, training 8 sections, Date: December 2, 2023.
Miscellaneous / / December 06, 2023
Who will benefit from the course?
For those who want to pass the Unified State Exam with 80+ points, understand the intricacies of the exam and learn how to solve tasks of all types.
How are classes conducted?
Lessons in real time with a webcam and microphone - and you can choose a convenient schedule.
What else will be on the course
Interactive, homework with automatic checking and tricks for passing the exam successfully.
Theory of algorithms and programming
This section will introduce you to the Python programming language. Let's look at how to create programs with the USE-6 performer and how to use strings in the USE-12 solution. Let's solve problems on processing a numerical sequence from Unified State Examination-17 files.
- What you need to know about the exam and how to prepare for it. Algorithms and executors
- Problem solving (task 6)
- Assignment operators
- Imperative programming. Analysis of programs with loops
- Working with strings
- Problem solving (task 12)
- Sequences of numbers. Working with files. Lists
- Problem solving (task 17)
Mathematics in computer science
The section will immerse you in the study of the mathematical component of the subject of computer science. Let's solve problems on analyzing algorithms for Unified State Examination-5 performers. Problems on number systems Unified State Examination-14, 8. We will also get acquainted with set theory and the basics of combinatorics.
- Repetition
- Positional number systems. Transfers from different number systems
- Problem solving (task 5)
- Set theory
- Arithmetic operations in number systems. Finding different bases in number systems
- Problem solving (task 14)
- Combinatorics
- Problem solving (task 8)
Dynamic programming on digraphs
This section is devoted to deepening into programming in Python. Let's get acquainted with the recursion of the Unified State Exam-16. Let's study the subnet mask of the Unified State Examination-13. Let's analyze dynamic programming in graphs, in programming, in tables of the Unified State Examination-18, 23.
- Repetition
- IP protocol, masks and subnets
- Recursion
- Problems about recursion
- Problems about recursion, lists (task 16)
- Problem solving (task 23)
- Dynamic programming in spreadsheets
- Problem solving (task 18)
Modeling and information processes
The section will tell you what oriented and undirected graphs are, Unified State Exam-1, Unified State Exam-13. Let's talk about the types of information processes and find out how USE-7 information is measured. Advantages and disadvantages of uniform and uneven coding Unified State Exam-4, Unified State Exam-11
- Repetition
- Graph theory. Adjacency matrices
- Problem solving (task 1)
- Measuring the volume of information. Transfer of information
- Problem solving (task 7)
- Uniform coding of information. Uneven coding of information
- Problem solving (task 4)
- Problem solving (task 11)
Texts, tables and databases
The section will teach you how to use spreadsheets to solve the problem of Unified State Exam-9, Unified State Exam-22. Let's learn how to present information in Unified State Exam-3 databases. Let's learn how to find information using text and spreadsheet processors Unified State Examination-10
- Repetition
- Search for words in a text document. Solving problems (task 10)
- Symbol processing. Solving Unified State Exam 24 problems
- Problem solving (task 24)
- Spreadsheets
- Problem solving (task 9)
- Relational databases. Solving Unified State Exam 3 problems
- Construction of mathematical models for solving practical problems. Solving Unified State Exam 22 problems
Logic and game theory
This section will teach you how to build and analyze truth tables for the Unified State Exam-2. Let's get acquainted with the laws of mathematical logic of Unified State Exam-15. Let's look at game theory and game strategies for Unified State Exam-19, Unified State Exam-20, Unified State Exam-21
- Repetition
- Algebra of logic and truth tables
- Problem solving (task 2)
- Laws of algebra logic. Converting Boolean Expressions
- Problem solving (task 15)
- Game theory and gaming strategies
- Problem solving (tasks 19-21)
- Problem solving (tasks 19-21)
Composing complex programs
The section is entirely devoted to programming. Let's learn how to write programs for processing integer information and work with Unified State Examination-25 lists. Let's study different sorting methods. Let's create programs for processing an array of integers from the Unified State Examination-26 file.
- Repetition
- Programming. Arrays
- Problem solving (task 25)
- Problem solving (task 25)
- Programming. Sorting
- Problem solving (task 26)
- Problem solving (task 26)
- Problem solving (task 27 A)
Processing of numerical information. Repetition
This section reveals the secrets of the most difficult Unified State Examination task in computer science. Let's learn how to build programs to process complex numerical sequences from a file. Let's talk about how to create effective algorithms for solving the Unified State Exam-27 and repeat all the Unified State Exam problems
- Repetition
- Programming. Number sequence problems. Ch1
- Solving problems (task 27). Ch1
- Programming. Number sequence problems. Ch2
- Solving problems (task 27). Ch2
- Solving problems (task 27). Ch3
- Repetition. Ch1
- Repetition. Ch2 Full sample solution