Hello, dear readers of the blog site. We continue to look, decide, remember what has already been forgotten. Today it’s 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 for success passing 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 demo versions 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 present text information in discrete form, 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 of computer networks, in particular in the demo there was a question about the TCP/IP protocol stack, perhaps there will be something else in 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.
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 ultimately become a good developer. But there are a great many areas where IT specialists are needed. You can't go wrong if you want to have a 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 higher level difficulty, the remaining 3 tasks high level difficulties. The tasks in this part involve writing a detailed answer in free form.
For execution exam paper Allotted 3 hours 55 minutes (235 minutes). 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. Maximum amount The points you can get for completing tasks in part 2 are 12.
For school graduates. It should be taken by those who plan to enter universities in the most promising specialties, such as Information Security, automation and control, nanotechnology, system analysis and control, missile 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 the KIM Unified State Exam 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 No. 25, they removed the opportunity to write an algorithm in natural language as an answer.
Unified State Examination assessment
Last year, to pass the Unified State Exam in computer science with at least a C, it was enough to score 42 primary points. They were given, for example, for correctly completing the first 9 tasks of the test.
It is not yet known exactly what will happen in 2019: we need to wait for the 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 remained the same throughout the test, most likely it will not change and minimum score. Let's focus on these tables for now:
Structure of the Unified State Exam test
Computer science is the longest exam (the Unified State Examination in mathematics and literature is the same length), lasting 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 detailed answers, complete solutions to the tasks are written down on answer sheet 2.
All tasks are connected in one way or another with a computer, but during the exam you are not allowed to use it to write a program in group C problems. In addition, the problems do not require complex mathematical calculations and the use of a calculator is also not allowed.
Preparation for the Unified State Exam
- Take the Unified State Exam tests online for free without registration or SMS. The tests presented are identical in complexity and structure to the actual exams conducted in the corresponding years.
- Download demo versions of the Unified State Examination in computer science, which will allow you to better prepare for the exam and pass it easier. All proposed tests are developed and approved to prepare for Unified State Examination Federal Institute of Pedagogical Measurements (FIPI). All official versions of the Unified State Exam are developed in the same FIPI.
The tasks that you will see most likely will not appear on the exam, but there will be tasks similar to the demo ones, on the same topic or simply with different numbers.
General Unified State Examination figures
| Year | Minimum Unified State Examination score | Average score | Number of participants | Failed, % | 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 |
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:
- hackers hack email 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;
- On the day of the exam, teachers or students promptly complete tasks from those 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, 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 a large number of, and if you don’t know which CMM options 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.
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, schoolchildren like us.”
It's very epic. But this is most likely the case. Fraudsters try to speak allegedly in the language of “clients”, attract with a simple legend about the origin of the answers and successfully make money, taking advantage of the fact that the Internet disappears into right moment lighter than light.
Add to this observation that none of the previous exams that have already taken place this year 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 the binary number system,” 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 enroll in 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!
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 basic level complexity, execution 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 what is needed to solve 3 Unified State Exam assignments concepts.
Structuring information- this is the establishment of the main elements in information messages and the establishment of 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 (closed sections).
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 information models are most often used - 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
3_3: 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).
| 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 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.
| 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 shortest path between points A And F provided that you can only travel on the roads indicated in the table.
✍ Solution:
Result: 12
3_5: Solution 2* of the Unified State Examination task in computer science 2018, option 10 (FIPI, “ Unified State Examination computer science and ICT, typical 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).
| 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 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
✍ Solution:
Result: 6
3_2: 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.
✍ Solution:
- 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:
3_1: 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.
✍ Solution:
- 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_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.
 |
|
Determine which numbers of settlements in the table can correspond settlements D And E on the diagram? In your answer, write down these two numbers in ascending order without spaces or punctuation.
✍ Solution:
- 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:
- 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:
- 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:
- 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.
| 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 | * | * | * |