For high school graduates. It must be taken by those who plan to enter universities for the most promising specialties, such as information security, automation and control, nanotechnology, systems analysis and control, rocket systems and astronautics, nuclear physics and technology, and many others.

Check out general information about the exam and start preparing. There are practically no changes compared to last year in the new version of KIM USE 2019. The only thing is that fragments of programs written in the C language disappeared from the tasks: they were replaced with fragments written in the C++ language. And from task number 25, they removed the opportunity to write an algorithm in natural language as an answer.

USE score

Last year, in order to pass the Unified State Examination in Informatics, at least for the top three, it was enough to score 42 primary points. They were given, for example, for the correctly completed first 9 tasks of the test.

How it will be in 2019 is still not known for sure: you need to wait for an official order from Rosobrnadzor on the correspondence of primary and test scores. Most likely it will appear in December. Considering that the maximum primary score for the entire test remained the same, most likely will not change and minimum score. Let's take a look at these tables:

USE test structure

Informatics is the longest exam (the same is the duration of the exam in mathematics and literature), the duration is 4 hours.

In 2019, the test consists of two parts, including 27 tasks.

• Part 1: 23 tasks (1-23) with a short answer, which is a number, a sequence of letters or numbers.
• Part 2: 4 tasks (24–27) with a detailed answer, complete solution tasks are recorded on the answer sheet 2.

All tasks are connected in one way or another with a computer, but it is not allowed to use it to write a program in group C tasks during the exam. In addition, the tasks do not require complex mathematical calculations and the use of a calculator is also not allowed.

Preparation for the exam

• Pass the USE tests online for free without registration and SMS. The presented tests are identical in their complexity and structure to the real exams held in the corresponding years.

• Download demo versions of the Unified State Examination in Informatics, which will allow you to better prepare for the exam and make it easier to pass it. All proposed tests are designed and approved to prepare for USE Federal Institute of Pedagogical Measurements (FIPI). In the same FIPI, all official versions of the exam are being developed.
  The tasks that you will see, most likely, will not be found on the exam, but there will be tasks similar to the demo ones, on the same topic or simply with different numbers.

General USE numbers

Year	Min. USE score	Average score	Number of applicants	Did not pass, %	Qty 100 points	Duration- exam length, min.
2009	36
2010	41	62,74	62 652	7,2	90	240
2011	40	59,74	51 180	9,8	31	240
2012	40	60,3	61 453	11,1	315	240
2013	40	63,1	58 851	8,6	563	240
2014	40	57,1				235
2015	40	53,6				235
2016	40					235
2017	40					235
2018

The lesson is devoted to how to solve the 3rd task of the exam in computer science

The 3rd topic is characterized as tasks of a basic level of complexity, the execution time is approximately 3 minutes, maximum score — 1

* Some page images are taken from K. Polyakov's presentation materials

Structuring information and information models

Let us briefly consider the 3 USE assignments concepts.

Structuring information- this is the establishment of the main elements in information messages and the establishment of links between them.

Structuring is done with goal facilitate the perception and search for information.

Structuring is possible using the following structures (information models):

a bunch of:

enumeration of elements collected by characteristic;

Vasya, Petya, Kolya 1, 17, 22, 55

In a set, the ordering of elements is not necessary, i.e. the order is not important.

linear list

The order of the elements is important.

The tables highlight objects(separate table entries) and properties(column names or row names):

tree or hierarchy of objects

Consider family relationships in the tree:

"Sons" A: b, c.

"Parent" B: A.

"Descendants" A: B, C, D, E, F, G.

"Ancestors" F: A, C.

Root– node without ancestors (A).
Sheet– node without descendants (D, E, F, G).
Height- the greatest distance from the root to the leaf (number of levels).

file system (hierarchy)

Let's say the computer's hard drive has the following folders (directories) with files:

Let's get a tree:

graphs

Sometimes it is very difficult to structure information in the described structures because of the complex "relationships" between objects. Then you can use graphs:

is a set of vertices and connections between them, called edges:

Graph showing roads between villages

matrix and adjacency list

is a graph with a path between any vertices.

Tree is a connected graph without cycles (closed sections).

Tree is a connected graph without cycles

weighted graphs and weight matrix

Weighted graphs have an "edge weight":

From the weighted graphs, a weight matrix is ​​obtained, the inverse transformation is also possible.

Finding the shortest path (brute force)

Finding the shortest path between points A and D

• In the USE tasks of this topic, two information models are most often used - tables and diagrams.
• Information in the table is built according to the following rules: at the intersection of a row and a column, there is information characterizing the combination of this row and column.
• On the diagram information is built according to the following rule: if there is a connection between the objects of the scheme, then it is displayed by a line connecting the names of these objects on the diagram.

Solving tasks 3 USE in Informatics

3_3: Solution 3 of the USE task in informatics (control option No. 1 examination work 2018, S.S. Krylov, D.M. Ushakov):

Between settlements A, B, C, D, E, F roads were built, the length of which is given in the table (if the cell is empty, there is no road).

	A	B	C	D	E	F
A		7	3
B	7		2	4	1
C	3	2		7	5	9
D		4	7		2	3
E		1	5	2		7
F			9	3	7

