Options for the exam in computer science from fipi. Unified State Exam program in computer science - Analysis of problems and materials

Hello, dear readers of the blog site. We continue to look, decide, remember what has already been forgotten. Today, on the turn of the Unified State Exam in Computer Science 2017, I will try to analyze the tasks as much as possible, indicate what you need to know to successfully pass the Unified State Exam, and also share my impressions of the tasks. Let me remind you that the Unified State Examination in mathematics and level have already been sorted out; you can read about demo versions of these subjects using the links.

I took the Unified State Exam a long time ago; at the university there were few such tasks, and not all of them, so please understand and forgive me if you do not agree with my assessments of difficulty 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.

Unified State Exam in Computer Science 2017, what you need to know

Generally speaking, judging by the demo version of the Unified State Exam in Computer Science 2017, you need to know a lot, I hope the graduates know all this and it won’t be somehow unusual for them to see such tasks.

You need to know the binary number system

Again, I won’t link the list of required knowledge to task numbers, I’ll just give it as a list, so let’s go, I’ll try to make it more difficult:

• Working with spreadsheets. Anyone who has used Excel will complete 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 convert 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 convert to. For example, look at the first task, which contains a demo version of the Unified State Exam in Computer Science 2017, you can save a lot of time there if you convert from binary to hexadecimal, rather than converting 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 a relationship between them.
• Be able to imagine text information in the form of discrete, that is, digital and know the units of measurement of information.
• To some extent, a continuation of the previous subparagraph. The ability to estimate the amount of memory required to store one or another type of information (text, graphic, video, etc.)
• Know at least one programming language and be able to use it, how to compose programs (more on that later), and understand what has already been compiled.
• Knowledge computer networks, in particular in demo version there was a question about the TCP/IP protocol stack, perhaps there will be something else on the exam.
• To understand code written not in a programming language, but in Russian, if it is not clear what I mean, see task 14 from the demo version of the Unified State Examination.
• Be able to write programs in one of the programming languages ​​according to the assignment. And also understand other people's code and find errors that were made when writing programs.

Unified State Exam in Computer Science 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 can be solved, but you also need to know quite a lot. So the Unified State Exam in Computer Science 2017 is not particularly simple; it will be quite difficult to pass.

Important! If you cannot solve any task from Part 2 given in the demo version of the Unified State Exam, and do not even try to figure it out, being confident that you already have enough points for admission. It's even NOT go to university to major in computer science and programming. Believe me, you may learn to program, but you will spend kilometers of nerves in the process. So think very carefully about whether you need this, especially since there remains a possibility that you will never learn to program. And after thinking about it, it’s better to give up programming anyway.

Good luck to everyone on the Unified State Exam, on preparing and choosing the exam you need!

If you found the article useful, please share it using the buttons located just below.

If you have any questions, write in the comments, I will try to answer as detailed and clear as possible.

(Visited 400 times, 1 visits today)

The video course “Get an A” includes all the topics necessary to successfully pass the Unified State Exam in mathematics with 60-65 points. Completely all tasks 1-13 of the Profile Unified State Exam in mathematics. Also suitable for passing the Basic Unified State Examination in mathematics. If you want to pass the Unified State Exam with 90-100 points, you need to solve part 1 in 30 minutes and without mistakes!

Preparation course for the Unified State Exam for grades 10-11, as well as for teachers. Everything you need to solve Part 1 of the Unified State Exam in mathematics (the first 12 problems) and Problem 13 (trigonometry). And this is more than 70 points on the Unified State Exam, and neither a 100-point student nor a humanities student can do without them.

All necessary theory. Quick ways solutions, pitfalls and secrets of the Unified State Exam. All current tasks of part 1 from the FIPI Task Bank have been analyzed. The course fully complies with the requirements of the Unified State Exam 2018.

The course contains 5 large topics, 2.5 hours each. Each topic is given from scratch, simply and clearly.

Hundreds of Unified State Exam tasks. Word problems and probability theory. Simple and easy to remember algorithms for solving problems. Geometry. Theory, reference material, analysis of all types of Unified State Examination tasks. Stereometry. Tricky solutions, useful cheat sheets, development of spatial imagination. Trigonometry from scratch to problem 13. Understanding instead of cramming. Visual explanation complex concepts. Algebra. Roots, powers and logarithms, function and derivative. A basis for solving complex problems of Part 2 of the Unified State Exam.

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

A weight matrix is ​​obtained from weighted graphs, 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 connected with 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 Informatics 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 task 3 of the Unified State Exam option No. 1, 2019 Computer science and ICT Standard 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 looking 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.

There were eleventh-graders living in the same school, 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 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!