Option No. 6589124
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. There is no need to write units of measurement.
If the option is specified by the teacher, you can enter or upload answers to tasks with a detailed answer into the system. The teacher will see the results of completing tasks with a short answer and will be able to evaluate the downloaded answers to tasks with a long answer. The scores assigned by the teacher will appear in your statistics.
Version for printing and copying in MS Word
In one of the Unicode encodings, each character is encoded with 16 bits. Determine the size of the following sentence in this encoding: The forest drops its crimson attire, the frost turns the withered field silver.
Answer:
For which of the given names is the statement true:
NOT(First letter is consonant) AND NOT(The last letter is a vowel)?
3) Valentina
Answer:
Roads were built between settlements A, B, C, D, E, the length of which (in kilometers) is given in the table.
Determine the length of the shortest path between points A and C (assuming that travel can only be done on constructed roads).
Answer:
The user worked with the catalog Poets. First he went up one level, then went down one level, then went down one level again. As a result, it ended up in the catalog
From:\School\Literature\Essays.
Record the full path of the directory the user started with.
1) From:\School\Poets\Literature\Works
2) From:\School\Poets
3) From:\School\Literature\Poets\Works
4) C:\Poets
Answer:
Given is a fragment of a spreadsheet:
| A | B | C | D | |
|---|---|---|---|---|
| 1 | 3 | 4 | 2 | 5 |
| 2 | =D1-1 | =A1+B1 | =C1+D1 |
Which of the formulas given below can be written in cell A2 so that the diagram constructed after the calculations based on the values of the range of cells A2:D2 corresponds to the picture?
Answer:
Performer The draftsman moves on the coordinate plane, leaving a trace in the form of a line. The draftsman can execute the command Move to ( a, b) (Where a, b- integers), moving the Draftsman from the point with coordinates (x, y) to the point with coordinates (x + a, y + b). If the numbers a, b positive, the value of the corresponding coordinate increases; if negative, decreases.
For example, if the Draftsman is at a point with coordinates (4, 2) , then the command Move to(2, −3)will move the Draftsman to the point(6, −1).
Repeat k times
Team1 Team2 Team3
means that the sequence of commands Team1 Team2 Team3 will happen again k once.
The draftsman was given the following algorithm to execute:
Repeat 4 times
Shift to (−1, −1) Shift to (2, 2) Shift to (3, −3) End
What command must the Draftsman execute in order to return to the starting point from which he started moving?
1) Shift by (−16, −8)
2) Shift to (16, 8)
3) Shift by (16, −8)
4) Shift by (−16, 8)
Answer:
The following encrypted radiogram was received from the scout, transmitted using Morse code:
– – – – – – – –
When transmitting the radiogram, the letter breakdown was lost, but it is known that only the following letters were used in the radiogram:
| A | D | L | T | AND |
|---|---|---|---|---|
| – | – | – | – | – |
Determine the text of the radiogram. In your answer, indicate how many letters were in the original radiogram.
Answer:
In the program, “:=” denotes the assignment operator, the signs “+”, “–”, “*” and “/” - respectively, the operations of addition, subtraction, multiplication and division. The rules for performing operations and the order of actions correspond to the rules of arithmetic.
Determine the value of a variable b after executing the algorithm:
In your answer, indicate one integer - the value of the variable b.
Answer:
Record the value of the variable s, obtained as a result of the following program. The program text is provided in five programming languages.
Answer:
The Ves table stores weight data in kilograms for a group of sports school students (Ves is the weight of the first student, Ves is the weight of the second student, etc.). Determine what will be printed as a result of executing the following algorithm, written in five algorithmic languages:
| BASIC | Python |
|---|---|
DIM Ves(14) AS INTEGER DIM i, n AS INTEGER Ves(1) = 25: Ves(2) = 21 Ves(3) = 23: Ves(4) = 28 Ves(5) = 30: Ves(6) = 25 Ves(7) = 31: Ves(8) = 28 Ves(9) = 25: Ves(10) = 28 Ves(11) = 30: Ves(12) = 27 Ves(13) = 26: Ves(14) = 24 IF Ves(i) > 26 THEN | Ves = for i in range(14): |
| Pascal | Algorithmic language |
Var i, n: integer; Ves: array of integer; Ves := 25; Ves := 21; Ves := 23; Ves := 28; Ves := 30; Ves := 25; Ves := 31; Ves := 28; Ves := 25; Ves := 28; Ves := 30; Ves := 27; Ves := 26; Ves := 24; for i:= 1 to 14 do if Ves[i] > 26 then | celtab Ves nc for i from 1 to 14 if Ves[i] > 26 then |
| C++ | |
#include using namespace std; int Ves = (25, 21, 23, 28, 30, 25, 31, 28, 25, 28, 30, 27, 26, 24); for (int i = 0; i if (Ves[i] > 26) n = n + 1; |
|
Answer:
The figure shows a diagram of roads connecting cities A, B, C, D, D, E, F, Z, I, K and L. 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 L?
Answer:
Below, in tabular form, is a fragment of the database on the results of the biathlon competition among men (12.5 km pursuit).
| Last name First name | A country | Time | Misses |
|---|---|---|---|
| Fourcade Martin | France | 34:47 | 1 |
| Peiffer Arnd | Germany | 35:06 | 1 |
| Svendsen Emil | Norway | 35:22 | 2 |
| Malyshko Dmitry | Russia | 35:27 | 2 |
| Bø Tarjei | Norway | 35:52 | 2 |
| Shlesinger Michal | Czech | 36:08 | 3 |
| Landertinger Dominic | Austria | 36:09 | 0 |
| Bergman Karl-Johan | Sweden | 36:14 | 3 |
| Hallenbarter Simon | Switzerland | 36:37 | 3 |
| Lindström Fredrik | Sweden | 36:38 | 4 |
How many records in this fragment satisfy the condition
(Country = "Sweden") OR (Miss< 2)?
In your answer, indicate one number - the required number of records.
Answer:
Convert the number 73 from the octal number system to the binary number system.
Answer:
The performer Kvadrator has two teams, which are assigned numbers:
1. square
2. add 3
The first of them raises the number on the screen to the second power, the second - adds 3 to the number.
Create an algorithm for obtaining 55 from number 2, containing no more than 5 commands. In your answer, write down only the command numbers.
(For example, 22122 is an algorithm:
add 3
add 3
square it
add 3
add 3
which converts the number 2 to 70).
If there is more than one such algorithm, then write down any of them.
Answer:
An 8 MB file is transferred over a certain connection in 128 seconds. Determine the time in seconds in which a file of 4096 KB in size can be transferred through the same connection. In your answer, indicate only the number of seconds. There is no need to write units of measurement.
Answer:
Some algorithm obtains a new chain from one chain of characters as follows. First, the length of the original string of characters is calculated; if it is odd, then the middle character of the chain of characters is duplicated, and if it is even, then the letter N is added to the end of the chain. In the resulting chain of characters, each letter is replaced by the letter that follows it in the Russian alphabet (A - to B, B - to C, etc. ..., and I - on A). The resulting chain is the result of the algorithm.
For example, if the original chain was CAT LPPU, and if the initial chain was VANIA, then the result of the algorithm will be the chain GBOAO.
Given a string of characters BUG. What chain of symbols will be obtained if the described algorithm is applied to this chain twice (i.e., apply the algorithm to this chain, and then apply the algorithm to the result again)? Russian alphabet: ABVGDEYEZHZIYKLMNOPRSTUFHTSCHSHSHSHCHYYYUEYA.
Answer:
Four pieces of paper were found at the crime scene. The investigation established that they contained fragments of the same IP address. Forensic scientists designated these fragments with the letters A, B, C and D:
| 4.243 | 116.2 | 13 | .23 |
|---|---|---|---|
| A | B | IN | G |
Recover your IP address. In your answer, provide the sequence of letters representing the fragments in order corresponding to the IP address.
Answer:
The table shows queries to the search server. For each request, its code is indicated - the corresponding letter from A to G. Arrange the request codes from left to right in descending order of the number of pages that the search server found for each request. For all queries, a different number of pages were found. To indicate the logical operation "OR" in the query, use the symbol "|", and for the logical operation "AND" - "&":
Answer:
Data on the calorie content of foods was entered into a spreadsheet. Below are the first five rows of the table:
| A | B | C | D | E | |
|---|---|---|---|---|---|
| 1 | Product | Fats, g | Proteins, g | Carbohydrates, g | Calorie content, kcal |
| 2 | Peanut | 45,2 | 26,3 | 9,9 | 552 |
| 3 | Roasted peanuts | 52 | 26 | 13,4 | 626 |
| 4 | Boiled peas | 0,8 | 10,5 | 20,4 | 130 |
| 5 | Green peas | 0,2 | 5 | 8,3 | 55 |
Column A records the product; in column B - fat content; in column C - protein content; in column D - carbohydrate content and in column E - calorie content of this product.
Complete the task.
Open the file with this spreadsheet (the exam organizers will tell you the location of the file). Based on the data contained in this table, answer two questions.
1. How many foods in the table contain less than 20 g of carbohydrates and more than 20 g of protein? Write the number of these products in cell H2 of the table.
2. What is the average calorie content of foods containing 0 g carbohydrates? Write the answer to this question in cell NZ of the table with an accuracy of at least two decimal places. task19.xls
Solutions to long-answer tasks are not automatically checked.
The next page will ask you to check them yourself.
Choose ONE of the tasks below: 15.1 or 15.2.
15.1 Performer Robot can navigate through a labyrinth drawn on a plane divided into cells. Between adjacent (on the sides) cells there may be a wall through which the Robot cannot pass.
Robot has nine commands. Four commands are order commands:
up down left right
When executing any of these commands, the Robot moves one cell, respectively: up down ↓, left ←, right →. If the Robot receives a command to move through a wall, it will collapse.
Robot also has a team paint over, in which the cell in which the Robot is currently located is painted over.
Four more commands are condition checking commands. These commands check if the path is clear for the Robot in each of four possible directions:
top free bottom free left free right free
These commands can be used in conjunction with a condition "If", having the following form:
If condition That
sequence of commands
Here condition— one of the commands for checking a condition. Command Sequence- this is one or more any commands-orders. For example, to move one cell to the right, if there is no wall on the right, and paint the cell, you can use the following algorithm:
if the right is free then
paint over
In one condition, you can use several condition checking commands using logical connectives and, or, not, For example:
if (right is free) and (not below is free) then
You can use a loop to repeat a sequence of commands "Bye", having the following form:
nts for now condition
sequence of commands
For example, to move to the right while it is possible, you can use the following algorithm:
nts the right is free for now
Complete the task.
On an endless field there are four walls connected to each other, which form a rectangle. The lengths of the walls are unknown. There is exactly one passage in the left vertical wall. A passage cannot be adjacent to a corner of a rectangle. The exact location of the passage and the width of the passage are unknown. The robot is near the bottom end of the left vertical wall, outside the rectangle and above the bottom wall. The figure shows one of the possible ways to position the walls and the Robot (the Robot is designated by the letter “P”).
Write an algorithm for the Robot that paints all the cells located along the walls of a rectangle from the outside. The passage must remain unpainted. The robot must paint only cells that satisfy this condition. For example, for the picture above, the Robot must color in the following cells (see picture).
When executing the algorithm, the Robot must not be destroyed; the execution of the algorithm must be completed. The final location of the Robot can be arbitrary. The algorithm must solve the problem for any admissible
the location of the walls and any location and size of the passage inside the wall. The algorithm can be executed in a formal executor environment or written in a text editor.
15.2 Write a program that, in a sequence of natural numbers, determines the maximum number ending in 2.
The program receives as input the number of numbers in the sequence, and then the numbers themselves. The sequence always contains a number ending in 2.
The number of numbers does not exceed 1000. The entered numbers do not exceed 30,000. The program should output one number - the maximum number ending in 2.
Example of the program:
Published on the official website of the Federal Institute of Pedagogical Measurements (FIPI) demo versions of the OGE in computer science (grade 9) for 2009 - 2020.
They consist of two types of tasks: tasks where you need to give a short answer, and tasks that need to be completed on a computer and give a detailed answer.
To tasks of the first type in demo versions of the OGE in computer science answers are given, and solutions and assessment criteria are given for tasks with detailed answers.
IN changes:
- The number of tasks was reduced to 15.
- Were :
- task 11
- task 12
- task 13
- . In all tasks demo version is now required brief or detailed response.
Demo versions of the OGE in computer science
Note that demo versions of the OGE in computer science are presented in pdf format, and to view them you must have, for example, the free Adobe Reader software package installed on your computer.
| Demo version of the OGE in computer science for 2009 | |
| Demonstration version of the OGE in computer science for 2010 | |
| Demo version of the OGE in computer science for 2011 | |
| Demo version of the OGE in computer science for 2012 | |
| Electronic data table for completing tasks in part 3 of the demo version of the OGE in computer science for 2012 | |
| Demo version of the OGE in computer science for 2013 | |
| Electronic data table for completing tasks in part 3 of the demo version of the OGE in computer science for 2013 | |
| Demo version of the OGE in computer science for 2014 | |
| Electronic data table for completing tasks in part 3 of the demo version of the OGE in computer science for 2014 | |
| Demo version of the OGE in computer science for 2015 | |
| Electronic data table for completing tasks in part 2 of the demo version of the OGE in computer science for 2015 | |
| Demo version of the OGE in computer science for 2016 | |
| Electronic data table for completing tasks in part 2 of the demo version of the OGE in computer science for 2016 | |
| Demo version of the OGE in computer science for 2017 | |
| Electronic data table for completing tasks in part 2 of the demo version of the OGE in computer science for 2017 | |
| Demo version of the OGE in computer science for 2018 | |
| Spreadsheet of data for completing tasks in part 2 of the demo version of the OGE in computer science for 2018 | |
| Demo version of the OGE in computer science for 2019 | |
| Spreadsheet of data for completing tasks in part 2 of the demo version of the OGE in computer science for 2019 | |
| Demo version of the OGE in computer science for 2020 | |
| Files for completing task 12 of the demo version of the OGE in computer science for 2020 (files are archived) | |
| Files for completing task 13 of the demo version of the OGE in computer science for 2020 (files are archived) | |
| Spreadsheet of data for completing task 14 of the demo version of the OGE in computer science for 2020 |
Scale for recalculating the primary score for completing the examination work into a mark on a five-point scale
- a scale for recalculating the primary score for completing the 2020 examination paper into a mark on a five-point scale;
- a scale for recalculating the primary score for completing the 2019 examination paper into a mark on a five-point scale;
- scale for recalculating the primary score for completing the 2013 examination paper into a mark on a five-point scale.
Changes in computer science demos
In 2015 in demo version of the OGE in computer science was the structure of options has been changed:
- The option began to consist two-piece.
- The form for recording the answer in tasks with a choice of answers has been changed: the answer now needs to be written down number with the number of the correct answer(not circled).
IN demo versions of the OGE 2016-2019 in computer science compared to the 2015 demo version there were no changes.
IN demo version of the 2020 OGE in computer science Compared to the 2019 demo version, the following happened: changes:
- The number of tasks was reduced to 15.
- Were added 3 new tasks performed on the computer:
- task 11 to search for information using a text editor or operating system;
- task 12 to analyze the contents of file system directories;
- task 13 to create a presentation or text document.
- From the demo version there were multiple-choice tasks excluded. In all tasks demo version became required brief or detailed response.
The maximum number of OGE points in computer science (GPA grade 9) that an examinee can receive for completing the entire examination work is 22 points.
The exam results can be used when admitting students to specialized classes in secondary schools. The guideline for selection into specialized classes can be an indicator whose lower limit corresponds to 15 points.
Demo version of the OGE in computer science 2017
Changes in CMM 2017 years compared to CMM 2016 - none
The OGE in computer science and information and communication technologies consists of 2 parts: written and practical (completing tasks on a computer).
The number of workstations equipped with a computer must correspond to the number of exam participants in the room.
Part 2 The CMM is performed on a computer. The checked result of completing the task of part 2 is a file.
The tasks in this part involve practical work by students on a computer using special software. The result of each task is a separate file.
Programs familiar to students should be installed on the computer.
Part 2 task is given in two versions at the student’s choice:
The first version of the task involves the development of an algorithm for the “Robot” executor (it is recommended to use the “Robot” executor’s learning environment). Such an environment can be used, for example, the “Idol” educational development environment, developed at the Scientific Research Institute of Intellectual Studies of the Russian Academy of Sciences (http://www.niisi. ru/kumir), or any other environment that allows you to simulate the “Robot” performer. If the syntax of the performer’s commands in the environment used differs from that given in the task, it is allowed to make changes to the text of the task in terms of the description of the “Robot” performer. When in the absence of a learning environment for the “Robot” performer, the solution to the task is written in a simple text editor);
The second version of the task involves writing the algorithm in the programming language being studied (if the topic “Algorithmization” is studied using a programming language). In this case, the programming system used in training is necessary to complete the task.
Each task in Part 2 is a separate file prepared in the appropriate program (text editor or spreadsheet). Exam participants save these files in a directory under names specified by the exam organizers (technician).
The Answer Forms (after completing the work on the computer) contain the names of the files with completed tasks, including a unique number (CMM number).
OGE in computer science is one of the exams that is taken at the student’s choice. To enter the 10th grade after the 9th grade, you need to choose 2 subjects of your choice and 2 disciplines are mandatory. Computer science is chosen by those who enter a class with a certain specialization or plan to enter a college or technical school where this subject is needed. Also, many people choose computer science because it seems like the easiest option. If you know a computer and have not chosen a subject to take, computer science is worth paying attention to.
The exam is divided into two parts - written and practical, which is performed on a computer.
- The first part includes 18 tasks (the number may change every year), the difficulty level is basic. The goal is to test students’ theoretical knowledge for compliance with the norms and standards of the program. Main topics and focus of assignments: converting numbers from one number system to another, converting units of measurement, theoretical knowledge on all topics of the course. If you learn how to perform such tasks, remember the features and solution algorithm, there will be no problems in the exam. Also in this part there are programming tasks - this does not require specific knowledge and special abilities, it is enough to learn the algorithm.
- The second part requires you to complete two tasks on the computer. Moreover, you need to cope without the help of the Internet. The tasks are aimed at testing work, for example, in an Office suite or programming environment. The first task, most often, is on Excel skills: find the sum, use formulas and graphs to demonstrate any values. Programming is performed in the Kumir, Python, Pascal environment. The student receives a task and completes it - the result should be a working, simple algorithm.
It is quite possible to complete the course and prepare for the exam with basic skills. The main thing is to practice writing algorithms, study theory, and learn how to perform tests. The online resource “I will solve the OGE in computer science” will help with the latter - it contains many tasks of different difficulty levels, after completing which the student can easily pass the exam with a high score.
It is recommended that you begin your preparation by familiarizing yourself with , which outlines all the topics worth paying attention to. This will help create a schedule and preparation plan. Clearly set goals and an action plan, a little self-discipline and you can master the material even in six months. To master programming, you can use the help of a teacher, study textbooks on your own, study with a tutor - it’s a matter of choice.
Programming is considered the most difficult topic - spend more time on it. But classes using a special website resource will allow you to gain experience solving tasks of varying complexity online. Only by knowing how to use the information you have learned can you pass the OGE in computer science with a high score.
In KIM 2020, the number of tasks has been reduced to 15. The set of tasks performed on a computer has been expanded by including 3 new tasks that test skills in practical work with a computer: searching for information using a text editor or operating system (task 11); analysis of the contents of file system directories (task 12); creating a presentation or text document (task 13). Unlike KIM 2019, in KIM 2020 all tasks provide either a short or extended answer.
Official demo version of the OGE 2020 from FIPI in Informatics:
- Demo version: inf-9-oge-2020_demo.pdf
- Codifier: inf-9-oge-2020_kodif.pdf
- Specification: inf-9-oge-2020_spec.pdf
- Download in one archive: inf_oge_2020_proekt.zip
State process final certification involves the use of standardized tests to monitor the quality of students’ preparation and, in general, the entire educational process in secondary school.
To successfully pass the OGE in computer science 2019, preparation must begin at the beginning of the academic year, taking into account the innovations being adopted.
Structure of the 2019 OGE in computer science
The proposed set of tests is divided into 2 group categories:
- Part 1 of the examination paper contains 18 tasks - 11 at a basic level of difficulty and 7 at an increased level of difficulty. The first six tasks with one correct answer out of four options (these are tasks of category A) and twelve tasks where the answer can be either a word, a number or an entire digital sequence (these are tasks of category B).
- Part 2 contains 2 tasks of a high level of complexity - the graduate is offered two tests. But everyone needs the most detailed and detailed answer. Most likely, you will need a rather complex solution. In task numbers 19 and 20, you will need to write a program for two proposed tasks (these are tasks of category C).
After completing the tasks of Part 1, the examinee submits a form for recording answers and proceeds to completing the tasks of Part 2.
The duration of the exam is 150 minutes. Test developers recommend completing tasks in categories A and B in 75 minutes, freeing up the remaining time for writing a programming task (category C).
Practical part
Previously, the student selects software and hardware and the appropriate language to complete the second part of the OGE.In accordance with the specified parameters, he is provided with a workplace equipped with a computer.To complete task 19, you will need a spreadsheet program. To complete task 20.1, it is recommended to use the performer’s learning environment “Robot”; the second version of task (20.2) involves writing the algorithm in the programming language being studied.
Options for acceptable languages for writing a program:
- Algorithmic language
- BASIC
- Pascal
- C++
- Python
Each task of the practical part is completed in a separate file prepared in the appropriate program (text editor or spreadsheet). Exam participants save these files in a directory under names specified by the exam organizers (technician).
The answer forms (after completing the work on the computer) contain the names of the files with completed tasks, including a unique number (CMM number).
An excellent opportunity to practice the examination process, study possible types of tasks, and even repeat the curriculum - demo version of the OGE in computer science and ICT 2020.
Additional information about the OGE 2019
When performing the first and second categories of tasks, the use of technical devices is not allowed: calculators, computer equipment, mobile phones. Reference books and books on computer science are also prohibited.
When starting practical part 2 (category C), the student receives a personal computer.
As for success indicators, to be rated “satisfactory”, a participant in the OGE only needs to score 5 points. The maximum number for correctly solving all 20 OGE questions is 22 points. Below is the Calculation of transferring points to OGE 2019 grades in INFORMATION SCIENCE_I_ICT on the FIPI website, t table 11
How to prepare for the 2019 OGE in computer science
There are several practice-tested methods.
Site articles:
- <Умение оценивать количественные параметры информационных объектов>
- <Умение определять значение логического выражения>
- <Знание о файловой системе организации данных>
- <Умение представлять формальную зависимость в графическом виде>
- <Умение кодировать и декодировать информацию>
- <Умение исполнить циклический алгоритм обработки массива чисел>
- <Умение осуществлять поиск в готовой базе данных по сформулированному условию>
- <Знание о дискретной форме представления числовой, текстовой, графической и звуковой информации>
- <Умение определять скорость передачи информации>
- <Знание о о organization of the information environment >
- <Умение осуществлять поиск информации в Интернете>
Internet articles:
- OGE - question 19 Recommendations for completing the task (
Book manuals you can look at OGE 2019 - computer science.
There is an opportunity to select many useful teaching methods so that preparation for the OGE in computer science 2019 can be successfully implemented. The list of leaders includes:
FIPI
The abbreviation of the educational institution stands for “Federal Institute of Pedagogical Measurements.” On your website ( fipi.ru) presents the latest selection of additional problems, exam demos and online computer science tests. All tasks were developed by FIPI specialists taking into account the latest achievements of information technology and scientific thought in this field. It is a subsidiary of Rosobrnauka and is designed to engage not only in educational, but also scientific activities. The organization's website has many sections on various topics.
Online tests
The online tests offered on educational sites on the Runet help deepen existing knowledge and practice the procedure for passing the OGE. The format of the tests is as close as possible to the format of the OGE 2019 in computer science. Some tests can be downloaded to your own computer, others are only available from the website.
Assignments for preparation for OGE-201 9 Online Nikiforov Nikolai Sergeevich
Online tests for the OGE in computer science for 2020on the website of Polyakov Konstantin Yurievich
I will solve the OGE - an educational portal for preparing for exams Gushchina D. D.
YouTube video channels
- FizInfo - preparation for the OGE in computer science,
- “Preparation for the OGE in computer science”,
Psychological secrets of successful exam preparation
Taking the exam
“Fortune always smiles on those who have worked hard,” says an English proverb. I would like to add: “and to those who know how to show the results of their work.” In an exam, that's exactly what you do - demonstrate what you've learned. So do it calmly and confidently. Try to change your idea of the exam - it’s not torture, not execution, but simply a test of your knowledge, especially since you know everything (or almost everything).
On the day of the exam
1. Pre-exam stress is often accompanied by a lack of appetite. But even if “a piece doesn’t fit into your throat,” you definitely need to eat at least a little. Otherwise, in a state of stress, a sharp decrease in blood sugar levels may occur and accompanying symptoms may occur - trembling, sweating, weakness, dizziness, headache, nausea... It won’t take long for you to faint.
2. You should not go to the exam with a full stomach. Breakfast should be light, containing foods rich in protein and carbohydrates. In the morning before the exam, it is best to eat yogurt, as well as cottage cheese, scrambled eggs, milk porridge or muesli, a sandwich with cheese or honey and drink tea with lemon and sugar. You shouldn’t “pick yourself up” with strong coffee. If your nerves are on edge, but you realize that your body needs food, eat 1 tsp. honey, 2 walnuts, 3 pieces of dried apricots and drink a glass of biokefir. 1-2 bananas, a handful of raisins and a fruit milkshake will also help maintain your strength.
3. Music is an extremely effective way to relieve pre-exam stress. .
When getting ready for the exam, turn on recordings of a bravura march, czardas or energetic guitar flamenco, and you will be convinced that your fear and inner trembling will disappear. If you love classical music, Bach's preludes and fugues for organ, Tchaikovsky's Fifth Symphony, and all the orchestral works of Alexander Scriabin will help you. Bach's music, by the way, is very effective if intense intellectual work is to be done. Compositions by Bryan Adams, Tina Turner, Bon Jovi and Riccardo Foglia also set the mood for battle.
4. But what you should never do is take sedatives. The result could be disastrous. Lethargy and lethargy will not allow you to concentrate!
Before leaving the house, apply a few drops of lavender, basil or mint essential oil, which has calming properties, to your temples or wrists. You can also drop this oil on a handkerchief and then periodically inhale its aroma during the exam.
Techniques for dealing with fear
1 . Stop being afraid! Many people are well aware of the state of panic before exams: “I don’t know anything! I don’t remember anything!” Try to direct your thoughts in a different direction: “I worked long and purposefully, I did everything in my power, I still know something from all the material and quite well.”
2. Do breathing exercises. This is the fastest, easiest and most effective way to overcome feelings of stress and panic. Close your eyes and breathe slowly and deeply. Exhalation should be 2-3 times longer than inhalation. As you inhale, imagine that you are sniffing your favorite scent through your nose. Exhale through slightly closed lips as if you want to blow out a candle flame or blow on a spoon of hot soup. 3-5 minutes after the start of breathing exercises, you can add self-hypnosis formulas to them:« I relax and calm down", synchronizing them with the rhythm of your breathing. At the same time, the words “ I" And " And"should be pronounced in inhale, and the words “ relaxing" And " I'm calming down" - on exhale.
You can also say to yourself:
“I am calm and confident”
“My memory works well. I remember evrything"
“I can prove that I worked hard and learned everything.”
Autotraining is an effective technique: the brain perfectly obeys such commands.
3. Learn to never think about failing an exam.. On the contrary, you need to mentally paint yourself a picture of a confident, clear answer, complete victory. We get what we think hard about, literally programming ourselves for the final result. And for this result to satisfy us, we need to think about the good, setting ourselves up for success: “I will succeed, at the right moment I will remember everything.”
4. Don't get caught up in other people's anxiety. As a rule, in front of the door of the auditorium in which the exam is taking place, there is a crowd of students shaking with fear, discussing how strict and picky this or that examiner is and from time to time saying: “Oh, I’m definitely going to fail today! Everything flew out of my head! I’m already shaking all over!” Do not crowd together with them so as not to be “infected” by their fear. Experience your anxiety alone, step aside, wander along the corridor, look out the window.
5. Relieve tension. The simplest movements will help you get rid of painful discomfort. Make a few circular movements with your head, stretch your arms, and shrug your shoulders. If possible, box, throwing punches into an empty space and imagining that you are punching your fear.
.jpg)
In a stressful situation, it is useful to yawn. By yawning sweetly three to five times, you will not only reduce anxiety, but also activate your brain. To trigger the yawn reflex, you need to use your middle fingers to massage the muscles between your ear and cheek.
6. Do self-massage. A light massage of the occipital area of the head distracts from obsessive fear and also helps to significantly increase intelligence. Massaging the tips of the little fingers, as well as performing yoga for the fingers, the so-called mudras, helps relieve emotional stress. This word refers to the joining of fingers in a certain combination.
Thus, the mudra of the Earth helps with stress, deterioration of psychophysical condition, increases self-esteem and self-confidence. To perform this, press the ring and thumb fingers of both hands tightly against each other with the pads, straighten the remaining fingers and spread them slightly apart. It is useful to do this gesture as often as possible and keep your fingers in this position for as long as possible.
If you are feeling very stressed, place your left hand on the table, palm down. With your right hand, for 3-5 minutes, in a clockwise circular motion, massage the point of intersection of the conventional lines of the thumb and index finger, while placing the thumb as far as possible from the index finger. Then change your hand, but now make movements counterclockwise.
Source of the article “Passing the exam”: http://moeobrazovanie.ru/programma_antistress.html
___________________________
Dear readers, if you have found informative, interesting material on this topic, share the link, I will be grateful.
