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 a little about tasks, 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 belong to the 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. Maximum amount points that can be obtained for completing the tasks of part 2 - 12.
The lesson is devoted to how to solve the 3rd task of the exam in computer science
The 3rd topic is characterized as tasks basic level complexity, execution time - about 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 concepts necessary for solving the 3rd task of the exam.
Structuring information is the establishment of the main elements in information messages and establishing links between them.
Structuring is done with goal facilitate the perception and search for information.
Structuring is possible using the following structures (information models):
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.
The order of the elements is important.
The tables highlight objects(separate table entries) and properties(column names or row names): 
Consider family relationships in the tree:
Root– node without ancestors (A).
Sheet– node without descendants (D, E, F, G).
Height– greatest distance from root to leaf (number of levels).
Let's say the computer's hard drive has the following folders (directories) with files: 
Let's get a tree: 
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
is a graph with a path between any vertices.
Wood is a connected graph without cycles (closed sections).
Tree is a connected graph without cycles
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 assignments of this topic, two are most often used information models- 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 on next rule: if there is a connection between the objects of the diagram, then it is displayed by a line connecting the names of these objects on the diagram.
Solving tasks 3 USE in Informatics
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:
Result: 20
In addition, you can watch the video of the solution to this USE task in computer science:
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 BUT 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:
Result: 6
For a detailed solution of this 3 task from the USE demo version of 2018, see the video:
Solution 3 of the USE task in informatics (control version No. 1 of the examination paper of 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:
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
Solution 2* of the USE task in informatics 2018, option 10 (FIPI, " USE Informatics and ICT, standard 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 in 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
Analysis of 3 tasks of the Unified State Examination option No. 1, 2019 Informatics and ICT Typical exam options (10 options), S.S. Krylov, T.E. Churkina:
The figure shows a 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.
 |
|
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.
- 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:
- 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:
- 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:
- 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 these numbers in ascending order.
| 1 | 2 | A | H | 5 | 6 | 7 | 8 | |
| 1 | * | * | * | |||||
| 2 | * | * | * | |||||
| A | * | * | ||||||
| H | * | * | * | * | * | * | ||
| 5 | * | * | * | |||||
| 6 | * | * | * | |||||
| 7 | * | * | * | |||||
| 8 | * | * | * |
| B,G | B,G | A | H | 5 | 6 | 7 | 8 | |
| B,G | * | * | * | |||||
| B,G | * | * | * | |||||
| A | * | * | ||||||
| H | * | * | * | * | * | * | ||
| 5 | * | * | * | |||||
| 6 | * | * | * | |||||
| 7 | * | * | * | |||||
| 8 | * | * | * |
| B,G | B,G | A | H | 5 | 6 | F,C | F,C | |
| B,G | * | * | * | |||||
| B,G | * | * | * | |||||
| A | * | * | ||||||
| H | * | * | * | * | * | * | ||
| 5 | * | * | * | |||||
| 6 | * | * | * | |||||
| F,C | * | * | * | |||||
| F,C | * | * | * |
Many would not mind insuring themselves with ready-made answers to the USE-2017 in computer science. The exam is really not easy, you won’t be able to leave on intuition - you need to know. But do not rush to download answers from the first businessmen who come across the Web. First, let's figure out where the USE answers in computer science can come from; how realistic is it that anyone has them at all.
To whom and how do the USE answers get
There are three potential sources of prohibited information:
- hackers break into mail or other servers of the Ministry of Education and Science or FIPI;
- some of the employees of the Ministry and its departments violate the secret;
- teachers or students on the day of the exam promptly perform tasks from officially printed on Far East KIMs and send them to western regions with which the difference between them can reach 6-8 hours.
Logic dictates that the first two sources are the most expensive, because we are talking about exclusive information that a graduate may have in advance. The third source for the graduate is less expensive (and let's say in advance that it is completely useless).
What sources of USE-2017 answers in computer science can be trusted
From East to West
The trick with the time difference between different regions is no longer a trick, but rather stupidity on the part of some graduates and laziness on the part of scammers who could not come up with a more tempting argument. The fact is that KIMs are different everywhere. Options developed a large number of, and if you don’t know which KIM options your region will get (and this is unknown to anyone except the elite), you don’t get answers, but a lottery with a very small chance of winning.
Of course, individual tasks may coincide, since they come from the same base, but it’s hardly worth spending time looking for answers and money for acquiring them (although sometimes answers are offered for free, so to speak, from the Unified State Examination solidarity).
Hackers and corrupt officials
Of course, no one on the Web introduces himself: “Hello, I am a hacker (or a corrupt official). I'm ready to make you a unique selling proposition that you can't refuse."
However, you can meet the following "tender" story.
Eleventh-graders lived and lived in one school, and before they were all tired of preparing for exams, they decided to collect all the money together and buy USE answers through one person who has the necessary connections. With the world on a thread - bought. Yes, it got too expensive. They decided to win back their money, but at the same time help the rest of the students, and began to sell the purchased answers to others. “And how not to buy something,” people think, “after all, we believe our own, relatives, the same schoolchildren.”
Very similar to epic. But it most likely is. Fraudsters try to allegedly speak the language of “customers”, attract with a folding legend about the origin of the answers and successfully cash in on the fact that the Internet disappears into right moment lighter than easy.
Add to this observation that none of the previous exams that have already taken place this year have revealed information leaks. Neither in the media nor on the Internet, no one in en masse does not write that the answers that were posted on the Web agreed with the tasks in the exam. Will this series of Rosobrnadzor's successes be interrupted in computer science? Doubtful.
Conclusion
There is only one conclusion: you cannot trust any sources of USE answers. There is more swindle in this matter than real help.
How to pass the USE-2017 in informatics without answers
In computer science KIMs there will be no very easy questions like “Define binary system reckoning”, etc. All 23 closed and 4 open assignments designed to test your ability to analyze and apply knowledge. Without at least mediocre preparation for the exam, be prepared to retake. Alas, this year it will not work to retake the subject of choice and you will have to wait for the next year. On the other hand, you will have a whole year to study the subject perfectly and at a measured pace. And those who, because of the failure to pass computer science this year, are threatened by the army, will find benefit at least in the fact that after the service they will be able to enter the university on preferential terms.
If your interest in answers is dictated by simple self-doubt and the desire to insure, then everything is much simpler. You just don't need answers. You just need to repeat the basic things at night, sleep well and come to the exam with a fighting spirit.
Good luck to everyone on the exam!
The video course "Get an A" includes all the topics necessary for the successful passing of the exam in mathematics by 60-65 points. Completely all tasks 1-13 of the Profile USE in mathematics. Also suitable for passing the Basic USE in mathematics. If you want to pass the exam with 90-100 points, you need to solve part 1 in 30 minutes and without mistakes!
Preparation course for the exam for grades 10-11, as well as for teachers. Everything you need to solve part 1 of the exam in mathematics (the first 12 problems) and problem 13 (trigonometry). And this is more than 70 points on the Unified State Examination, and neither a hundred-point student nor a humanist can do without them.
All the necessary theory. Quick Ways solutions, traps and secrets of the exam. All relevant tasks of part 1 from the Bank of FIPI tasks have been analyzed. The course fully complies with the requirements of the USE-2018.
The course contains 5 large topics, 2.5 hours each. Each topic is given from scratch, simply and clearly.
Hundreds of exam tasks. Text problems and probability theory. Simple and easy to remember problem solving algorithms. Geometry. Theory, reference material, analysis of all types of USE tasks. Stereometry. Cunning tricks for solving, useful cheat sheets, development of spatial imagination. Trigonometry from scratch - to task 13. Understanding instead of cramming. Visual explanation complex concepts. Algebra. Roots, powers and logarithms, function and derivative. Base for solution challenging tasks 2 parts of the exam.
