Today, the importance of knowledge of computer science and the ability to work on a computer is beyond doubt, because computer technology has penetrated into all spheres of life and sectors of the national economy. Impossible without them modern medicine, construction, industry, transport logistics and even competent farming.
The Unified State Examination in Informatics is included in the category of selective exams and is required if you are going to be engaged in information security, programming, nanotechnology, the construction of missile systems, nuclear physics, master automation and control or system analysis in the future. Some students mistakenly believe that everyone who knows how to work on a computer can take this test.
This has already caught a lot of high school students. But computer science requires not just memorization of terminology and skills in working with familiar software, but also knowledge of the basics of programming, good mathematical preparation and developed logical thinking. For successful passing the exam-2017 must be familiarized with possible changes in KIMs, find out the structure and content examination card, as well as the timing of this exam. Let's take a look at each of these questions.
Demo version of the USE-2017
USE dates in informatics and ICT
This subject can be taken on one of the dates determined by Rosobrnadzor:
- Early period. On May 29, 2017, the exam will be taken by those who have the right to write computer science ahead of schedule. Recall that graduates of previous years, students who studied at evening school, participants in international and All-Russian Olympiads, competitions and sports competitions, schoolchildren who have decided children in need of treatment or rehabilitation, and those who are going to continue their studies at foreign universities. To obtain such a privilege, you need to write an application of the established form on time (before March 1). In addition, April 5, 2017 is named the date of the reserve in case of force majeure;
- Main stage. On June 9, 2017, the majority of graduates will take the exam in informatics and ICT.
- Backup date. Two reserve dates were determined: June 20 (for informatics and ICT) and June 30 - for all subjects.
Statistical information
As practice shows, not so many graduates aspire to try their hand at computer science. For example, in 2016, this subject was chosen by 64 thousand people (about 5% of schoolchildren). Nevertheless, the popularity of computer technologies is growing every year - in 2015, a little less than 52 thousand graduates decided to take this exam.
The ability to work on a computer does not guarantee the successful passing of the exam! As already mentioned, this exam cannot be called easy. This is evidenced by the fact that in 2015 and 2014, 10.4 and 16.2% of schoolchildren, respectively, could not overcome the minimum threshold, and about 14 thousand students did not come to the exam at all, having encountered difficulties in preparing. The average score is estimated at the level of 53.6, which can be equated to the mark "3", and the number of eleventh graders those who know computer science for the maximum one hundred points, amounted to 129 people in 2015.
What can I take on the exam in computer science?
It is worth saying once again that the USE in computer science does not involve the use of additional reference materials and computer technology, including calculators. During the exam, it is forbidden to talk, turn around and stand up. You can go to the toilet room or the first-aid post, but you need to notify the observer who will accompany you to your destination of this need.
Do not try to carry a smartphone, tablet, smart watch, bluetooth headphones and other audio and video equipment with you, as they will still be detected by the metal detector frame. Do not expose yourself to the risk of being removed from the exam, because in 2015 alone, 1124 students were removed from the exam for violating the rules and regulations. Fraud will deprive you of the opportunity!
The structure of the exam in informatics and ICT
The exam in this subject will test the theoretical knowledge of computer science graduates and their skills in working with information and computer technology. Specifically, the student will be required to demonstrate logical thinking, skills in algorithmization, programming, modeling and conducting computer experiments, knowledge of telecommunication technologies, as well as the ability to store, search and sort data. KIMs in informatics consist of 27 tasks, combined into two parts:
- the first part includes 23 tasks, suggesting a short answer in the form of sequentially written letters or numbers;
- the second part is 4 tasks that need to be answered in expanded form.
Recall that since last year, all simple types of tasks have been excluded from the tickets. Specialists from the team decided to leave in KIMs only tasks related to the category of complex and advanced level difficulties. In total, 235 minutes are allotted for the performance of KIMs.
Assessment of the Unified State Examination in Informatics
According to latest information, it is quite possible that in 2017 the practice of transferring points for the USE into a five-point system will be returned, and the results of the examination will have an impact on the certification assessment. So far, there is no reliable and unambiguous information on this issue, but for general orientation, we will give a system for translating points into grades.
Possibly in 2017 USE result will affect your school grade! - From 0 to 39 points - a sign of unsatisfactory knowledge at the level of mark "2";
- From 40 to 55 points - satisfactory knowledge, points are identical to the mark "3";
- From 56 to 72 points show good level knowledge and skills in this subject, which means that your grade is “4”;
- From 73 points means excellent knowledge, and the student deserves "5".
Recall that you can find out your scores for the exam at the announced time by registering on the USE portal. To identify your identity, you will need to enter your passport data.
Preparation for the exam in computer science
It is much easier to prepare for computer science if you focus on demo versions of KIMs of 2017, which can be downloaded on our website (see the beginning of the article). These ticket options were developed by specialists from the Federal Institute for Pedagogical Measurements, who are also responsible for the real tasks for the exam. Of course, there will not be a 100% match in the tasks, but the theme and structure will be identical to the demo version.
USE in Informatics
The USE in Informatics is one of the elective exams 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, nanotechnologies, system analysis and control, rocket systems and astronautics, nuclear physics and technologies and many others.
Preparing for the Unified State Exam (GVE) in computer science is a rather difficult task. Every year the complexity of the tasks proposed for the exam increases. At the same time, the student is busy preparing for the exam in compulsory subjects. The complexity of preparing for the Unified State Examination (GVE) in computer science is due to the small number of hours allocated for its study.
The total number of participants in the exam in 2015 is 50394 people. The proportion of exam participants among all graduates over a number of years is about 7.2%.
The average test score in 2015 was 53.99 points (in 2014 - 57.79 points). The decrease in the average test score is explained by the decrease total tasks in CMM due to the exclusion of the simplest ones, which had a low differentiating ability of tasks. At the same time, the proportion of participants who received high test scores(81-100) increased (8.21% in 2015 against 7.15% in 2014).
The proportion of graduates who did not score the minimum number of points in 2015 was 16.15%, while in 2014 it was 10.36%. The exclusion of tasks with a choice of answers and a general decrease in the number of tasks had an effect. This change reflects the profile nature of the elective examination, which requires the participant to conduct targeted preparation.
The number and proportion of 100-point students in the USE in 2015 (105 people, 0.21%) increased by 3 times compared to the USE in 2014 (35 people, 0.07%), but in any case, these values are small and are within the bounds of statistical error. The share of high scorers (81-100 test scores) in 2015 also increased compared to 2014 to 8.21% in 2015 against 7.15% in the previous year.
USE Score Transfer Scale 2017 in Informatics
It is impossible to know in advance before the exam by what formula the points will be transferred and therefore the information presented below is approximate. That is, it will be like this.
Indicative score transfer scale (2017)
| Primary score | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 |
| Test score | 7 | 14 | 20 | 27 | 34 | 40 | 42 | 44 | 46 | 48 | 50 | 51 | 53 | 55 | 57 | 59 | 61 | 62 | 64 | 66 | 68 | 70 | 72 | 73 | 75 | 77 | 79 | 81 | 83 | 84 | 88 | 91 | 94 | 97 | 100 |
THRESHOLD SCORE
The order of Rosobrnadzor established the minimum number of points, confirming the development by the participants of the exams of the main general educational programs of the secondary (full) general education in accordance with the requirements of the federal state educational standard secondary (complete) general education.red numbers means the minimum threshold for passing the exam.
THRESHOLD IN COMPUTER SCIENCE AND ICT: 40 POINTS.
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.
For the exam, you must have a black gel pen, a passport.
PLAN OF THE EXAMINATION WORK OF THE USE ON INFORMATICS 2017
Structure of the USE 2017 in Informatics
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. 12 of the tasks have a basic level of difficulty, 11 - advanced. Developers of control and measuring materials recommend taking no more than 90 minutes for them.
- Part 2: 4 tasks (24-27) with a detailed answer, complete solution tasks are recorded on the answer sheet 2. The first of them has an increased level of complexity, the rest have a high level.
Informatics - at o the longest exam (the same duration as the USE in mathematics and literature), the duration is 3 hours 55 minutes.
Designation of the level of complexity of the task: B - basic, P - increased, C - high.
| Content elements and activities to be checked | Task difficulty level | The maximum score for completing the task | Approximate time task completion (min.) |
| Exercise 1. Knowledge of number systems and binary representation of information in computer memory | B | 1 | 1 |
| Task 2. Ability to build truth tables and logic circuits | B | 1 | 3 |
| Task 3. | B | 1 | 3 |
| Task 4. Knowledge of the file system for organizing data or the technology of storing, searching and sorting information in databases | B | 1 | 3 |
| Task 5. Ability to encode and decode information | B | 1 | 2 |
| Task 6. Formal execution of an algorithm written in natural language or the ability to create linear algorithm for a formal executor with a limited set of commands | B | 1 | 4 |
| Task 7. Knowledge of information processing technology in spreadsheets and data visualization methods using charts and graphs | B | 1 | 3 |
| Task 8. Knowledge of the basic constructions of the programming language, the concept of a variable, the assignment operator | B | 1 | 3 |
| Task 9. The ability to determine the information transfer rate for a given channel bandwidth, the amount of memory required to store sound and graphic information | B | 1 | 5 |
| Task 10. Knowledge of methods for measuring the amount of information | B | 1 | 4 |
| Task 11. Ability to execute recursive algorithm | B | 1 | 5 |
| Task 12. Knowledge of the basic principles of the organization and functioning of computer networks, network addressing | B | 1 | 2 |
| Task 13. The ability to calculate the information volume of the message | P | 1 | 3 |
| Task 14. The ability to execute an algorithm for a specific performer with a fixed set of commands | P | 1 | 6 |
| Task 15. Ability to represent and read data in different types of information models (diagrams, maps, tables, graphs and formulas) | P | 1 | 3 |
| Task 16. Knowledge of positional number systems | P | 1 | 2 |
| Task 17. Ability to search for information on the Internet | P | 1 | 2 |
| Task 18. Knowledge of the basic concepts and laws of mathematical logic | P | 1 | 3 |
| Task 19. Working with arrays (filling, reading, searching, sorting, mass operations, etc.) | P | 1 | 5 |
| Task 20. Analysis of an algorithm containing a loop and branching | P | 1 | 5 |
| Task 21. Ability to analyze a program using procedures and functions | P | 1 | 6 |
| Task 22. Ability to analyze the result of the execution of the algorithm | P | 1 | 7 |
| Task 23. Ability to build and transform logical expressions | AT | 1 | 10 |
| Task 24 (C1). Ability to read a fragment of a program in a programming language and correct errors | P | 3 | 30 |
| Task 25 (C2). Ability to write a short (10-15 lines) simple program in a programming language or write an algorithm in a natural language | AT | 2 | 30 |
| Task 26 (C3). Ability to build a game tree according to a given algorithm and justify a winning strategy | AT | 3 | 30 |
| Task 27 (C4). Ability to create own programs(30-50 lines) for solving problems of medium complexity | AT | 4 | 55 |
What programming language can be used to solve tasks?
As for the first part, it presents tasks in five languages: C, Pascal, Python, Algorithmic language and BASIC. Tasks 24 and 25 of the second part are also presented in these languages, but task 25 (to complete the program) can be performed in any language, including natural or in the form of a flowchart. Task 27 can be performed in any programming language, but it is not advisable to choose some little-known language. Simplify the work of inspectors. You must show the ability to write algorithms, and not the knowledge of some "Brainfuck".
What programming language features can be used in the exam?
All. However, you must specify the version of the language in which you are writing the program. One version of the language may well not have the same features as the other.
R USE schedule 2017
Early stage
main stage
As part of the main stage of the Unified State Examination in Informatics, it will be held on May 29 (Monday) in Orenburg (MOAU "Lyceum No. 1", Orenburg, Kharkovskaya St., 14)
Preparation for the exam in computer science
It is better to start preparing for testing in advance. It is necessary to take into account the fact that school program does not provide the necessary amount of knowledge to pass the profile exam.
To get an idea of the format of the final knowledge test, you can download demo versions and guidelines on the official portal of the exam. Taking a few online computer science tests will help you determine which topics you have knowledge gaps in. The exam covers only those areas that are easily formalized. Thus, "Number systems", "Logic", "Information coding" and "Algorithmization and programming" form a kind of basis.
Subsequent systematic solution standard options will allow you to work out the skill of quickly finding the answer in the first part. You should not count on a high result if part C is not disassembled and worked out. Three out of four tasks high level difficulties associated with programming. In order for a year or six months to be enough to prepare for the exam, you need not just memorize the theory in order to apply it with difficulty in solving problems. It is necessary to adhere to several rules that can greatly facilitate the life of a graduate-applicant:
- Drawing up a detailed training plan: studying the topic + mastering the terminology + solving problems.
- Do not neglect online testing: taking several tests will help you determine the level of your knowledge and identify gaps.
- With a systematic solution and analysis of the tasks of the exam in computer science, you will develop the skill to quickly find the answer in the first part of the exam questions.
Explore USE structure so that the time allotted for completing tasks and points for answers do not come as a surprise to you. The sooner you get acquainted with KIM, the stronger your nerves will be during the exam.
It is important to realistically assess your strengths if there are 2-3 months left before the date of passing the exam. Even with a low level of knowledge, the situation can be significantly improved if the time is properly allocated. You should focus on the daily repetition of the material covered. Theoretical material can be repeated using the site https://inf-ege.sdamgia.ru/page/theory
Online preparation for the exam in computer science
Runet offers many sites where you can find useful materials for preparing for the exam.
Literature for preparing for the exam: http://www.alleng.ru/edu/comp2.htm
General USE figures in computer science:
|
Year |
Min. USE score |
Average score |
Number of applicants |
Did not pass, % |
Qty |
Duration- |
|
2009 |
||||||
|
2010 |
62,74 |
62 652 |
7,2 |
240 |
||
|
2011 |
59,74 |
Compared to other subjects, the Unified State Examination in Informatics is the most conservative exam, because its structure has not changed much from the very beginning. So that demo version of the Unified State Examination in Informatics 2019 extremely similar to more. There are still minor changes, and they concern the order of presentation of the first five tasks (more detailed information is presented in the table).
In the question structure and codifier changes not entered.
Task structure
Exam options consist of 27 tasks of varying complexity (basic, advanced, high), divided into two parts.
Part 1 consists of 23 questions, suggesting a short answer. Of them 12 tasks belong to the basic level of knowledge, 10 - to higher and one- to high. The answer to the tasks of the first part is written as a sequence of numbers and letters in two places: in the answer field in the text KIMov and in the corresponding line of the answer sheet №1 .
Part 2 is four tasks for a detailed solution (one high-level question and three high-level ones). Decisions 24-27 tasks are written in full on the answer sheet №2 . If necessary, an additional sheet is drawn up.
Categories of those taking the exam in computer science
To passing the exam schoolchildren without academic debts who have fully mastered the information provided for by the curriculum are allowed. Annual grades for the program of secondary (complete) education must be positive (above two).
Voluntarily take the exam can:
- students with handicapped health;
- pupils of special closed schools, as well as places of deprivation of liberty, passing academic plan secondary education;
- graduates receiving secondary vocational education.
The following have the right to take the exam:
- graduates of previous years (including holders of valid results
- graduates of secondary (complete) foreign educational institutions.
The corresponding order of the Ministry of Education and Science determines the duration of the exams. Main delivery period USE 2019 starts May 28 ends in June. There are six reserve days in the schedule. Students who have received unsatisfactory grades in mathematics and the Russian language (compulsory subjects), as well as those who missed the exam for a good reason, are allowed to retake in September.
Submission of applications and registration for participation in the exam
Early delivery of the exam in computer science in 2019
In September, Rosobrnadzor approved the schedule of unified state exams on the 2019. As always, the possibility of early conducting the exam(in March-April). The registration date for early exams is no later than February 2019. Pre-term exam in informatics according to the project will be held 21 March. The reserve day for additional retakes is April 6. The main stage will take place on May 28.
The right to take the exam ahead of schedule is granted to the following persons:
- graduates of evening educational institutions;
- applicants who go to all-Russian and international competitions, matches, tournaments and olympiads;
- students moving to a permanent place of residence or further education to another country;
- graduates who, for health reasons, are sent at the time of the main period of passing the exam to medical facilities for the purpose of conducting health-improving, as well as rehabilitation measures;
- graduates Russian schools located territorially outside the Russian Federation;
The main disadvantage of early delivery of the exam is the psychological factor. Graduate Exam high school- this is a huge stress, due to which sleep and appetite disturbances appear, and in extreme cases even somatic diseases. The early passing of the Unified State Examination attracts special attention from both the press and supervisory authorities, which further exacerbates the already difficult situation at the exam. Worries about this can play a cruel joke on the graduate, and the result of the exam at the exit will be much lower than expected.
Additional Information
(along with and) is one of the longest. It lasts almost 4 hours (235 minutes). In the computer science and ICT exam, it is strictly forbidden to use additional materials and equipment. KIMs designed in such a way that there is no need to use calculators. The graduate will have to answer questions and model the program. There are no complex computational tasks involving the use of technology.
Passing scores for the Unified State Examination in Informatics and ICT
The passing level is fixed in 2019 in the region 6 primary points. To do this, it is enough to correctly solve eight tasks from the first part. According to the score transfer scale determined that it matches 40 test points.
There is currently increasing interest in exact sciences in general and computer science in particular. And many universities provide services for the training of professionals related to this particular subject. That's why GPA, with which you can really enter the university is determined at the level 70-80 . Moreover, the competition can be traced even to paid places.
Appeals
The result of the Unified State Exam less than six primary points is considered unsatisfactory. If the applicant does not agree with the results of his exam, then in the first two working days from the moment the results are announced, he has the opportunity to publicly express his dissatisfaction by filing an appeal. School graduates of the current year can do this right at their school, graduates of previous years - at the PES (exam points). The appeal is considered within four days from the moment of its receipt by the conflict commission. The SEC recalculates the scores and decides to grant or reject the appeal.
If everything turned out well, and the graduate received a certificate of passing the exam, then he can safely start choosing a university and submitting documents. It is worth noting that from September 1, 2013 certificate is valid for four years after receiving it. This condition allows you to enter universities without additional tests through year, two or even three after passing the exam.
Preparation for the exam in computer science
From successfully passing exams to 11th grade depends on the fate of the graduate, his future, his profession. Therefore, great attention should be paid to the preparation for this stage. Preparation for the Unified State Examination in Informatics 2019 should begin with the study of relevant literature, which may include school textbooks and supplementary manuals. After getting acquainted with the theory, it is necessary to master the skills of solving problems, adapt to the wording and requirements of the exam.
This will help the Collection of tasks in computer science USE 2016 under the direction of E.M. Zorina and M.V. Zorin. Issue includes assignments different types on all topics of the exam (+ answers to them) and guidelines.
Online learning
For thorough preparation for USE Federal the Service for Supervision in the Sphere of Education and Science has created a website with an open bank of tasks. This resource contains information related to the exam: regulations, demos, manuals, specifications, codifiers. open bank FIPI(fipi.ru) allows you to find your " weak spots”and work them out, pulling up both theory and practice. Additionally, a meeting room is organized on the site to ask questions that in one way or another relate to the Unified State Examination and the OGE.
On the site you can download and demo versions of any subject. The purpose of the demo is to enable USE participants and the general public to get acquainted with the structure of the future exam, with the number and wording of tasks, here are the answers to them and an analysis of the evaluation criteria.
To assess the quality of preparation of schoolchildren for the upcoming exams, online tests are organized and trial exams. Online test This is a real-time exam on the Internet. After passing, you can see your results, as well as parse the correct answers. Online testing can also be used as a method of self-control after studying a particular topic. School 1-2 times a trial examination is organized annually. This helps future students to get used mentally to the exam environment, to make out organizational issues, learn how to allocate time so that it is enough to complete all tasks and check them.
Psychological preparation for the exam is also important. In a stressful situation, it can be quite difficult to discard the excitement and remember everything that was taught during 11 years. It is necessary to mentally set yourself up for a “working wave”, step back from the outside world and try to look at tasks with a sober mind. And to achieve this is not so easy. Firstly, because the USE is the first serious exam in a student's life. Secondly, the immediate future of the applicant (admission or not admission to the desired university) depends on its results. Thirdly, because often the close relatives of the student, his family, behave rudely and carelessly towards the child himself, further shaking the already anxious nervous system future student.
Statistics for passing the exam in computer science for the past years
According to Rosobnadzor, 2015 USE in Informatics passed in total 5% alumni, in 2016 - 4% (7% of which received an unsatisfactory grade). Today, this subject is gaining popularity. AT 2017 USE in Informatics and ICT passed about 7% graduates, which is 55,000 students.
Exam Schedule
The early stage of passing the exam in computer science in 2019 is being specified.
The main stage of passing the exam in computer science in 2019 is being specified.
About the exam subject: computer science
Vyacheslav Leshchiner, presenter, spoke about preparation for computer science Researcher FGBNU "FIPI".
USE in Informatics in 2017
Compared to other subjects, the Unified State Examination in Informatics is the most conservative exam, because its structure has not changed much from the very beginning. So the demo version of the Unified State Examination in Informatics in 2017 is extremely similar to earlier KIMs. There are still minor changes, and they concern the order of presentation of the first five tasks (more detailed information is presented in the table).
No changes have been made to the structure of the questions and the codifier.
Table. Compliance with the tasks of the Unified State Examination in Informatics 2016 and 2015
2016 2015
Task 1Task 4
Task 2Task 2
Task 3Task 5
Task 4Task 3
Task 5Task 1
Task structure
Exam options consist of 27 tasks of varying complexity (basic, advanced, high), divided into two parts.
Part 1 consists of 23 short answer questions. Of these, 12 tasks belong to the basic level of knowledge, 10 to the advanced level, and one to the high level. The answer to the tasks of the first part is written in the form of a sequence of numbers and letters in two places: in the answer field in the text of KIMs and in the corresponding line of the answer form No. 1.
Part 2 is four tasks for a detailed solution (one high-level question and three high-level ones). Solutions of 24-27 tasks are recorded in full on the answer sheet No. 2. If necessary, an additional sheet is drawn up.
Schoolchildren without academic debts, who have fully mastered the information provided for by the curriculum, are allowed to pass the exam. Annual grades for the program of secondary (complete) education must be positive (above two).
Voluntarily take the exam can:
students with disabilities;
pupils of special closed schools, as well as places of deprivation of liberty, passing the curriculum of secondary education;
graduates receiving secondary vocational education.
The following have the right to take the exam:
graduates of previous years (including holders of valid results
graduates of secondary (complete) foreign educational institutions.
The corresponding order of the Ministry of Education and Science determines the duration of the exams. The main period for passing the exam 2017 begins on May 27, ends in June. There are six reserve days in the schedule. Students who receive unsatisfactory grades in mathematics and the Russian language (mandatory subjects), as well as those who missed the exam for a good reason, are allowed to retake in September.
Submission of applications and registration for participation in the exam
Early delivery of the exam in computer science in 2017
In September, Rosobrnadzor approved the schedule of unified state exams for 2017. As always, the possibility of early USE (in March-April) is being considered. The registration date for early exams is no later than February 2017. Pre-term exam in informatics according to the project will be held on March 16. The reserve day for additional retakes is April 3. The main event will take place on May 31st.
The right to take the exam ahead of schedule is granted to the following persons:
graduates of evening educational institutions;
applicants who go to all-Russian and international competitions, matches, tournaments and olympiads;
students moving to a permanent place of residence or further education in another country;
graduates who, for health reasons, are sent at the time of the main period of passing the exam to medical facilities for the purpose of conducting health-improving, as well as rehabilitation measures;
graduates of Russian schools located territorially outside the Russian Federation;
The main disadvantage of early delivery of the exam is the psychological factor. The high school graduate exam is a huge stress, which causes sleep and appetite disturbances, and in extreme cases even somatic diseases. The early passing of the Unified State Examination attracts special attention from both the press and supervisory authorities, which further exacerbates the already difficult situation at the exam. Worries about this can play a cruel joke on the graduate, and the result of the exam at the exit will be much lower than expected.
Additional Information
The USE in Informatics 2017 (along with literature and mathematics) is one of the longest. It lasts almost 4 hours (235 minutes). It is strictly forbidden to use additional materials and equipment during the Informatics and ICT exam. KIMs are designed in such a way that there is no need to use calculators. The graduate will have to answer questions and model the program; there are no complex computational tasks involving the use of technology.
Passing scores for the Unified State Examination in Informatics and ICT
The passing level is fixed in 2016 in the area of 6 primary points. To do this, it is enough to correctly solve eight tasks from the first part. The score conversion scale determined that this corresponds to 40 secondary scores.
At present, there is a growing interest in the exact sciences in general and in computer science in particular. And many universities provide services for the training of professionals related to this particular subject. Therefore, the average score with which you can really enter a university is determined at the level of 70-80. Moreover, the competition can be traced even to paid places.
Appeals
The result of the Unified State Exam less than eight primary points is considered unsatisfactory. If the applicant does not agree with the results of his exam, then in the first two working days from the moment the results are announced, he has the opportunity to publicly express his dissatisfaction by filing an appeal. School graduates of the current year can do this right at their school, graduates of previous years - at the PES (exam points). The appeal is considered within four days from the moment of its receipt by the conflict commission. The SEC recalculates the scores and decides to grant or reject the appeal.
If everything turned out well, and the graduate received a certificate of passing the exam, then he can safely start choosing a university and submitting documents. It is worth noting that from September 1, 2013 the certificate is valid for four years after receiving it. This condition allows you to enter universities without additional tests a year, two or even three after passing the exam.
Preparation for the exam in computer science
The further fate of the graduate, his future, his profession depends on the successful passing of exams in the 11th grade. Therefore, great attention should be paid to the preparation for this stage. Preparation for the exam in computer science in 2017 should begin with the study of relevant literature, which includes school textbooks and additional manuals. After getting acquainted with the theory, it is necessary to master the skills of solving problems, adapt to the wording and requirements of the exam.
This will help the Collection of tasks in computer science of the Unified State Examination 2016 under the guidance of E.M. Zorina and M.V. Zorin. The issue includes tasks of various types on all topics of the exam (+ answers to them) and guidelines.
You can also use collections of typical tasks from other authors.
For example: Informatics. Thematic test USE assignments in informatics. Krylov S.S., Ushakov D.M. or computer science. The most complete edition of typical assignments. Ushakov D.M., Yakushkin A.P. These collections were published in 2014, but the structure of the computer science exam has changed slightly, which allows the use of these sources.
Online learning
For thorough preparation for the exam, the Federal Service for Supervision in Education and Science has created a website with an open bank of tasks. This resource contains information related to the exam: regulations, demos, manuals, specifications, codifiers. The open bank FIPI (fipi.ru) allows you to find your “weak points” and work them out, pulling up both theory and practice. In addition, a meeting room is organized on the site to ask questions, tui or otherwise related to the Unified State Examination and the OGE.
On the site you can download and demo versions of any subject. The purpose of the demo is to enable USE participants and the general public to get acquainted with the structure of the future exam, with the number and wording of tasks, here are the answers to them and an analysis of the assessment criteria.
To assess the quality of preparation of schoolchildren for the upcoming exams, online tests and mock exams are organized. An online test is a real-time examination on the Internet. After passing, you can see your results, as well as parse the correct answers. Online testing can also be used as a method of self-control after studying a specific topic. Trial exams are organized in schools 1-2 times a year. This helps future students get used mentally to the exam environment, sort out organizational issues, learn how to allocate time so that it is enough to complete all tasks and check them.
Psychological preparation for the exam is also important. In a stressful situation, it can be quite difficult to discard the excitement and remember everything that has been taught for 11 years. It is necessary to mentally set yourself up for a “working wave”, step back from the outside world and try to look at tasks with a sober mind. And to achieve this is not so easy. Firstly, because the USE is the first serious exam in a student's life. Secondly, the immediate future of the applicant (admission or not admission to the desired university) depends on its results. Thirdly, because often the close relatives of the student, his family, behave rudely and carelessly towards the child himself, further shaking the already alarmed nervous system of the future student.
Statistics for passing the exam in computer science for the past years
According to Rosobnadzor, in 2013 USE year in computer science, only 5% of graduates passed, in 2015 - 4% (7% of them received an unsatisfactory grade) . Today, this subject is gaining popularity. In 2016, about 7% of graduates passed the USE in informatics and ICT, which is 55,000 students.
Exam Schedule
Foxford Online Learning Center 53 videos
The analyzes are conducted by Timofey Khiryanov, lecturer at 100EGE.ru, lecturer at the Department of Informatics of the Moscow Institute of Physics and Technology, developer of the system software Samsung Electronics and Parallels.
Reminders:| Memo "Fundamentals of programming in Pascal" |
Contains the necessary minimum information for students in grades 8-11, which they may need when studying given language programming. It contains information about overall structure programs and basic operators of a given programming language. Also in the memo are examples of recording some typical algorithms, the study and memorization of which can cause difficulties for students. Ready-made code examples will allow students to understand the use of certain structures and operators. When studying a particular topic, it is enough to open the corresponding page and look at both schematic and specific examples of the algorithm code. |
| Memo "Hot keys Windows 10" | The Windows 10 Hotkeys guide contains the most useful Windows 10 hotkeys that will be useful to all users without exception. |
| Memo "Fundamentals of Formal Logic in Computer Science" | The memo "Fundamentals of Formal Logic in Computer Science" contains the necessary minimum information for students in grade 8, which they may need when studying the elements of the algebra of logic. For students in grades 9-11, this memo will be useful while studying the basics of algorithmization and programming, spreadsheets and databases. When preparing, it is enough for the student to open the corresponding page of the memo containing the law, definition or logical operation he needs. |
| Memo "Basics of the HTML markup language" | The Basics of the HTML Markup Language memo describes the basic tags for creating and editing HTML documents. |
| Memo on computer science "Quick text formatting" | The "Quick Text Formatting" worksheet shows the basic keyboard shortcuts for quickly changing text. |
| Memo "Operations on text fragments" | Many years of experience in school, analysis of the literature on pedagogy and psychology led to the conclusion that one of effective means organizations independent activity students in the process of learning and developing skills of constant updating of knowledge are memos. This memo describes how to select, paste, copy, cut, delete, and move pieces of text. It will greatly facilitate the work of students both in the classroom and when preparing at home. |
| Memo for students "Keyboard combinations for working in a text editor" | It's no secret that the ability to use hot keys significantly speeds up the work at the computer. The "Keyboard combinations for working in a text editor" memo will help students improve their practical skills in working in a text editor and successfully memorize keyboard shortcuts. The memo is presented in two versions: for color and black and white printing. |
Option No. 2385663
Unified State Examination - 2017. Early wave in informatics
When completing tasks with a short answer, enter in the answer field the number that corresponds to the number of the correct answer, or a number, a word, a sequence of letters (words) or numbers. The answer should be written without spaces or any additional characters. Separate the fractional part from the whole decimal point. Units of measurement are not required.
If the option is set by the teacher, you can enter or upload answers to the tasks with a detailed answer into the system. The teacher will see the results of the short answer assignments and will be able to grade the uploaded answers to the long answer assignments. The points given by the teacher will be displayed in your statistics.
Version for printing and copying in MS Word
How many natural numbers x exist that satisfy the inequality 10110111 2 In your answer, indicate only the number of numbers, you do not need to write the numbers themselves.
Answer:
Boolean function F given by the expression x ∧ ¬ y ∧ (¬ z ∨ w). The figure shows a fragment of the truth table of the function F, containing all sets of arguments for which the function F true. Determine which column of the truth table of the function F corresponds to each of the variables w, x, y, z.
| Variable one | Variable 2 | Variable 3 | Variable four | Function |
|---|---|---|---|---|
| ??? | ??? | ??? | ??? | F |
| 1 | 0 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 0 | 1 | 1 | 1 |
Write the letters in your answer. w, x, y, z in the order in which the columns corresponding to them go (first - the letter corresponding to the first column; then - the letter corresponding to the second column, etc.) Write the letters in the answer in a row, you do not need to put any separators between the letters.
Example. If the function were given by the expression ¬ x ∨ y depending on two variables: x and y, and a fragment of its truth table was given, containing all sets of arguments for which the function F true.
| Variable one | Variable 2 | Function |
|---|---|---|
| ??? | ??? | F |
| 0 | 0 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
Then the first column would correspond to the variable y, and the second column - a variable x. The answer should have been: yx.
Answer:
In the figure on the right, the road map of the N-sky district is shown as a graph; the table on the left contains information about the length of each of these roads (in kilometers).
| P1 | P2 | P3 | P4 | P5 | P6 | P7 | |
| P1 | 20 | 15 | 10 | 8 | 9 | ||
| P2 | 20 | 11 | 25 | ||||
| P3 | 5 | ||||||
| P4 | 15 | 11 | |||||
| P5 | 10 | 5 | 7 | 6 | |||
| P6 | 8 | 25 | 7 | ||||
| P7 | 9 | 6 |
Since the table and the diagram were drawn independently of each other, the numbering settlements in the table is not related to letters on the graph. Determine the length of the road from point D to point E. In your answer, write down an integer - as it is indicated in the table.
Answer:
Below are two tables from the database. Each line of table 2 contains information about the child and one of his ro-di-te-lei. In-for-ma-tion of the representation of the value of the ID field in accordance with the line of the table 1. Determining whether -those on the basis of the given data total number do-che-ray and granddaughter at Baurn A.S.
|
|
Answer:
To encode a raster pattern printed using six colors, a non-uniform binary code was used. Code words are used to encode colors.
Specify the shortest codeword to encode of blue color, under which the code will satisfy the Fano condition. If there are several such codes, indicate the code with the smallest numerical value.
Note. The Fano condition means that no code word is the beginning of another code word. This enables unambiguous decryption of encoded messages.
Answer:
The performer Calculator has two teams that are assigned numbers:
1. add 2,
2. multiply by 5.
When performing the first of them, the Calculator adds 2 to the number on the screen, and when performing the second, it multiplies it by 5.
For example, program 2121 is program
multiply by 5
add 2,
multiply by 5
add 2,
which converts the number 2 to the number 62.
Write the order of commands in a program that converts the number 1 to the number 45 and contains no more than four commands. Specify only command numbers. If there is more than one such program, then write down any of them.
Answer:
A fragment of an electronic table is given.
| A | B | C | |
|---|---|---|---|
| 1 | 3 | 10 | |
| 2 | =(A1-3)/(B1+3) | =(A1-2)/(C1-3) | = C1/(A1 – 4) |
What integer should be for-pi-sa-but in cell A1, so that the chart, built on the values of the cells of the dia-pa-zo-on A2: C2, co-ot-st-wa-la ri-sun-ku? From the West, but that all the values of the cells from the race-smat-ri-va-e-mo-go dia-pa-zo-on not-from-ri-tsa-tel-na.
Answer:
Write down the number that will be printed as a result of the following program. For your convenience, the program is presented in five programming languages.
Answer:
The musical fragment was digitized and recorded as a file without the use of data compression. The resulting file was transmitted to city A over a communication channel in 15 seconds. Then the same musical fragment was re-digitized with a resolution 2 times higher and a sampling rate 1.5 times lower than the first time. Data compression was not performed. The resulting file was transferred to city B; the throughput of the communication channel with city B is 2 times higher than the communication channel with city A. How many seconds did the file transfer to city B take? In the answer, write down only an integer, you do not need to write a unit of measure.
Answer:
Vasya makes up 4-letter words, in which only the letters Zh, I, R, A, F can be, and the letter R is used in each word exactly 1 time. Each of the other valid letters can occur any number of times in the word, or not at all. A word is any valid sequence of letters, not necessarily meaningful. How many words are there that Vasya can write?
Answer:
Below, a recursive function (procedure) F is written in five programming languages.
What will the program output when calling F(5)? In your answer, write down the sequence of the displayed numbers together (without spaces).
Answer:
In TCP/IP networking terminology, a netmask is a binary number that determines which part of a host's IP address refers to the network address, and which part refers to the address of the host itself on that network. Usually, the mask is written according to the same rules as the IP address - in the form of four bytes, with each byte written as decimal number. At the same time, in the mask, first (in the highest digits) there are ones, and then from a certain digit - zeros. The network address is obtained by applying a bitwise conjunction to the given host IP address and mask.
For example, if the host IP address is 231.32.255.131 and the mask is 255.255.240.0, then the network address is 231.32.240.0. For a host with an IP address of 147.192.92.64, the network address is 147.192.80.0. What is the value of the third byte from the left of the mask? Write your answer as a decimal number.
Answer:
When registering in a computer-p-ter-noy si-ste-me, each user is given a password consisting of 15 sims -in-catching and containing only symbols from the 12-character-free-on-bo-ra: A, B, C, D, E, F, G, H, K, L, M, N. In the database, for storing information about each user, from-ve-de-but-on- co-th and mi-ni-mal-but possible integer number of bytes. At the same time, they use the symbol-free ko-di-ro-va-nie pa-ro-lei, all the sym-vo-ly ko-di-ru-ut one-on-ko- vym and mi-no-small-but-possible number of bits. In addition to own-but pa-ro-la, for each pol-zo-va-te-la in the si-ste-me, up to half-no-tel-nye-de -niya, for which from-ve-de-but 12 bytes per one-no-pol-zo-va-te-la.
Define-de-li-those volume of pa-me-ty (in bytes), not-about-ho-di-my for storing information about 100 use-so-va-te- lyakh. In the answer, for-pi-shi-those, only an integer - the number of bytes.
Answer:
Si-ste-ma co-mand is-pol-ni-te-la ROBOT, “zhi-woo-shche-go” in a rectangular la-bi-rin-te on a cell-cha-toy flat -ko-sti, includes 4 ko-man-dy-at-ka-za
and 4 teams of pro-verifier conditions.
Ko-man-dy-pri-ka-zy:
When you-complete-not-nii any of these commands, the ROBOT re-re-me-scha-is-sya one-cell-correspondingly: up, down ↓, left ←, right -in →. If the ROBOT starts moving in a hundred-ro-well on-ho-dya-shchey next to the walls,
then it collapses, and the program will be interrupted.
Other 4 teams check the truth of the conditions from the presence of a wall on each side of the cell where it is -sya ROBOT:
BYE condition
after-before-va-tel-ness of commands
END OF CYCLE
you-half-nya-et-sya, while the condition is true-tin-but.
In construction
IF condition
THEN co-man-da1
OTHERWISE co-man-da2
END IF
performed co-man-da1(if the condition is true) or co-man-da2(if the condition is false). As conditions in the constructions of the WHILE and IF to-start-ka-yut-the above elementary conditions and their combo-bi-on-tion with the help of the so-y-call AND and OR.
How many cell-tok la-bi-rin-ta correspond-from-vet-stu-yut tre-bo-va-niyu that, you-half-niv pre-lo-wife-pro-gram, ROBOT survives and ends up in a red-painted cell (cell A1)?
WHILE the left is free OR the top is free
IF over-hu free-bod-but
ELSE to the left
END IF
END BYE
Answer:
The figure shows a diagram of roads connecting cities A, B, C, D, D, E, G, H, I, K, L, M.
On each road, you can only move in one direction, indicated by the arrow.
How many different routes are there from city A to city M passing through city B?
Answer:
The value of the arith-me-ti-che-th-you-ra-zhe-niya: 125 + 25 3 + 5 9 - for-pi-sa-li in the numeral system with os-no-va-ni-em 5. How many significant zeros does this entry contain?
Answer:
In the language of pro-owls in the-is-to-the-server-ve-ra, to designate the logical operation "OR" use-use- there is a symbol "|", and for denoting the logical operation "AND" - the symbol "&".
In the table, with-ve-de-us for-pro-sy and the number of pages found on them of not-something-ro-go seg-men-ta network Inter-ter-no.
What number of pages (in ty-sya-chah) will be found-de-but for-pro-su Bio-logia & Physi-ka & Chemistry?
Consider that all for-pro-sy you-full-were practically-ti-che-ski one-but-time-men-but, so a set of pages, co-der- zha-shih all the right words, didn’t change during the time you-half-not-for-pro-owls.
Answer:
Two segments are given on the number line: P = and Q = . Find the smallest possible length of segment A such that the formula
(x P) → (((x Q) ∧ ¬(x A)) → ¬(x P))
is true for any value of the variable x, i.e. takes the value 1 for any value of the variable x.
Answer:
In the program, use one-dimensional integer array A with index from 0 to 10. Below -stav-len for-pi-san-ny in different languages pro-gram-mi-ro-va-niya fragment of this program-we.
In na-cha-le you-half-not-of this fragment-men-ta in mass-si-ve on-ho-di-lis the numbers 27, 17, 7, 0, 7, 17, 27, 17, 10 , 7, 0, i.e. A = 27, A = 17, etc. we?
Answer:
Below, in five languages, pro-gram-mi-ro-va-niya za-pi-san al-go-rhythm. Having received the number x at the input, this al-go-rhythm prints two numbers: L and M. Indicate the largest number x, when entering something -go al-go-rhythm pe-cha-ta-em sleep-cha-la 3 and then 5
Answer:
Write in your answer a number equal to the number of different values of the input variable k, for which the following program produces the same answer as for the input value k = 25. The value k = 25 is also included in the calculation of the number of different values of k. For your convenience, the program is presented in five programming languages.
Answer:
Artist Plus converts the number on the screen.
The performer has two teams that are assigned numbers:
1. Add 2
2. Add 5
The first command increases the number on the screen by 2, the second increases this number by 5. The program for the Plus executor is a sequence of commands.
How many programs exist that convert the number 1 to the number 20?
Answer:
How many different sets of boolean values are there x 1 , x 2 , … x 7 , y 1 , y 2 , … y 7 that satisfy all of the following conditions?
(x 1 ∧ y 1) ≡ (¬x2 ∨ ¬y2)
(x 2 ∧ y 2) ≡ (¬x3 ∨ ¬y3)
(x 6 ∧ y 6) ≡ (¬x7 ∨ ¬y7)
The answer does not need to list all the different sets of variable values x 1 , x 2 , … x 7 , y 1 , y 2 , … y 7 , under which this system of equalities holds. As an answer, you need to indicate the number of such sets.
Answer:
Submitting for processing natural number, not exceeding 10 9 . You need to write a program that displays the sum of the digits of a number that is NOT a multiple of 3. If the number does not contain digits that are not a multiple of 3, you need to display "NO" on the screen. The programmer wrote the program incorrectly. Below this program for your convenience is given in five programming languages.
Reminder: 0 is divisible by any natural number.
| BASIC | Python |
|---|---|
DIM N, DIGIT, SUM AS LONG DIGIT=NMOD 10 IF DIGIT MOD 3 > 0 THEN | N = int(input()) if digit % 3 > 0: |
| Pascal | Algorithmic language |
var N, digit, sum: longint; digit:= N mod 10; if digit mod 3 > 0 then | integer N, digit, sum nc while N > 0 digit:= mod(N,10) if mod(digit, 3) > 0 then if sum > 0 then |
| C++ | |
#include using namespace std; int N, digit, sum; if (digit % 3 > 0) |
|
Do the following in sequence.
1. Write what this program will display when you enter the number 645.
2. Give an example of such a three-digit number, when entered, the program gives the correct answer.
3. Find all errors in this program (there may be one or more). It is known that each error affects only one line and can be fixed without changing other lines. For each error:
1) write out the line where the error was made;
2) indicate how to fix the error, i.e. give the correct version of the string.
It is enough to indicate the errors and the way to correct them for one programming language.
Please note that you need to find errors in the existing program, and not write your own, possibly using a different solution algorithm. Correcting a bug should only affect the line that contains the bug.
An integer array of 20 elements is given. Elements of ma-si-va can take integer values from 0 to 10,000 inclusive. Describe in a natural language or in one of the languages \u200b\u200bpro-gram-mi-ro-va-niya al-go-rhythm, pos-in-la-yu-shchy to find and you-ve -sti number of pairs of elements of mass-si-va, in some way both numbers are even. In this za-da-che, under a pair of sub-ra-zu-me-va-et-sya, there are two consecutive elements-men-ta mas-si-va.
For example, for a mass of five elements: 6; one; four; 6; 10 - answer: 2. Outgoing data declarations, as in-for-but below in the examples for some languages about -gram-mi-ro-va-nia and natural language. For-pre-shcha-et-sya use re-re-men-nye, do not describe below, but raz-re-sha-et-sya do not use not-something from the described-san-nyh-re-men-nyh.
| Bei-sik | Python |
|---|---|
CONST N AS INTEGER = 20 DIM A (1 TO N) AS INTEGER DIM I AS INTEGER, | # to-pus-ka-et-sya also # use two # integer-numbers-re-changes j and k for i in range(0, n): a.append(int(input())) |
| Pascal | Al-go-rit-mi-che-sky language |
a: array of integers; i, j, k: integer; for i:= 1 to N do | target-tab a nc for i from 1 to N |
| C++ | Natural language |
#include using namespace std; for (i = 0; i cin >> a[i]; | Declaring an array A of 20 elements. Announcement of integer-number-re-men I, J, K. In a cycle from 1 to 20, enter the elements of mass-si-va A from 1st to 20th. |
In the capacity of from-ve-ta, you don’t-about-ho-di-mo give you a fragment of the program (or describe-sa-tion of al-go-rit-ma on the ground -stven-nom language), someone should-wife-to-go-dit-sya in the place of a lot of things. You can write the solution also in another language of the program-mi-ro-va-nia (indicate the name and use e-muy version of the pro-gram-mi-ro-va-nia language, for example, Free Pascal 2.6) or in the form of a flowchart. In this case, you must use the same source data and variables that were pre- sent in the condition ( for example, in sample, for-pi-san-nom in natural language).
Solutions to tasks with a detailed answer are not checked automatically.
On the next page, you will be asked to check them yourself.
Two players, Petya and Vanya, play the following game. There is a pile of stones in front of the players. Players move in turn, Petya makes the first move. In one move, the player can add one stone to the pile or double the number of stones in the pile. For example, having a pile of 15 stones, in one move you can get a pile of 16 or 30 stones. Each player has an unlimited number of stones to make moves.
The game ends when the number of stones in the pile becomes at least 65. The winner is the player who made the last move, i.e. the first to receive a pile containing 65 or more stones. At the initial moment, the heap had S stones 1 ≤ S ≤ 64.
We will say that a player has a winning strategy if he can win for any moves of the opponent. To describe a player's strategy means to describe what move he should make in any situation that he may encounter with different opponent's play.
Complete the following tasks. In all cases, justify your answer.
Exercise 1
a) Indicate all such values of the number S for which Petya can win in one move, and the corresponding winning moves. If, for some value of S, Petya can win in several ways, it suffices to indicate one winning move.
b) Indicate a value of S for which Petya cannot win in one move, but for any move by Petya Vanya can win with his first move. Describe Vanya's winning strategy.
Task 2
Indicate two such values of S for which Petya has a winning
strategy, and two conditions are simultaneously met:
– Petya cannot win in one move;
– Petya can win with his second move, regardless of how Vanya moves.
For each given value of S, describe Petya's winning strategy.
Task 3
Specify the value of S at which:
– Vanya has a winning strategy that allows him to win on the first or second move in any game of Petya;
– Vanya does not have a strategy that will allow him to win on the first move.
For the given value of S, describe Vanya's winning strategy.
Construct a tree of all games possible with Vanya's winning strategy (in the form of a figure or a table). Indicate moves on the edges of the tree, and positions in the nodes.
Solutions to tasks with a detailed answer are not checked automatically.
On the next page, you will be asked to check them yourself.
The Voskhod satellite is equipped with an instrument designed to measure solar activity. During the experiment (this time is known in advance), every minute the device transmits to the observatory via a communication channel a positive integer not exceeding 1000 - the amount of solar radiation energy received in the last minute, measured in arbitrary units.
After the end of the experiment, the control value is transmitted - largest number R that satisfies the following conditions:
1) R - the product of two numbers transmitted at different minutes;
2) R is divisible by 26.
It is assumed that a satisfying control value existed at the time of transmission.
As a result of transmission noise, both the numbers themselves and the reference value can be distorted.
Write a time- and memory-efficient program (specify the version of the programming language you are using, eg Free Pascal 2.6.4) that checks if the control value is correct. The program is considered efficient in time if the running time of the program is proportional to the number of received instrument readings N, i.e. when N increases by k times, the running time of the program should increase by no more than k times. A program is considered memory efficient if the size of the memory used in the program for storing data does not depend on the number N and does not exceed 1 kilobyte.
The program should print a report in the following form.
Calculated control value: ...
Control Passed (or Control Failed)
If a valid control value cannot be determined, then only the phrase "Control failed" is displayed. Before the text of the program, briefly describe the solution algorithm you use.
The number of numbers N ≤ 100 000 is given as input to the program in the first line. Each of the following N lines contains one positive integer not exceeding 1000. The last line contains a control value.
Input example:
Example output for the example input above:
Computed control value: 2860
Control passed
Solutions to tasks with a detailed answer are not checked automatically.
On the next page, you will be asked to check them yourself.
Finish testing, check answers, see solutions.
