Unified State Exam in Computer Science April all options. Collection of ideal social studies essays

The lesson is devoted to how to solve task 3 of the Unified State Exam in computer science

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

* Some page images are taken from the presentation materials of K. Polyakov

Information structuring and information models

Let us briefly consider the concepts necessary to solve task 3 of the Unified State Exam.

Structuring information- this is the establishment of the main elements in news reports and establishing connections between them.

Structuring is done with purpose facilitating the perception and retrieval of information.

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

listing of elements collected according to a characteristic feature;

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

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

The order of the elements is important.

The tables highlight objects(individual table records) and properties(column names or row names):

Let's consider family relationships in the tree:

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

Let’s say there are the following folders (directories) with files on your computer’s hard drive:

We get a tree:

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

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

Graph showing roads between villages

is a graph that has a path between any of its vertices.

Tree is a connected graph without cycles

Weighted graphs have an “edge weight”:

Weighted graphs produce a weight matrix, and the inverse transformation is also possible.

Finding the shortest path (brute force)

Determining the shortest path between points A and D

• In USE tasks on this topic, two are most often used: information models- tables and diagrams.
• Information in the table is constructed according to the following rules: at the intersection of a row and a column there is information that characterizes the combination of this row and column.
• On the diagram information is constructed according to the following 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 of the Unified State Exam in computer science

Unified State Examination in Informatics 2017, assignment from the collection of Ushakova D.M., option 1:

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

Since the table and diagram were drawn independently of each other, the numbering of settlements in the table is in no way related to the letter designations on the graph.
Determine how long the road from point is D to point TO. In your answer, write down the integer as it is indicated in the table.

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

Result: 20

In addition, you can watch a video of the solution to this Unified State Exam assignment in computer science:

3 task. Demo version of the Unified State Exam 2018 computer science (FIPI):

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

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

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

Result: 6

For a detailed solution to this 3rd task from the demo version of the Unified State Exam 2018, watch the video:

Solution 3 of the Unified State Examination task in computer science (control version No. 1 of the 2018 exam paper, S.S. Krylov, D.M. Ushakov):

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

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

Result: 11

Video analysis of the task:

Solution 3 of the Unified State Examination in computer science (11th version of the State Examination in computer science 2018):

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 points.

Determine the length shortest path between points A And F provided that you can only travel on the roads indicated in the table.

Result: 12

Solution 2* of the Unified State Examination in Informatics 2018, option 10 (FIPI, “ Unified State Examination computer science and ICT, standard exam options 2018", S.S. Krylov, T.E. Churkina):

Between settlements A, B, C, D, E, F, Z One-way roads have been 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 points).

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

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

Result: 6

Analysis of 3 tasks Unified State Exam option No. 1, 2019 Computer Science and ICT Model exam options (10 options), S.S. Krylov, T.E. Churkina:

The figure shows a road map of the N-rayon; 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 numbers of settlements in the table can correspond to settlements D And E on the diagram? In your answer, write down these two numbers in ascending order without spaces or punctuation.

• First, let's find unique vertices - those that 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 diagram, 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 according to the assignment they do not interest us, we designate 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. From the first column or first row we find that F or C will correspond to the number 7, and from the second line to the number 8. Let us 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 obtain that the required vertices are D And E- numbers correspond 5 And 6 . Since it does not matter which digit this or that vertex should correspond to, in the answer we will simply write these digits in ascending order.

Many would not mind being on the safe side with ready-made answers for the Unified State Exam 2017 in computer science. The exam is really not easy, you won’t be able to pass on intuition - you need to know. But don’t rush to download answers from the first dealers you come across on the Internet. First, let's figure out where the answers to the Unified State Exam in computer science can come from; How realistic is it that anyone even has them?

Who gets the Unified State Exam answers and how?

There are three potential sources of prohibited information:

1. hackers hack email or other servers of the Ministry of Education and Science or FIPI;
2. some of the employees of the Ministry and its departments violate the secret;
3. On the day of the exam, teachers or students promptly complete assignments from KIMs officially printed in the Far East and send them to the western regions, with which the difference between them can reach 6-8 hours.

