New exam options in computer science. How to solve exam tasks in computer science
The total number of participants in the main period of the exam this year is more than 67 thousand people. This number has increased significantly compared to 2017, when 52.8 thousand people took the exam, and compared to 2016 (49.3 thousand people ), which corresponds to the trend towards the development of the digital sector of the economy in the country.
In 2018, compared to 2017, the share of unprepared exam participants slightly increased (by 1.54%) (up to 40 test points). The share of participants with a basic level of training decreased by 2.9% (range from 40 to 60 tb). The group of participants who scored 61-80 tb increased by 3.71%, partly due to a decrease of 2.57% in the share of the group of participants who scored 81-100 tb. Thus, the total share of participants who scored significant points for competitive admission to higher education institutions (61-100 t.b.) increased by 1.05%, despite a decrease in the average test score from 59.2 in 2017 to 58 4 in the current year. Some increase in the proportion of participants who scored high (81-100) test scores is partly due to improved preparation of exam participants, partly to the stability of the examination model
More detailed analytical and methodological materials of the USE 2018 are available at the link.
Our website contains about 3,000 assignments for preparing for the Unified State Examination in Informatics in 2018. The general plan of the examination paper is presented below.
PLAN OF THE EXAMINATION WORK OF THE USE ON INFORMATICS 2019
Designation of the level of difficulty of the task: B - basic, P - advanced, C - high.
Content elements and activities to be checked |
Task difficulty level |
The maximum score for completing the task |
Estimated time to complete the task (min.) |
| Exercise 1. Knowledge of number systems and binary representation of information in computer memory | |||
| Task 2. Ability to build truth tables and logic circuits | |||
| Task 3. | |||
| Task 4. Knowledge of the file system for organizing data or the technology of storing, searching and sorting information in databases | |||
| Task 5. Ability to encode and decode information | |||
| Task 6. Formal execution of an algorithm written in natural language or the ability to create a linear algorithm for a formal executor with a limited set of commands | |||
| Task 7. Knowledge of information processing technology in spreadsheets and data visualization methods using charts and graphs | |||
| Task 8. Knowledge of the basic constructions of the programming language, the concept of a variable, the assignment operator | |||
| 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 | |||
| Task 10. Knowledge of methods for measuring the amount of information | |||
| Task 11. Ability to execute recursive algorithm | |||
| Task 12. Knowledge of the basic principles of the organization and functioning of computer networks, network addressing | |||
| Task 13. The ability to calculate the information volume of the message | Task 14. The ability to execute an algorithm for a specific performer with a fixed set of commands | ||
| Task 15. Ability to represent and read data in different types of information models (diagrams, maps, tables, graphs and formulas) | |||
| Task 16. Knowledge of positional number systems | |||
| Task 17. Ability to search for information on the Internet | |||
| Task 18. Knowledge of the basic concepts and laws of mathematical logic | |||
| Task 19. Working with arrays (filling, reading, searching, sorting, mass operations, etc.) | |||
| Task 20. Analysis of an algorithm containing a loop and branching | |||
| Task 21. Ability to analyze a program using procedures and functions | |||
| Task 22. Ability to analyze the result of the execution of the algorithm | |||
| Task 23. Ability to build and transform logical expressions | |||
| Task 24 (C1). Ability to read a fragment of a program in a programming language and correct errors | |||
| Task 25 (C2). Ability to compose an algorithm and write it as a simple program (10–15 lines) in a programming language | |||
| Task 26 (C3). Ability to build a game tree according to a given algorithm and justify a winning strategy | |||
| Task 27 (C4). Ability to create own programs (30–50 lines) for solving problems of medium complexity |
Correspondence between the minimum primary scores and the minimum test scores of 2019. Order on amendments to Appendix No. 1 to the order of the Federal Service for Supervision in Education and Science. .
OFFICIAL SCALE 2019
THRESHOLD SCORE
By order of Rosobrnadzor, a minimum number of points is established, confirming the mastering of the main general educational programs of secondary (complete) general education by the participants in the exams in accordance with the requirements of the federal state educational standard of secondary (complete) general education. THRESHOLD IN COMPUTER SCIENCE AND ICT: 6 primary points (40 test points).
EXAM FORMS
You can download high quality forms from
The unified state exam in informatics consists of 27 tasks. Each task is devoted to one of the topics studied in the framework of the school curriculum. Computer science is a core subject, so only those students who need it in the future take it. Here you can learn how to solve USE tasks in computer science, as well as study examples and solutions based on detailed tasks.
All USE tasks all tasks (107) USE task 1 (19) USE task 3 (2) USE task 4 (11) USE task 5 (10) USE task 6 (7) USE task 7 (3) USE task 9 (5) USE task 10 (7) USE task 11 (1) USE task 12 (3) USE task 13 (7) USE task 16 (19) USE task 17 (4) USE without number (9)
The Quadrator performer has two commands: add 3 and square
The performer Quadrator has two teams, which are assigned numbers: 1 - add 3; 2 - square it. The first of them increases the number on the screen by 3, the second raises it to the second power. The performer works only with natural numbers. Write an algorithm for obtaining number B from number A, containing no more than K commands. In the answer, write down only the numbers of the commands. If there is more than one such algorithm, write down any of them.
Vasya makes up words in which only letters occur
Vasya makes up N-letter words in which only letters A, B, C occur, and the letter A appears 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?
Igor makes a table of code words for message transmission
Igor makes a table of code words for message transmission, each message has its own code word. Igor uses N-letter words as code words, in which there are only letters A, B, C, and the letter A appears exactly 1 time. Each of the other valid letters may occur any number of times in the codeword, or not at all. How many different code words can Igor use?
The task is included in the exam in computer science for grade 11 at number 10.
Algorithm for calculating the value of the function F(n)
The algorithm for calculating the value of the function F(n), where n is a natural number, is given by the following relations. What is the value of the function F(K)? Write down only a natural number in your answer.
The task is included in the exam in computer science for grade 11 at number 11.
How many seconds does it take for a modem to send messages
How many seconds does it take for a modem transmitting messages at a rate of N bps to transmit a color bitmap of size AxB pixels, provided that the color of each pixel is encoded in K bits? (Enter only the number on the form.)
The task is included in the exam in computer science for grade 11 at number 9.
The decryptor needs to recover the corrupted message fragment
The decryptor needs to restore the damaged fragment of the message, consisting of 4 characters. There is reliable information that no more than five letters were used (A, B, C, D, E), and one of the symbols is in the third place... One of the letters is in the fourth place... One of the letters is in the first place ... On the second - ... Additional information appeared that one of the four options is possible. Which?
The task is included in the exam in computer science for grade 11 at number 6.
The meteorological station monitors air humidity
The meteorological station monitors air humidity. The result of one measurement is an integer from 0 to 100 percent, which is written using the smallest possible number of bits. The station made N measurements. Determine the information volume of the observation results.
What will the formula look like after the cell is copied
The cell contains a formula. What will the formula look like when cell X is copied into cell Y? Note: The $ sign is used to denote absolute addressing.
The task is included in the exam in computer science for grade 11 at number 7.
Being in the root directory of a newly formatted drive
Being in the root directory of the newly formatted disk, the student created K directories. Then, in each of the created directories, he created another N directories. How many directories were on the disk, including the root?
The task is included in the exam in computer science for grade 11.
Four pieces of paper were found at the crime scene.
Four pieces of paper were found at the crime scene. The investigation found that fragments of one IP address were recorded on them. The forensics labeled these fragments as A, B, C, and D. Retrieve the IP address. In your response, provide a sequence of letters representing the fragments, in the order corresponding to the IP address.
Petya wrote down the IP address of the school server on a piece of paper
Petya wrote down the school server's IP address on a piece of paper and put it in his jacket pocket. Petya's mother accidentally washed the jacket along with the note. After washing, Petya found four scraps with fragments of the IP address in his pocket. These fragments are labeled A, B, C, and D. Restore the IP address. In your response, provide a sequence of letters representing the fragments, in the order corresponding to the IP address.
The task is included in the exam in computer science for grade 11 at number 12.
When registering in a computer system, each user is given a password.
When registering in a computer system, each user is given a password consisting of 15 characters and containing numbers and capital letters. Thus, K different symbols are used. Each such password in a computer system is written in the minimum possible and the same integer number of bytes (in this case, character-by-character encoding is used and all characters are encoded in the same and minimum possible number of bits). Determine the amount of memory allocated by this system for storing N passwords.
The task is included in the exam in computer science for grade 11 at number 13.
In some country, the car number is made up of capital letters
In some country, a car number of length K characters is made up of capital letters (M different letters are used) and any decimal digits. Letters with numbers can follow in any order. Each such number in a computer program is written in the minimum possible and the same integer number of bytes (in this case, character-by-character coding is used and all characters are encoded in the same and minimum possible number of bits). Determine the amount of memory allocated by this program for writing N numbers.
The task is included in the exam in computer science for grade 11 at number 13.
Option No. 3490088
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
Specify the smallest four-digit hexadecimal number whose binary notation contains exactly 5 zeros. In your answer, write down only the hexadecimal number itself, you do not need to indicate the base of the number system.
Answer:
A fragment of the truth table of the expression F is given:
| x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | F |
|---|---|---|---|---|---|---|---|---|
| 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 0 |
| 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 |
Which of the following expressions can be F?
1) (x2→x1) ∧ ¬x3 ∧ x4 ∧ ¬x5 ∧ x6 ∧ ¬x7 ∧ x8
2) (x2→x1) ∨ ¬x3 ∨ x4 ∨ ¬x5 ∨ x6 ∨ ¬x7 ∨ x8
3) ¬(x2→x1) ∨ x3 ∨ ¬x4 ∨ x5 ∨ ¬x6 ∨ x7 ∨ ¬x8
4) (x2→x1) ∧ x3 ∧ ¬x4 ∧ x5 ∧ ¬x6 ∧ x7 ∧ ¬x8
Answer:
Roads were built between settlements A, B, C, D, E, F, the length of which is shown in the table. The absence of a number in the table means that there is no direct road between the points.
| A | B | C | D | E | F | |
| A | 2 | 4 | 8 | 16 | ||
| B | 2 | 3 | ||||
| C | 4 | 3 | ||||
| D | 8 | 3 | 3 | 5 | 3 | |
| E | 5 | 5 | ||||
| F | 16 | 3 | 5 |
Determine the length of the shortest path between points A and F, passing through point E and not passing through point B. You can only move along the indicated roads.
Answer:
For batch operations with files, file name masks are used. The mask is a sequence of letters, numbers, and other characters allowed in file names, which may also contain the following characters:
symbol "?" () question mark means exactly one arbitrary character.
the symbol "*" (asterisk) means any sequence of characters of arbitrary length, including "*" can also specify an empty sequence.
The directory contains 6 files:
Determine which mask will be used to select the specified group of files from the directory:
Answer:
A 5-bit code is used to transmit data over a communication channel. The message contains only the letters A, B and C, which are encoded with the following code words:
A - 11111, B - 00011, C - 00100.
Transmission may be interrupted. However, some errors can be corrected. Any two of these three code words differ from each other in at least three positions. Therefore, if the transmission of a word has an error in no more than one position, then an educated guess can be made about which letter was transmitted. (It is said that “the code corrects one error.”) For example, if codeword 10111 is received, it is considered that the letter A was transmitted. (The difference from the codeword for A is only in one position, there are more differences for the remaining codewords.) If the received codeword word differs from the code words for the letters A, B, C in more than one position, then it is considered that an error has occurred (it is denoted by "x").
Answer:
The automaton receives a four-digit number as input (the number cannot start from zero). Based on this number, a new number is constructed according to the following rules.
1. The first and second, second and third, third and fourth digits of a given number are added separately.
2. The smallest of the received three amounts is removed.
3. The remaining two amounts are written one after the other in non-decreasing order without separators.
Example. Original number: 1984. Sums: 1 + 9 = 10, 9 + 8 = 17, 8 + 4 = 12.
10 is removed. Result: 1217.
Specify least number, upon processing of which the machine produces the result 613.
Answer:
A fragment of a spreadsheet is given.
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 1 | 10 | 100 | 1000 | ||
| 3 | 2 | 20 | 200 | 2000 | ||
| 4 | 3 | 30 | 300 | 3000 | ||
| 5 | 4 | 40 | 400 | 4000 | ||
| 6 | 5 | 50 | 500 | 5000 |
In cell B2, we wrote the formula =D$4 + $F3. After that, cell B2 was copied into cell A3. What number will be shown in cell A3?
Note: The $ sign is used to denote absolute addressing.
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:
Produced four-channel (quad) sound recording with a sampling rate of 32 kHz and 32-bit resolution. The recording lasts 3 minutes, its results are written to a file, data compression is not performed. Determine the approximate size of the resulting file (in MB). Give your answer as the closest integer multiple of five to the file size.
Answer:
The code lock cipher is a sequence of five characters, each of which is a digit from 1 to 5. How many different cipher options can be given if it is known that the digit 1 occurs exactly three times, and each of the other valid digits can occur in the cipher any number once or not meet at all?
Answer:
Below, a recursive algorithm is written in five programming languages F.
As an answer, indicate the sequence of digits that will be printed on the screen as a result of calling F(5).
Answer:
In the terminology of TCP / IP networks, a subnet mask is a 32-bit binary number that determines which bits of the computer's IP address are common to the entire subnet - there is a 1 in these bits of the mask. Usually masks are written as four decimal numbers - according to the same rules as well as IP addresses. For some subnet, the mask is 255.255.248.0. How many different computer addresses does this mask allow?
Note. In practice, two addresses are not used to address computers: the network address and the broadcast address.
Answer:
The car number consists of several letters (the number of letters is the same in all numbers), followed by 4 digits. This uses 10 numbers and only 5 letters: P, O, M, A, N. You need to have at least 1,000,000 different numbers. What is the minimum number of letters that should be in a car number?
Answer:
The performer CAR "lives" in a limited rectangular labyrinth on a checkered plane, shown in the figure. Gray cells - erected walls, light - free cells, on which the CAR can move freely. Along the edge of the maze field there is also an erected wall with numbers and letters applied to identify the cells in the maze.
Command system of the executor MACHINKA:
When any of these commands is executed, the CAR moves one cell respectively (in relation to the observer): up, down ↓, left ←, right →.
Four commands check the truth of the condition of the absence of a wall on each side of the cell where the CAR is located (also in relation to the observer):
BYE<условие>team
is executed while the condition is true, otherwise it moves to the next line.
When you try to move to any gray cell, the CAR crashes against the wall.
How many cells of the given labyrinth correspond to the requirement that, having started in it and executing the program proposed below, the MACHINE will not crash?
BYE<снизу свободно>down
BYE<слева свободно>to the left
Answer:
The figure shows a diagram of roads connecting cities A, B, C, D, D, E, K, L, M, N, P, R, T. You can move along each road only in one direction, indicated by the arrow.
How many different ways are there from city A to city T?
Answer:
In the base number system N the record of the number 87 10 ends with 2 and contains no more than two digits. List all applicable values separated by commas in ascending order N.
Answer:
In the search engine query language, the symbol "|" is used to indicate the logical operation "OR", and the symbol "&" is used for the logical operation "AND".
The table shows queries and the number of pages found by them for a certain segment of the Internet.
| Request | Pages found (in thousands) |
|---|---|
| France & Germany | 274 |
| Germany & (France | Austria) | 467 |
| France & Germany & Austria | 104 |
How many pages (in thousands) will be found for the query Germany & Austria?
It is assumed that all requests were executed almost simultaneously, so that the set of pages containing all the searched words did not change during the execution of the requests.
Answer:
Denote by m&n the bitwise conjunction of non-negative integers m And n.
So, for example, 14&5 = 1110 2 &0101 2 = 0100 2 = 4.
For what is the smallest non-negative integer A the formula
x&51 = 0 ∨ (x&41 = 0 → x&A = 0)
is identically true (i.e., takes the value 1 for any non-negative integer value of the variable x)?
Answer:
Below is a fragment of the same program written in different programming languages. The program describes a one-dimensional integer array A; in the presented fragment, array elements with indices from 1 to 10 are processed.
Before starting the program, these array elements had the values 0, 1, 2, 3, 4, 5, 4, 3, 2, 1 (i.e. A = 0; A = 1; ...; A = 1).
Which of these array elements will have the largest value after the execution of the program fragment? In your answer, indicate the index of the element - a number from 1 to 10.
Answer:
The algorithm is written in five languages below. Having received the number x as input, this algorithm prints two numbers: a and b. Specify the smallest of such numbers x, when entered, the algorithm prints first 3, and then 12.
Answer:
Write in your answer the largest value of the input variable k, at which the program produces the same answer as with the input value k= 20. For your convenience, the program is presented in five programming languages.
Answer:
The Calculator executor has two commands:
1. add 4,
2. subtract 2.
The first of them increases the number on the screen by 4, the second - reduces it by 2. If a negative number appears during the calculation, it fails and erases what is written on the screen. A calculator program is a sequence of commands. How many different numbers can be obtained from the number 8 using a program that contains exactly 16 commands?
Answer:
How many different sets of values of boolean variables x1, x2, x3, x4, x5, x6, x7, x8, x9, x10 are there that satisfy all of the following conditions:
((x1 → x2) → (x3 → x4)) ∧ ((x3 → x4) → (x5 → x6)) = 1;
((x5 → x6) → (x7 → x8)) ∧ ((x7 → x8) → (x9 → x10)) = 1;
x1∧x3∧x5∧x7∧x9 = 1.
The answer does not need to list all the different sets of values of the variables x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, under which the given system of equalities is satisfied. As an answer, you need to indicate the number of such sets.
Answer:
It was necessary to write a program that enters from the keyboard the coordinates of a point on a plane ( x, y are real numbers) and determines whether a point belongs to the shaded area. The programmer was in a hurry and wrote the program incorrectly.
Do the following in sequence:
1. Redraw and complete the table that shows how the program works with arguments belonging to different areas (A, B, C, D, E, F, G, and H).
Points lying on the boundaries of the regions are not considered separately. In the condition columns, enter "yes" if the condition is met, "no" if the condition is not met, "-" (dash) if the condition will not be checked, "not known" if the program behaves differently for different values belonging to this area. In the "Program will output" column, specify what the program will display on the screen. If the program does not display anything, write "-" (dash). If different texts are displayed for different values belonging to the area, write "not known". Enter "yes" or "no" in the last column.
2. Indicate how the program needs to be improved so that there are no cases of its incorrect operation. (This can be done in several ways, just specify any way to refine the original program.)
| Region | Condition 1 (y >= −x*x) | Condition 2 (y >= −x−2) | Condition 3 | The program will output |
Lada Esakova
When a student of grade 11 begins to prepare for the exam in computer science, as a rule, he prepares from scratch. This is one of the differences between the exam in computer science and exams in other subjects.
In mathematics, the knowledge of a high school student is definitely not zero. In Russian, even more so.
But in computer science, the situation is much more complicated. What is studied at school in the classroom has nothing to do with the preparation program for the exam in computer science.
What is the USE in Informatics?
The USE control test in computer science contains 27 tasks, which relate to a variety of topics. These are number systems, this is Boolean algebra, algorithmics, this is programming, modeling, elements of graph theory.
The USE in Informatics covers a very wide range of information. Of course, the exam will only need the basics, but these are the basics of important and modern topics.
Preparing for the Unified State Exam in computer science from scratch implies that the student did not study any of these topics at school. Usually it is!
For example, such a topic as Boolean algebra, or the algebra of logic, is included in the exam in computer science. But it is not studied in schools, even in specialized ones. She is neither in the course of school computer science, nor in the course of mathematics. The student has no idea!
And therefore, almost none of the students solves the famous problem on systems of logical equations. This task in the Unified State Examination in Informatics is number 23. Let's say more - teachers often recommend that high school students not try to solve this problem at all, and not even look at it, so as not to waste time.
Does this mean that task 23 from the Unified State Examination in Informatics is not solved at all? Of course not! Our students regularly solve it every year. In our course of preparation for the Unified State Examination in Informatics, from many topics, we take only what is required for the exam. And we pay maximum attention to these tasks.
Why does the school not prepare for the exam in computer science?
This is due to the fact that computer science is not a compulsory subject. The Ministry of Education does not provide any standards and programs. Therefore, teachers at computer science lessons give schoolchildren completely different material - who can do what. Moreover, in some schools there are no computer science lessons at all.
What do high school students usually do in computer science classes? Do they play shooting games?
Fortunately, at school, in computer science lessons, schoolchildren are still doing not nonsense, but quite useful things. For example, they study Word and Escel. In life, this will come in handy, but, unfortunately, it is absolutely useless for passing the exam.
Moreover, the guys study Word at a serious level, and some even pass exams in computer layout and receive a certificate of a typesetter. Some schools teach 3D modeling. A lot of schools give web design. This is a wonderful topic, useful in the future, but it has absolutely nothing to do with the exam! And coming to our courses, the student really prepares for the exam in computer science from scratch.
A similar situation is with high school students of specialized lyceums. Strong profile lyceums honestly teach programming in computer science lessons. The guys come out of there as good programmers. But after all, in the USE in computer science, only 5 tasks are somehow related to programming, and of them exactly one task in the USE version is devoted to writing a program! The result is a maximum of 6 tasks for the exam in computer science.
How much time does it take to prepare for the exam in computer science from scratch?
There is good news! You can prepare for the exam in computer science from scratch in one year. It's not easy, but it's possible, and our students prove it every year. The course of preparation for the exam in computer science is not very big. You can take courses once a week for 2 hours. Of course, you need to actively do your homework.
But there is one amendment. If a student has never done programming before grade 11, it is hardly possible to fully master programming in a year. Therefore, task No. 27 of the USE variant in computer science will remain unsolved. She is the most difficult.
It is especially difficult to prepare for the exam in computer science from scratch for those students who have never been familiar with programming at all and do not know what it is. This area is quite specific, so programming training needs to be given a lot of time and solve a huge number of tasks.
In our courses, we make sure to analyze all the typical programming tasks. And not once during the exam did the programming problem come as a surprise to our students - they were all sorted out during the courses. And only task 27 is left out for those who did not do programming at all until the 11th grade.
Coming to our computer science courses, students and parents are sometimes surprised not to see computers in the classroom. They think that since they came to prepare for the exam in computer science, then there should be computers on the tables. But they are not! To what extent is it necessary to have laptops and computers when preparing for the exam in computer science?
This is a feature of the exam in computer science. There will be no computer for the exam! And yes, it will be necessary to solve tasks with a pen on a sheet of paper, because it is in this format that the Unified State Examination in Informatics is now taking place. This is a real problem for those who rent it.
Even high school students from specialized lyceums, who are good at programming, may be helpless at the exam in computer science. They, of course, program on computers, that is, in a special environment. But what happens when there is no computer? And not only schoolchildren - even professional programmers can write a program on paper with great difficulty. Therefore, we are preparing for such a complex format right away. We deliberately do not use computers and laptops when preparing for the Unified State Exam in computer science - according to the rule "It is hard in learning, easy in battle."
For several years now, there have been rumors that the Unified State Exam in computer science will be transferred to a computer form. They promised to do it in 2017, but they didn't. Will they do it in 2018? We don't know yet. If such an exam format is introduced, it will be much easier to prepare for the exam in computer science from scratch.
So, a year of active preparation for the exam in computer science from scratch, and your result is 26 tasks out of 27 possible. And if you are at least a little familiar with programming, then all 27 out of 27. We wish you to achieve such a result in the exam!
And once again I recommend for the preparation of theoretical material and my book "Computer science. Author's course of preparation for the exam " where the practice of problem solving is given.
Tell your friends!
Which programming language to choose, what tasks to focus on and how to allocate time on the exam
Teaches computer science at Foxford.
Different universities require different entrance exams in IT areas. Somewhere you need to take physics, somewhere - computer science. It is up to you to decide which exam to prepare for, but it should be borne in mind that the competition for specialties where physics must be taken is usually lower than in specialties where the Unified State Examination in computer science is required, i.e. the probability of entering "through physics" is greater.
Why then take the exam in computer science?
- It is faster and easier to prepare for it than for physics.
- You will be able to choose from more specialties.
- It will be easier for you to study in the chosen specialty.
What you need to know about the exam in computer science
The exam in computer science consists of two parts. In the first part there are 23 problems with a short answer, in the second - 4 problems with a detailed answer. The first part of the exam has 12 basic level items, 10 advanced level items and 1 high level item. In the second part - 1 task of an increased level and 3 - high.
Solving problems from the first part allows you to score 23 primary points - one point for the completed task. Solving problems in the second part adds 12 primary points (3, 2, 3 and 4 points for each problem, respectively). Thus, the maximum primary points that can be obtained for solving all tasks is 35.
Primary scores are converted into test scores, which are the result of the exam. 35 primary points = 100 test points per exam. At the same time, more test points are awarded for solving problems from the second part of the exam than for answers to the problems of the first part. Each primary score obtained on the second part of the exam will give you 3 or 4 test scores, which in total is about 40 final scores for the exam.
This means that when performing the exam in computer science, it is necessary to pay special attention to solving problems with a detailed answer: No. 24, 25, 26 and 27. Their successful completion will allow you to score more final points. But the price of a mistake during their implementation is higher - the loss of each primary score is fraught with the fact that you will not pass the competition, because 3-4 final scores for the Unified State Examination with high competition in IT specialties can become decisive.
How to prepare for solving problems from the first part
- Pay special attention to tasks No. 9, 10, 11, 12, 15, 18, 20, 23. It is these tasks, according to the analysis of the results of past years, that are especially difficult. Difficulties in solving these problems are experienced not only by those who have a low overall score for the Unified State Examination in computer science, but also by “good students” and “excellent students”.
- Learn by heart the table of powers of the number 2.
- Remember that Kbytes in tasks means kibibytes, not kilobytes. 1 kibibyte = 1024 bytes. This will help avoid calculation errors.
- Carefully study the exam options of previous years. The computer science exam is one of the most stable, which means that you can safely use the USE options for the last 3-4 years for preparation.
- Get to know the different options for wording assignments. Remember that a slight change in the wording will always lead to worse exam results.
- Read the problem statement carefully. Most of the errors in completing assignments are due to a misunderstanding of the condition.
- Learn to independently check completed tasks and find errors in the answers.
What you need to know about problem solving with a detailed answer
24 task - to find the error
25 task requires a simple program
26 task - on game theory
27 task - it is necessary to program a complex program
Problem 27 is the main difficulty in the exam. It is only decided60-70% of USE writers in computer science. Its peculiarity lies in the fact that it is impossible to prepare for it in advance. Each year, a fundamentally new problem is presented for the exam. When solving problem No. 27, not a single semantic error should be made.
How to calculate exam time
Be guided by the data that are given in the specification of control measuring materials for the exam in computer science. It indicates the approximate time allotted for completing the tasks of the first and second parts of the exam.
The exam in computer science lasts 235 minutes
Of these, 90 minutes are allotted for solving problems from the first part. On average, each task from the first part takes from 3 to 5 minutes. It takes 10 minutes to solve problem #23.
There are 145 minutes left to solve the tasks of the second part of the exam, while solving the last task No. 27 will take at least 55 minutes. These calculations were made by the specialists of the Federal Institute for Pedagogical Measurements and are based on the results of exams of previous years, so they should be taken seriously and used as a guide for the exam.
Programming languages - which one to choose
- BASIC. It is an outdated language, and although it is still taught in schools, there is no point in wasting time learning it.
- School algorithmic programming language. It is designed specifically for early learning to program, convenient for mastering initial algorithms, but contains almost no depth, there is nowhere to develop in it.
- Pascal. It is still one of the most common programming languages for teaching in schools and universities, but its capabilities are also very limited. Pascal is quite suitable as the language for writing the exam.
- C++. Universal language, one of the fastest programming languages. It is difficult to study on it, but in practical application its possibilities are very wide.
- Python. It is easy to learn at an elementary level, the only thing required is knowledge of English. At the same time, with an in-depth study, Python provides the programmer with no less opportunities than C ++. Having started learning Python at school, you will continue to use it in the future, you will not have to relearn another language in order to reach new horizons in programming. To pass the exam, it is enough to know "Python" at a basic level.
Good to know
- Works in computer science are evaluated by two experts. If the expert evaluation results differ by 1 point, the higher of the two points is assigned. If the discrepancy is 2 points or more, the work is rechecked by a third expert.
- A useful site for preparing for the exam in computer science -
