The state final certification of 2019 in computer science for graduates of the 9th grade of educational institutions is carried out in order to assess the level of general education of graduates in this discipline. The main elements of content from the informatics section that are verified in testing:
- Ability to assess the quantitative parameters of information objects.
- Ability to determine the meaning of a logical expression.
- Ability to analyze formal descriptions of real objects and processes.
- Knowledge about the file system of data organization.
- Ability to represent the formula dependence in graphical form.
- Ability to execute an algorithm for a specific performer with a fixed set of commands.
- Ability to encode and decode information.
- Ability to execute a linear algorithm written in algorithmic language.
- Ability to execute the simplest cyclic algorithm written in algorithmic language.
- Ability to execute a cyclic algorithm for processing an array of numbers written in an algorithmic language.
- Ability to analyze information presented in the form of diagrams.
- Ability to search in a ready-made database for a formulated condition.
- Knowledge of the discrete form of representation of numerical, textual, graphic and sound information.
- Ability to write a simple linear algorithm for a formal performer.
- Ability to determine the speed of information transfer.
- Ability to execute a natural language algorithm that processes character strings or lists.
- Ability to use information and communication technologies.
- Ability to search for information on the Internet.
- Ability to process a large amount of data using a spreadsheet or database.
- Ability to write a short algorithm in the environment of a formal executor or in a programming language.
| Dates for passing the OGE in informatics 2019: June 4 (Tuesday), June 11 (Tuesday). |
There are no changes in the structure and content of the 2019 examination paper compared to 2018. |
The standard test of the OGE (GIA-9) of the 2019 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, in this test, only the first part (first 18 tasks) is presented. According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMM), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The standard test of the OGE (GIA-9) of the 2019 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, in this test, only the first part (first 18 tasks) is presented. According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMM), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The OGE standard test (GIA-9) of the 2018 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, this test presents only the first part (the first 18 tasks). According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMM), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The OGE standard test (GIA-9) of the 2018 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, this test presents only the first part (the first 18 tasks). According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMMs), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The OGE standard test (GIA-9) of the 2018 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, this test presents only the first part (the first 18 tasks). According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMMs), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The OGE standard test (GIA-9) of the 2018 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, this test presents only the first part (the first 18 tasks). According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMMs), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The OGE standard test (GIA-9) of the 2017 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, in this test, only the first part (first 18 tasks) is presented. According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMMs), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The OGE standard test (GIA-9) of the 2016 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, this test presents only the first part (the first 18 tasks). According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMMs), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The OGE standard test (GIA-9) of the 2016 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, this test presents only the first part (the first 18 tasks). According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMMs), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The OGE standard test (GIA-9) of the 2016 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, this test presents only the first part (the first 18 tasks). According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMMs), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The OGE standard test (GIA-9) of the 2016 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, this test presents only the first part (the first 18 tasks). According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMMs), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The standard test of the OGE (GIA-9) of the 2015 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, in this test, only the first part (first 18 tasks) is presented. According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMMs), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The standard test of the OGE (GIA-9) of the 2015 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, in this test, only the first part (first 18 tasks) is presented. According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMMs), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
The standard test of the OGE (GIA-9) of the 2015 format in computer science and ICT contains two parts. The first part contains 18 tasks with a short answer, the second part contains 2 tasks that must be performed on a computer. In this regard, in this test, only the first part (first 18 tasks) is presented. According to the current structure of the exam, among these 18 questions, answer options are offered only in the first 6 questions. However, for the convenience of passing the tests, the site administration decided to offer answer options for each task. However, for tasks in which the answer options are not provided by the compilers of real control and measuring materials (CMMs), we decided to significantly increase the number of these answer options in order to bring our test as close as possible to what you will have to face at the end of the school year.
When completing tasks 1-18, choose only one correct answer.
When completing tasks 1-8, choose only one correct answer.
Option No. 3490088
When completing tasks with a short answer, write in the answer field the number that corresponds to the number of the correct answer, or a number, word, sequence of letters (words) or numbers. The answer should be written without spaces or any additional characters. Separate the fractional part from the whole decimal point. You do not need to write the measurement units.
If the variant is set by the teacher, you can enter or upload answers to the tasks with a detailed answer into the system. The teacher will see the results of the assignments with a short answer and will be able to rate the uploaded answers to the assignments with a detailed answer. The points given by the teacher will appear in your statistics.
Version for printing and copying in MS Word
Specify the smallest four-digit hexadecimal number whose binary notation contains exactly 5 zeros. In the answer, write down only the hexadecimal number itself, you do not need to indicate the base of the number system.
Answer:
A fragment of the truth table of expression F is given:
| x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | F |
|---|---|---|---|---|---|---|---|---|
| 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 0 |
| 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 |
Which of the following expressions can be F?
1) (x2 → x1) ∧ ¬x3 ∧ x4 ∧ ¬x5 ∧ x6 ∧ ¬x7 ∧ x8
2) (x2 → x1) ∨ ¬x3 ∨ x4 ∨ ¬x5 ∨ x6 ∨ ¬x7 ∨ x8
3) ¬ (x2 → x1) ∨ x3 ∨ ¬x4 ∨ x5 ∨ ¬x6 ∨ x7 ∨ ¬x8
4) (x2 → x1) ∧ x3 ∧ ¬x4 ∧ x5 ∧ ¬x6 ∧ x7 ∧ ¬x8
Answer:
Roads have been built between settlements A, B, C, D, E, F, the length of which is shown in the table. The absence of a number in the table means that there is no direct road between the points.
| A | B | C | D | E | F | |
| A | 2 | 4 | 8 | 16 | ||
| B | 2 | 3 | ||||
| C | 4 | 3 | ||||
| D | 8 | 3 | 3 | 5 | 3 | |
| E | 5 | 5 | ||||
| F | 16 | 3 | 5 |
Determine the length shortest path between points A and F, passing through point E and not passing through point B. You can only travel on the indicated roads.
Answer:
File name masks are used for group operations with files. A mask is a sequence of letters, numbers and other characters allowed in file names, in which the following characters can also appear:
symbol "?" () question mark means exactly one arbitrary character.
character "*" (asterisk) means any sequence of characters of arbitrary length, including "*" can specify an empty sequence.
There are 6 files in the directory:
Determine by what mask the specified group of files will be selected from the directory:
Answer:
A 5-bit code is used to transmit data over the communication channel. The message contains only letters A, B and C, which are encoded with the following code words:
A - 11111, B - 00011, C - 00100.
Interference may occur during transmission. However, you can try to fix some errors. Any two of these three codewords differ from each other in at least three positions. Therefore, if during the transmission of a word an error occurred in no more than one position, then an educated guess can be made about which letter was transmitted. (They say that “the code corrects one error.”) For example, if the codeword 10111 is received, it is considered that the letter A. the word differs from the code words for the letters A, B, C in more than one position, then it is considered that an error has occurred (it is denoted by "x").
Answer:
The machine receives a four-digit number as input (the number cannot start from zero). Based on this number, a new number is constructed according to the following rules.
1. The first and second, second and third, third and fourth digits of a given number are added separately.
2. The smallest of the three received amounts is deleted.
3. The remaining two amounts are written one after another in non-decreasing order without separators.
Example. Original number: 1984. Sums: 1 + 9 = 10, 9 + 8 = 17, 8 + 4 = 12.
Deletes 10. The result is: 1217.
Please indicate the fewest number, upon processing of which the machine returns the result 613.
Answer:
A fragment of a spreadsheet is given.
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 1 | 10 | 100 | 1000 | ||
| 3 | 2 | 20 | 200 | 2000 | ||
| 4 | 3 | 30 | 300 | 3000 | ||
| 5 | 4 | 40 | 400 | 4000 | ||
| 6 | 5 | 50 | 500 | 5000 |
In cell B2 we wrote down the formula = D $ 4 + $ F3. After that, cell B2 was copied to cell A3. What number will be shown in cell A3?
Note: The $ sign is used to indicate absolute addressing.
Answer:
Write down the number that will be printed as a result of the next program. For your convenience, the program is presented in five programming languages.
Answer:
A four-channel (quad) sound recording is made with a sampling frequency of 32 kHz and 32-bit resolution. Recording lasts 3 minutes, its results are written to a file, data is not compressed. Determine the approximate size of the resulting file (in MB). Enter the nearest integer multiple of five to the file size as your answer.
Answer:
A code lock cipher is a sequence of five characters, each of which is a digit from 1 to 5. How many different variants of the cipher can be set if it is known that the digit 1 occurs exactly three times, and each of the other valid digits can occur in the cipher any number once or not to meet at all?
Answer:
Below, a recursive algorithm is written in five programming languages F.
As your answer, specify the sequence of numbers that will be printed on the screen as a result of calling F (5).
Answer:
In the terminology of TCP / IP networks, a subnet mask is a 32-bit binary number that determines which bits of the computer's IP address are common to the entire subnet - in these bits the mask is 1. Usually, the masks are written in the form of a four decimal numbers- according to the same rules as for IP addresses. For some subnet, the mask is 255.255.248.0. How many different computer addresses does this mask allow?
Note. In practice, two addresses are not used to address computers: the network address and the broadcast address.
Answer:
The license plate consists of several letters (the number of letters is the same in all license plates) followed by 4 digits. In this case, 10 numbers and only 5 letters are used: P, O, M, A, N. You must have at least 1,000,000 different numbers. What is the smallest number of letters in a license plate?
Answer:
Artist CAR "lives" in a limited rectangular maze on the checkered plane shown in the figure. Gray cells are erected walls, light cells are free cells along which the CAR can move freely. Along the edge of the maze field, there is also an erected wall with printed numbers and letters to identify cells in the maze.
The system of commands of the executor MACHINE:
When any of these commands are executed, the MACHINE moves one cell, respectively (in relation to the observer): up, down ↓, left ←, right →.
Four commands check the truth of the condition that there is no wall on each side of the cell where the CAR is located (also in relation to the observer):
WHILE<условие>team
is executed as long as the condition is true, otherwise a transition to the next line occurs.
When you try to move to any gray cell, the CAR breaks against the wall.
How many cells of the given labyrinth meet the requirement that, having started in it and running the program below, the MACHINE will not crash?
WHILE<снизу свободно>way down
WHILE<слева свободно>to the left
Answer:
The figure shows a diagram of roads connecting cities A, B, C, D, D, E, K, L, M, N, P, R, T. On each road, you can only move in one direction, indicated by the arrow.
How many different routes are there from city A to city T?
Answer:
In radix N record number 87 10 ends in 2 and contains no more than two digits. List all matching values separated by commas in ascending order N.
Answer:
In the search engine query language, to denote logical operation"OR" symbol "|" is used, and for logical operation "AND" - symbol "&".
The table shows the requests and the number of pages found on them for a certain segment of the Internet.
| Request | Pages found (in thousands) |
|---|---|
| France & Germany | 274 |
| Germany & (France | Austria) | 467 |
| France & Germany & Austria | 104 |
How many pages (in thousands) will be found by request Germany & Austria?
It is assumed that all queries were executed almost simultaneously, so that the set of pages containing all the search words did not change during the execution of the queries.
Answer:
We denote by m & n the bitwise conjunction of non-negative integers m and n.
So, for example, 14 & 5 = 1110 2 & 0101 2 = 0100 2 = 4.
For what is the smallest non-negative integer A the formula
x&51 = 0 ∨ (x&41 = 0 → x&BUT = 0)
is identically true (i.e., takes the value 1 for any non-negative integer value of the variable x)?
Answer:
Below is recorded on different languages programming a fragment of the same program. The program describes a one-dimensional integer array A; in the presented fragment, array elements with indices from 1 to 10 are processed.
Before the start of the program execution, these array elements had the values 0, 1, 2, 3, 4, 5, 4, 3, 2, 1 (that is, A = 0; A = 1;…; A = 1).
The value of which of these array elements will be the largest after the execution of the program fragment? In the answer, indicate the index of the element - a number from 1 to 10.
Answer:
Below, the algorithm is written in five languages. Given the number x as input, this algorithm prints two numbers: a and b. Specify the smallest of such numbers, x, when entered, the algorithm prints first 3 and then 12.
Answer:
Write in the answer highest value input variable k, in which the program produces the same response as the input value k= 20. For your convenience, the program is presented in five programming languages.
Answer:
Calculator has two commands:
1.add 4
2.Subtract 2.
The first of them increases the number on the screen by 4, the second decreases it by 2. If a negative number appears during the calculations, it breaks down and erases what is written on the screen. The Calculator program is a sequence of commands. How many different numbers can you get out of 8 with a program that contains exactly 16 instructions?
Answer:
How many different sets of values of logical variables x1, x2, x3, x4, x5, x6, x7, x8, x9, x10 exist that satisfy all of the following conditions:
((x1 → x2) → (x3 → x4)) ∧ ((x3 → x4) → (x5 → x6)) = 1;
((x5 → x6) → (x7 → x8)) ∧ ((x7 → x8) → (x9 → x10)) = 1;
x1∧x3∧x5∧x7∧x9 = 1.
The answer does not need to list all the different sets of values of the variables x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, for which the given system of equalities is satisfied. As an answer, you need to indicate the number of such sets.
Answer:
It was required to write a program that enters from the keyboard the coordinates of a point on the plane ( x, y - real numbers) and determines the belonging of a point to the shaded area. The programmer was in a hurry and wrote the program incorrectly.
Do the following in sequence:
1. Redraw and complete the table that shows how the program works with arguments belonging to different scopes (A, B, C, D, E, F, G, and H).
Points lying on the boundaries of areas should not be considered separately. In the columns of the conditions, specify "yes" if the condition is met, "no" if the condition is not met, "-" (dash) if the condition will not be checked, "not known" if the program behaves differently for different meanings belonging to this area. In the "Program will display" column, specify what the program will display. If the program doesn't print anything, write "-" (dash). If different texts will be displayed for different values belonging to the area, write "not from". In the last column, enter "yes" or "no".
2. Indicate how the program should be modified so that there are no cases of its incorrect operation. (This can be done in several ways; it is enough to indicate any way of modifying the original program.)
| Region | Condition 1 (y> = −x * x) | Condition 2 (y> = −x − 2) | Condition 3 | The program will output |
Which programming language to choose, what tasks to focus on and how to allocate time on the exam
Teaches computer science at Foxford
Different universities require different IT entrance exams. Somewhere you need to pass physics, somewhere - computer science. Which exam to prepare for is up to you, but it should be borne in mind that the competition for the specialty where you need to pass physics is usually lower than for the specialties where the exam in computer science is required, i.e. the likelihood of entering "through physics" is greater.
Why then take the Unified State Exam in Computer Science?
- It is faster and easier to prepare for it than for physics.
- You will be able to choose from more specialties.
- It will be easier for you to study in the chosen specialty.
What you need to know about the exam in computer science
The Unified State Exam in Informatics consists of two parts. In the first part there are 23 problems with a short answer, in the second - 4 problems with a detailed answer. The first part of the exam contains 12 basic level tasks, 10 tasks increased level and 1 task high level... In the second part - 1 task of an advanced level and 3 - a high one.
Solving problems from the first part allows you to score 23 primary points - one point for the completed task. Solving the problems of the second part adds 12 primary points (3, 2, 3 and 4 points for each problem, respectively). Thus, the maximum primary points that can be obtained for solving all tasks is 35.
Primary scores are converted into test scores, which are the result of the exam. 35 primary points = 100 test points for the exam. At the same time, more test points are awarded for solving problems from the second part of the exam than for answering the problems of the first part. Each primary score obtained in the second part of the exam will give you 3 or 4 test points, which in total is about 40 final points for the exam.
This means that when completing the Unified State Exam in Informatics, it is necessary to pay special attention to solving problems with a detailed answer: No. 24, 25, 26 and 27. Their successful completion will allow you to gain more final points. But the cost of an error during their implementation is higher - the loss of each primary point is fraught with the fact that you will not pass the competition, because 3-4 final points for the exam with high competition in IT specialties can become decisive.
How to Prepare for Part One Challenges
- Pay special attention to tasks number 9, 10, 11, 12, 15, 18, 20, 23. These tasks, according to the analysis of the results of the past years, are especially difficult. Difficulties with the solution of these problems are experienced not only by those whose overall score for the Unified State Exam in computer science turned out to be low, but also "good students" and "excellent students".
- Memorize the table of powers of number 2.
- Remember that Kbytes in tasks means Kibybytes, not Kilobytes. 1 kibyte = 1024 bytes. This will help to avoid computational errors.
- Study carefully options for the exam previous years. The computer science exam is one of the most stable, which means that you can safely use the USE options for the last 3-4 years for preparation.
- Get to know the different options for the wording of the tasks. Remember that minor wording changes will always result in poor exam scores.
- Read the problem statement carefully. Most of the errors in completing tasks are associated with a misunderstanding of the condition.
- Learn to independently check the completed tasks and find errors in the answers.
What you need to know about solving problems with a detailed answer
24 task - to find an error
25 task requires drawing up a simple program
Problem 26 - on game theory
27 task - it is necessary to program a complex program
The main difficulty in the exam is 27 problems. It can be solved only60-70% of those writing the exam in computer science. Its peculiarity lies in the fact that it is impossible to prepare for it in advance. Every year a fundamentally new problem is presented for the exam. When solving problem # 27, not a single semantic error should be allowed.
How to time your exam
Focus on the data that are given in the specification of control measuring materials for the exam in informatics. It indicates the approximate time allotted for completing the tasks of the first and second parts of the exam.
The exam in computer science lasts 235 minutes
Of these, 90 minutes are devoted to solving problems from the first part. On average, each task from the first part takes 3 to 5 minutes. It takes 10 minutes to solve problem 23.
There are 145 minutes left to solve the tasks of the second part of the exam, while solving the last problem # 27 will take at least 55 minutes. These calculations were carried out by specialists from the Federal Institute for Pedagogical Measurements and are based on the results of exams from previous years, so they should be taken seriously and used as a guide for the exam.
Programming languages - which one to choose
- BASIC. It is an outdated language, and although it is still taught in schools, there is no point in wasting time mastering it.
- School algorithmic programming language. It is designed specifically for early learning in programming, convenient for mastering initial algorithms, but practically does not contain depth, there is nowhere to develop in it.
- Pascal. It is still one of the most common programming languages for teaching in schools and universities, but its capabilities are severely limited. Pascal is quite suitable as a writing language for the exam.
- C ++. A universal language, one of the fastest programming languages. It is difficult to learn from it, but in practical application its possibilities are very wide.
- Python... It is easy to learn at an elementary level, the only thing that is required is knowledge of English language... At the same time, with an in-depth study of Python, it provides the programmer with no less opportunities than C ++. Having started learning "Python" at school, you will use it in the future, you do not have to relearn to another language in order to reach new horizons in programming. For passing the exam it is enough to know "Python" at a basic level.
Good to know
- Informatics works are evaluated by two experts. If the results of the experts' assessment differ by 1 point, the higher of the two points is given. If the discrepancy is 2 points or more, the work is rechecked by a third expert.
- A useful site for preparing for the exam in computer science -
The Unified State Exam in Informatics is not a mandatory test for all school graduates, but it is required for admission to a number of technical universities. This exam is rarely passed, since higher educational institutions where it is required, a little. A common case when entering a number of specialties in polytechnic universities is the opportunity to choose between physics and computer science. In such a situation, many choose the latter, since physics is justifiably considered a more complex discipline. Knowledge of computer science will be useful not only for admission, but also in the process of mastering a specialty in a higher educational institution.
The main feature of the school subject "Informatics" is a small volume, therefore, for high-quality preparation you need less time than for other subjects. It is possible to prepare from scratch! To compensate for the small amount of material, the authors of questions and tasks offer the subjects difficult tasks, tasks that provoke errors require high-quality knowledge of information and its competent use. The content of the exam contains a significant number of tasks that come close to the knowledge of mathematics and logic. A significant part is a block of tasks for algorithmization, tasks, programming. Check out
All tasks can be divided into 2 blocks - testing (tasks for knowledge of theory, a short answer is required), detailed tasks. It is recommended to spend about an hour and a half on the first part, more than two on the second. Take time to check for errors and fill out the answers on the form.
To learn how to easily overcome obstacles in the form of complex tasks, use the resource "Solve the Unified State Exam". This is a great opportunity to test yourself, consolidate your knowledge, analyze your own mistakes. Regular online testing will relieve anxiety and worry about time pressure. The tasks here are mostly more difficult than on the exam.
- It is recommended that you carefully familiarize yourself with the preparation program for the exam - this will make the repetition process systematic, and assimilate the theory in a structured way.
- Many preparation aids have been developed today - use them to practice and study the material.
- Learn to solve problems of different types - it is easier to do it with the help of a tutor. If you have a high level of knowledge, you can do it yourself.
- Solve for a time when you have mastered the necessary data and learned how to solve problems. Online testing will help with this.
- It is important not to miss out on training opportunities: courses, schooling, distance courses, tutoring, self-education. Draw a circle of problems that cause greatest number questions and difficulties.
- Practice solving problems - the more the better.
- Allocate time appropriately to work with assignments different levels difficulties.
- Find a professional tutor to help fill in your knowledge problems.
The unified state exam in computer science consists of 27 tasks. Each task is dedicated to one of the topics studied in the school curriculum. Computer science is a core subject, so only those students who will need it in the future take it. Here you can learn how to solve USE tasks in computer science, as well as study examples and solutions based on detailed tasks.
All USE tasks all tasks (107) USE task 1 (19) USE task 3 (2) USE task 4 (11) USE task 5 (10) USE task 6 (7) USE task 7 (3) USE task 9 (5) USE assignment 10 (7) USE assignment 11 (1) USE assignment 12 (3) USE assignment 13 (7) USE assignment 16 (19) USE assignment 17 (4) USE without number (9)
The performer Quadrator has two commands: add 3 and square
The performer Quadrator has two teams, which are assigned numbers: 1 - add 3; 2 - square. The first of them increases the number on the screen by 3, the second raises it to the second power. The performer works only with natural numbers. Make an algorithm for obtaining the number B from the number A, containing no more than K commands. In the response, write down only the command numbers. If there are more than one such algorithms, then write down any of them.
Vasya composes words in which only letters are found
Vasya composes N-letter words in which there are only letters A, B, C, and the letter A appears exactly 1 time. Each of the other valid letters can appear in a word any number of times or not at all. Any valid sequence of letters, not necessarily meaningful, is considered a word. How many words are there that Vasya can write?
Igor compiles a table of code words for message transmission
Igor compiles a table of code words for message transmission, each message has its own code word. As code words, Igor uses N-letter words, which contain only letters A, B, C, and the letter A appears exactly 1 time. Each of the other valid letters may appear in the codeword any number of times or not at all. How many different codewords can Igor use?
The task is included in the exam in informatics for grade 11 at number 10.
Algorithm for calculating the value of the function F (n)
Algorithm for calculating the value of the function F (n), where n - natural number, is given by the following relations. What is the value of the function F (K)? In the answer, write down only a natural number.
The task is included in the exam in informatics for grade 11 at number 11.
How many seconds will it take for a modem to transmit messages
How many seconds does it take for a modem transmitting messages at N bps to transmit a color bitmap image of A × B pixels, assuming that the color of each pixel is encoded in K bits? (Write only the number on the form.)
The task is included in the exam in informatics for grade 11 at number 9.
The decryptor needs to recover the damaged fragment of the message
The decryptor needs to recover the damaged 4-character message fragment. There is reliable information that no more than five letters (A, B, C, D, E) are used, and in the third place there is one of the symbols ... In the fourth place is one of the letters ... In the first place is one of the letters ... On the second - ... There is additional information that one of four options is possible. Which?
The task is included in the exam in informatics for grade 11 at number 6.
The meteorological station monitors air humidity
The meteorological station monitors air humidity. The result of one measurement is an integer from 0 to 100 percent, which is written using the fewest possible bits. The station made N measurements. Determine the information volume of the observation results.
What form will the formula take after the cell is copied
The cell contains a formula. How does the formula look after cell X is copied to cell Y? Note: The $ sign is used to indicate absolute addressing.
The task is included in the exam in informatics for grade 11 at number 7.
While in the root directory of the newly formatted disk
While in the root directory of the newly formatted disk, the student created K directories. Then, in each of the created directories, he created N more directories. How many directories were there on the disk, including the root one?
The task is included in the exam in informatics for grade 11.
Four pieces of paper were found at the crime scene
Four pieces of paper were found at the crime scene. The investigation established that fragments of one IP address were recorded on them. Forensic experts have marked these fragments with the letters A, B, C and D. Recover the IP address. In your reply, write the sequence of letters representing the fragments in the order corresponding to the IP address.
Petya wrote down the IP address of the school server on a piece of paper
Petya wrote down the IP address of the school server on a piece of paper and put it in his jacket pocket. Petya's mother accidentally washed her jacket along with the note. After washing, Petya found four scraps with fragments of an IP address in his pocket. These fragments are marked with letters A, B, C and D. Recover the IP address. In your answer, write the sequence of letters representing the fragments in the order corresponding to the IP address.
The task is included in the exam in informatics for grade 11 at number 12.
When registering in a computer system, each user is given a password
When registering in a computer system, each user is given a 15-character password containing numbers and capital letters. Thus, K different symbols are used. Each such password in a computer system is recorded with the minimum possible and the same integer number of bytes (in this case, character-by-character encoding is used and all characters are encoded with the same and minimum possible number of bits). Determine the amount of memory allocated by this system for recording N passwords.
The task is included in the exam in informatics for grade 11 at number 13.
In some countries, the license plate is capitalized
In some country car number of length K characters are made up of capital letters (M different letters are used) and any decimal digits. Letters with numbers can be in any order. Each such number in a computer program is recorded with the minimum possible and the same whole number of bytes (in this case, character-by-character coding is used and all characters are encoded with the same and minimum possible number of bits). Determine the amount of memory allocated by this program for recording N numbers.
The task is included in the exam in informatics for grade 11 at number 13.