Determine the length of the shortest path between points A And F .

✍ Solution:

Result: 11

Video analysis of the task:

3_4:Solution 3 of the USE task in informatics (variant 11 of the GVE in informatics 2018):

Roads were 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		3	7		6
B	3			4	4
C	7			5		9
D		4	5			5
E	6	4				8
F			9	5	8

Determine the length the shortest way between points A And F provided that it is possible to move only on the roads indicated in the table.

✍ Solution:

Result: 12

3_5: Solution 2* of the USE task in informatics 2018, option 10 (FIPI, " USE Informatics and ICT, typical exam options 2018", S.S. Krylov, T.E. Churkin):

Between settlements A, B, C, D, E, F, Z one-way roads were built. The table shows the length of each road (the absence of a number in the table means that there is no direct road between the points).

	A	B	C	D	E	F	Z
A		3		5			14
B			2				8
C		2					7
D					1	4	4
E						1	5
F			12		1		9
Z

How many such routes are there? A V Z, which go through five or more settlements? Items A And Z take into account when calculating. You cannot go through the same point twice.

* in the new textbooks, tasks 2 and 3 have been swapped: now 2 - Finding the shortest path, and 3 - Algebra of logic

✍ Solution:

Result: 6

3_2: 3 task. Demo version of the Unified State Examination 2018 Informatics (FIPI):

In the figure, the road map of the N-sky district is shown as a graph, the table contains information about the length of each of these roads (in kilometers).

Since the table and the diagram were drawn independently of each other, the numbering of settlements in the table is in no way connected with the letter designations on the graph. Determine the length of the road from the point A to paragraph G. In your answer, write down the whole number - as it is indicated in the table.

✍ Solution:

• Let's count how many edges each vertex has:

A -> 3 (C D E) B -> 1 (C) C -> 4 (A B D F) D -> 4 (A C D K) E -> 2 (A D) F -> 1 (C ) K -> 1 (G)

Three edges have only one vertex - A, so only A can match P3.

The vertex also has a unique value for the number of edges D, are two edges. Top table D will match P4.

Peaks G And IN have by 4 ribs. Consider a matrix, in which 4 numbers correspond to points P2 And P5.

With paragraph D only top crosses G(G -> 4 (A B D K)). In the weight matrix with vertex D stopped P5. Means top G corresponds P5.

IN P5 at the intersection with P3 is the number 6 .

Result: 6

Detailed solution of this 3 task from USE demos 2018 look at the video:

3_1: Unified State Examination in Informatics 2017, assignment from the collection of Ushakov D.M, 1st option:

In the figure, the road map of the N-sky district is shown as a graph, the table contains information about the lengths of these roads (in kilometers).

Since the table and the scheme were drawn independently of each other, the numbering of settlements in the table is in no way connected with the letter designations on the graph.
Determine the length of the road from the point D to paragraph TO. In your answer, write down the whole number - as it is indicated in the table.

✍ Solution:

• Consider a graph and count the number of edges from each vertex:

A -\u003e 2 ribs (D, C) C -\u003e 4 ribs (A, D, K, D) D -\u003e 4 ribs (A, C, K, E) B -\u003e 2 ribs (D, K) K - > 5 ribs (B, D, C, D, E) F -\u003e 2 ribs (K, D) D -> 3 ribs (B, K, E)

We selected vertices, with a unique number of edges: 3 edges corresponds to a vertex only D, and 5 edges correspond only to the vertex TO.

Consider the table and find those rows or columns in which there are 5 values ​​and 3 values: This P2 And P4.

We get P2 corresponds D, A P4 corresponds TO. At the intersection is a number 20 .

Result: 20

In addition, you can watch the video of the solution to this USE task in computer science:

3_6: Debriefing 3 tasks USE option No. 1, 2019 Informatics and ICT Standard exam options (10 options), S.S. Krylov, T.E. Churkina:

The figure shows the road map of the N-sky district, in the table an asterisk indicates the presence of a road from one settlement to another, the absence of an asterisk means that there is no such road. Each settlement on the diagram corresponds to its number in the table, but it is not known which number.

1 2 3 4 5 6 7 8 1 * * * 2 * * * 3 * * 4 * * * * * * 5 * * * 6 * * * 7 * * * 8 * * *

Determine which settlement numbers in the table can match settlements D And E on the diagram? In your answer, write down these two numbers in ascending order without spaces or punctuation marks.

✍ Solution:

• First, let's find unique vertices - which have a unique number of edges: this A(2 ribs) and H(6 ribs). In the table, they correspond to numbers 3 and 4:

	1	2	A	H	5	6	7	8
1			*	*			*
2			*	*				*
A	*	*
H	*	*			*	*	*	*
5				*		*	*
6				*	*			*
7	*			*	*
8		*		*		*

• According to the scheme, we find that the adjacent vertices for A are B And G. In the table, we determine the numbers corresponding to them - 1 and 2. Since they do not interest us according to the assignment, we denote them together:

	B,G	B,G	A	H	5	6	7	8
