The total number of participants in the main period of the exam in the current year is more than 67 thousand people.This number has grown significantly compared to 2017, when 52.8 thousand people took the exam, and compared to 2016 (49.3 thousand people). ), which corresponds to the trend for the development of the digital sector of the economy in the country.

In 2018, compared to 2017, the share of unprepared exam participants increased slightly (by 1.54%) (up to 40 test points). The share of participants with a basic level of training (range from 40 to 60 tb) decreased by 2.9%. The group of exam participants who scored 61-80 TB increased by 3.71%, partly due to a 2.57% decrease in the share of the group of participants who scored 81-100 TB. Thus, the total share of participants who received significant admissions to institutions higher education points (61-100 TB), increased by 1.05%, despite a decrease in the average test score from 59.2 in 2017 to 58.4 this year. The slight increase in the proportion of participants who scored high (81-100) test scores is partly explained by the improvement in the preparation of the exam participants, partly by the stability examination model

More detailed analytical and methodological materials The Unified State Exam 2018 is available here.

Our website contains about 3000 tasks for preparing for the Unified State Exam in Informatics in 2018. The general plan of the examination work is presented below.

THE EXAMINATION PLAN OF THE USE IN INFORMATICS 2019

Designation of the level of difficulty of the task: B - basic, P - increased, C - high.

Correspondence between the minimum primary scores and the minimum test scores of 2019. Order on amendments to Appendix No. 1 to the order Federal Service on supervision in the field of education and science. ...

OFFICIAL SCALE 2019

THRESHOLD SCORE
The order of Rosobrnadzor established the minimum number of points, confirming the mastering by the participants of examinations of the basic general educational programs of secondary (complete) general education in accordance with the requirements of the federal state educational standard of secondary (complete) general education. INFORMATICS AND ICT THRESHOLD: 6 primary points (40 test points).

EXAMINATION FORM
You can download high quality forms by

FROM modern world technologies and realities of programming, development Unified State Exam in Informatics has little in common. There are some basic points, but even if you understand a little about tasks, this does not mean that you will eventually become a good developer. But there are a great many areas where IT specialists are needed. You won't go wrong if you want to have a stable income above average. In IT, you get it. Provided, of course, the presence of the appropriate abilities. And you can develop and grow here as much as you like, because the market is so huge that you can't even imagine! Moreover, it is not limited only to our state. Work for any company from anywhere in the world! This is all very inspiring, so let the preparation for the exam in computer science be the first minor step, followed by years of self-development and improvement in this area.

Structure

Part 1 contains 23 tasks with a short answer. This part contains tasks with a short answer, implying an independent formulation of a sequence of symbols. The assignments check the material of all thematic blocks. 12 tasks refer to the basic level, 10 tasks to the increased difficulty level, 1 task to the high difficulty level.

Part 2 contains 4 tasks, the first of which increased level difficulty, the other 3 tasks high level difficulties. The tasks of this part involve writing a detailed answer in any form.

The examination work takes 3 hours 55 minutes (235 minutes). It is recommended to take 1.5 hours (90 minutes) to complete the tasks of Part 1. The rest of the time is recommended to be devoted to the tasks of Part 2.

Assignment Grading Explanations

The completion of each task of part 1 is estimated at 1 point. The task of part 1 is considered completed if the examinee gave an answer corresponding to the code of the correct answer. The performance of the tasks of part 2 is estimated from 0 to 4 points. The answers to the tasks in part 2 are checked and evaluated by experts. The maximum number of points that can be obtained for completing the tasks of part 2 is 12.

Option No. 3490088

When completing tasks with a short answer, write in the answer field a 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.

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:

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.

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:

character "?" () 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.

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

Car number consists of several letters (the number of letters is the same in all numbers), followed by 4 numbers. 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):

UNTIL<условие>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 maze meet the requirement that, having started in it and running the program below, the MACHINE will not crash?

UNTIL<снизу свободно>down

UNTIL<слева свободно>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 move only 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.

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 on the screen. If the program doesn't output 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.)