Logic dictates that the first two sources are the most expensive, so we are talking about exclusive information that a graduate can have in advance. The third source for a graduate is less expensive (and let’s say in advance that it is completely useless).

Which sources of answers to the Unified State Exam 2017 in computer science can you trust?

From East to West

The trick with time differences 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 were unable to come up with a more tempting argument. The fact is that CMMs are different everywhere. Options developed large number, and if you don’t know which variants of CMMs will go to your specific region (and this is unknown to anyone except a select few), 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 database, but this is unlikely to be worth spending time searching for answers and money for purchasing them (although sometimes answers are offered for free, so to speak, out of Unified State Exam solidarity).

Hackers and corrupt officials

Of course, no one on the Internet introduces himself: “Hello, I’m a hacker (or a corrupt official). I’m ready to make you a unique selling proposition that you can’t refuse.”

However, you can find the following “soul-touching” story.

In one school there lived eleventh graders, and they were all so tired of preparing for exams that they decided to pool all the money and buy the Unified State Exam answers through one person who had the necessary connections. Out of the blue, we bought it. Yes, it was a bit expensive. They decided to get their money back, and at the same time help the rest of the schoolchildren, and began to sell the purchased answers to others. “And why not buy something,” people think, “after all, we believe in our own, relatives, and schoolchildren.”

It's very epic. But this is most likely the case. Fraudsters try to speak allegedly in the language of “clients”, attract people with a simple legend about the origin of the answers and successfully make money, taking advantage of the fact that it is easy to disappear on the Internet at the right moment.

Add to this observation that none of the previous exams that have already taken place this year have revealed any information leakage. Neither in the media nor on the Internet does anyone write en masse that the answers that were posted on the Internet agreed with the tasks in the exam. Will this series of successes of Rosobrnadzor really end in computer science? Doubtful.

Conclusion

There is only one conclusion: no sources of Unified State Examination answers can be trusted. There is more deception in this matter than real help.

How to pass the Unified State Exam 2017 in computer science without answers

In KIMs in computer science there will not be very easy questions like “Define binary system notation”, etc. All 23 closed and 4 open tasks are aimed at testing your ability to analyze and apply knowledge. Without at least average preparation for the exam, be prepared to retake it. Alas, this year it will not be possible to retake the subject of your choice and you will have to wait until next year. On the other hand, you will have a whole year to learn the subject perfectly and at a measured pace. And those who, due to failure to pass computer science this year, are facing the army, will at least find benefit in the fact that after service they will be able to enter the university on preferential terms.

If your interest in answers is dictated by simple self-doubt and a desire to play it safe, then everything is much simpler. You simply don't need answers. You just need to repeat the basic things at night, get a good night's sleep and come to the exam with a fighting spirit.

Good luck to everyone on the exam!

WITH modern world technologies and realities of programming, development Unified State Exam in Computer Science has little in common. There are some basic points, but even if you understand a little about the tasks, this does not mean that you will eventually become good developer. But there are a great many areas where IT specialists are needed. You can't go wrong if you want to have stable income above average. In IT you will get it. Provided, of course, that you have the appropriate abilities. And you can develop and grow here as much as you want, 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 preparation for the Unified State 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 short answer questions. This part contains short-answer tasks that require you to independently formulate a sequence of symbols. The assignments test 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 is of an increased level of difficulty, the remaining 3 tasks high level complexity. The tasks in this part involve writing a detailed answer in free form.

3 hours 55 minutes (235 minutes) are allotted to complete the examination work. It is recommended to spend 1.5 hours (90 minutes) to complete the tasks of Part 1. It is recommended to devote the rest of the time to completing the tasks of part 2.

Explanations for grading assignments

Completion of each task in Part 1 is worth 1 point. Part 1 task is considered completed if the examinee gives an answer that corresponds to the correct answer code. Completion of tasks in Part 2 is graded from 0 to 4 points. Answers to tasks in Part 2 are checked and assessed by experts. The maximum number of points that can be obtained for completing tasks in part 2 is 12.