B,G			*	*			*
B,G			*	*				*
A	*	*
H	*	*			*	*	*	*
5				*		*	*
6				*	*			*
7	*			*	*
8		*		*		*

• Both vertices B and G are adjacent to the already known A and H and, in addition, the vertices F And C. According to the first column or the first row, we find that F or C will correspond to the number 7, and according to the second line - the number 8. Let's designate them in the table:

	B,G	B,G	A	H	5	6	F,C	F,C
B,G			*	*			*
B,G			*	*				*
A	*	*
H	*	*			*	*	*	*
5				*		*	*
6				*	*			*
F,C	*			*	*
F,C		*		*		*

• As a result, we get that the desired vertices - D And E- numbers match 5 And 6 . Since it does not matter which digit this or that vertex should correspond to, then in the answer we simply write down these digits in ascending order.

Hello, dear readers of the blog site. We continue to look, decide, remember what has already been forgotten. Today, next in line for the Unified State Examination in Informatics 2017, I will try to sort out the tasks as far as possible, indicate what you need to know for a successful passing the exam and also share my impressions of the tasks. I remind you that the exam in mathematics and the level, and have already been sorted out, you can read about the demo versions of these subjects at the links.

I passed the exam a long time ago, there were few such tasks at the university, and far from all, so I ask you to understand and forgive me if you disagree with my assessments of complexity or necessity. But nevertheless, I will write an article, I hope it will be useful to someone, and someone will express their opinion in the comments.

USE in Informatics 2017, what you need to know

Generally speaking, judging by the demo version of the Unified State Examination in Informatics 2017, you need to know a lot, I hope the graduates know all this and it will not be somehow unusual for them to see such tasks.

You need to know the binary number system

Again, I won’t tie the list of necessary knowledge to task numbers, I’ll just give it as a list, so let’s go, I’ll try as it gets more complicated:

• Work with spreadsheets. Anyone who has used Excel will do this task without any problems.
• Know what number systems are. At least binary, octal, decimal and hexadecimal, although there may be number systems with any base, for example 3. And not only know, but also be able to translate from one number system to another. Moreover, to save time, it is better to understand which number system it will be easier and faster to translate into. For example, look at the first task, which contains a demo version of the Unified State Examination in Informatics 2017, there you can save a lot of time if you convert from binary to hexadecimal, and not convert everything to decimal.
• Know logical functions, truth tables for them and be able to work with truth tables for expressions consisting of several logical functions.
• Be able to work with graphs and tables. Moreover, sometimes they can be connected and it is necessary to establish the relationship between them.
• To be able to represent textual information in the form of discrete, that is, digital, and to know the units of measurement of information.
• To some extent, a continuation of the previous subparagraph. The ability to estimate the amount of memory needed to store one or another type of information (text, graphics, video, etc.)
• Know at least one programming language and be able to use it, how to write programs (more on that later), and understand what has already been compiled.
• Knowledge of computer networks, in particular demo version there was a question about the TCP / IP protocol stack, perhaps there will be something else on the exam.
• Understand code written not in a programming language, but in Russian, if it’s not clear what I mean, see task 14 from the USE demo version.
• Be able to write programs in one of the programming languages ​​according to the task. And also understand someone else's code and find errors that were made when writing programs.

USE in Informatics 2017, impressions

After 5 years of studying computer science and programming at the university, I can’t say that the tasks seemed so easy. No, of course, everything is solvable, but you also need to know quite a lot. So the USE in Informatics 2017 is not very simple, it will be quite difficult to pass.

Important! If you cannot solve any task from part 2 given in the USE demo version, and do not even try to figure it out, being sure that you will have enough points for admission. even NOT go to university, to a specialty related to computer science and programming. Believe me, you can and will learn to program, but you will spend miles of nerves at the same time. So think very carefully whether you need it, especially since there is a possibility that you will never learn to program. And after thinking, it's better to give up programming anyway.

WITH modern world technologies and realities of programming, development USE in Informatics has little in common. There are some basic points, but even if you understand tasks a little, this does not mean that you will eventually become a good developer. But there are a lot of areas where IT specialists are needed. You will not lose at all if you want to have a stable income above the average. In IT, you get it. Provided, of course, that you have the appropriate skills. And you can develop and grow here as much as you like, because the market is so huge that you can’t even imagine! And 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 small step, after which years of self-development and improvement in this area will follow.

Structure

Part 1 contains 23 short answer tasks. This part contains tasks with a short answer, implying an independent formulation of a sequence of characters. Tasks check the material of all thematic blocks. 12 tasks are related to basic level, 10 tasks to an increased level of complexity, 1 task to a high level of complexity.

Part 2 contains 4 tasks, the first of which advanced level difficulty, the remaining 3 tasks high level difficulties. The tasks of this part involve writing a detailed answer in an arbitrary form.

3 hours 55 minutes (235 minutes) are allotted to complete the examination paper. 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.

Explanations for grading assignments

The performance of each task of part 1 is estimated at 1 point. The task of part 1 is considered completed if the examiner gave the answer corresponding to the code of the correct answer. Completion of the tasks of part 2 is estimated from 0 to 4 points. The answers to the tasks of 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.