Two players, Petya and Vanya, play the following game. There is a pile of stones in front of the players. The players take turns, Petya makes the first move. In one move, the player can add one or three stones to the pile, or double the number of stones in the pile. For example, having a bunch of 15 stones, in one move you can get a bunch of 16, 18 or 30 stones. Each player has an unlimited number of stones to make moves. The game ends at the moment when the number of stones in the pile becomes at least 35. The player who made the last move is considered the winner, i.e. the first to receive a pile containing 35 or more stones. At the initial moment, there were S stones in the heap; 1 ≤ S ≤ 34. We say that a player has a winning strategy if he can win for any opponent's moves. To describe the player's strategy means to describe what move he should make in any situation that he may encounter during different game enemy.

Complete the following tasks. In all cases, justify your answer.

Exercise 1

a) Indicate all such values ​​of the number S, at which Petya can win in one move. Justify that all the required values ​​of S have been found, and indicate the winning moves.

b) Indicate the value of S at which Petya cannot win in one move, but for any move Petya Vanya can win with his first move. Describe Vanya's winning strategy.

Assignment 2

Indicate two such values ​​of S for which Petya has a winning strategy, and two conditions are simultaneously fulfilled:

- Petya cannot win in one move;

- can win with his second move regardless of how Vanya moves.

For each specified value of S, describe Petit's winning strategy.

Assignment 3

Specify the S value at which two conditions are met simultaneously:

- Vanya has a winning strategy that allows him to win with the first or second move in any Petya game;

The District Methodist decided that 20% of the participants (whole number, with the decimal part removed) should receive an “excellent” mark.

To do this, she must determine what grade the student had to score in order to get "excellent".

If it is impossible to determine such a score that exactly 20% of the participants would get “excellent”, then fewer participants than 20% should get “excellent”.

If there are no such participants (more than 20% of the participants scored the highest score), these and only these students should receive "excellent".

Write a program that is efficient, including in terms of memory usage (specify the version of the programming language used, for example Borland Pascal 7.0), which should display the lowest score that the participants who received "excellent" scored. It is known that more than 5 students took computer science. It is also known that there is such a number of points that no participant has received.

At the entrance to the program, the number of students who passed the exam is first submitted. Each of the following N lines contains information about students in the format:

where is a string of no more than 30 characters without spaces,

A string of no more than 20 characters without spaces,

An integer in the range from 1 to 99,

An integer in the range from 1 to 100. This data is written separated by a space, with exactly one space between each pair (that is, only three spaces in each line).

An example of an input string:

Ivanov Ivan 50 87

Sample output:

Solutions for items with a detailed answer are not automatically checked.
On the next page, you will be asked to test them yourself.

Finish testing, check answers, see solutions.

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 anxiety about the lack of time. 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 - this is easier to do with the help of a tutor. If you have a high level of knowledge, you can do it yourself.
• Decide 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 the knowledge problems.

This exam lasts 4 hours. Maximum amount scored points - 35. Percentage almost equal between the levels of questions. Most of the questions are test questions, in the exam only 4 tasks are assigned to a detailed answer.

Computer Science Exam is quite difficult and requires special attention and proper preparation of students. It includes general test questions that are designed for low-level knowledge. There are also tasks that require reflection and calculations with the implementation of accurate calculations.

Distribution of tasks by parts of the exam work of the 2019 USE in informatics, indicating the primary points below in the infographics.

The maximum number of points is 35 (100%)

Total exam time - 235 minutes

66%

Part 1

23 tasks 1-23
(With a short answer)

34%

Part 2

4 tasks 1-4
(Detailed response)

Changes in the KIM USE in 2019 compared to 2018

1. There are no changes in the CMM structure. In task 25, the ability to write an algorithm in natural language was removed due to the lack of demand for this opportunity by the exam participants.
2. Examples of program texts and their fragments in the conditions of tasks 8, 11, 19, 20, 21, 24, 25 in the C language have been replaced with examples in the C ++ language, which is much more relevant and widespread.

Systematic preparation is the key to success

The educational portal site offers many demo tests in computer science, which can be solved without leaving the workplace.

Trial assignments will help you to plunge into the atmosphere of testing and find those gaps in knowledge that need to be corrected to achieve maximum results.