Video fragment from a consultation session (consultation before the computer science exam) in preparation for the OGE. Analysis of task number 6 from the OGE on the topic Algorithm for a specific performer with a fixed set of commands. Algorithm executors. In the video clip above you will find solution to task number 6 from OGE in computer science

Task 6:

Performer The draftsman moves on the coordinate plane, leaving a trace in the form of a line. The Draftsman can issue the Move to (a, b) command (where a, b are integers), which moves the Draftsman from a point with coordinates (x, y) to a point with coordinates (x + a, y + b). If the numbers a, b are positive, the value of the corresponding coordinate increases; if negative, it decreases.

V1. The draftsman was given the following algorithm to execute:

Repeat 2 times
Command1 Move to (3, 2) Move to (2, -1)
End
Shift by (6, −4)

After completing this algorithm, the Draftsman returned to the starting point. What command should be put instead of the command Team1?

V2. The draftsman was given the following algorithm to execute:

Repeat 3 times
Shift by (-2, -3) Shift by (3, 2) Shift by (-4, 0
end

The lesson is devoted to how to solve task 6 of the Unified State Exam in computer science

The 6th topic - “Analysis of algorithms and executors” - is characterized as tasks of a basic level of complexity, completion time - approximately 4 minutes, maximum score - 1

Performer for squaring, division, multiplication and addition

Let's take a closer look at what might be useful for solving task 6.

• in a problem for which you need to determine all possible results the work of the algorithm of any performer, the initial data can be designated by variables and the algorithm can be calculated with these variables;
• in a problem for which you need to find optimal program(or the shortest one), and which, using a given set of commands, converts a certain number to another, is better for solving build a tree of possible options; thus, calculating what results will be obtained after one step, after two steps, etc. As a result, a general solution will be found;
• if among the performer’s commands specified in the task there is an irreversible command (for example, the performer works with integers and there is a squaring command - any number can be squared, but not the square root can be extracted from any number, thereby obtaining an integer), then It’s better to build a tree of options from the end, i.e. in reverse order, moving from the final number to the starting number; whereas the resulting sequence of program commands must be written from the initial number to the final one.

Checking a numerical sequence for compliance with the algorithm

• To complete some tasks you need to repeat the topic;
• the maximum value of the sum of the digits of a decimal number is 18 , because 9 + 9 = 18 ;
• to check the correctness of the transmitted message is sometimes entered parity bit- an additional bit that complements the binary code in such a way that the number of ones becomes even as a result: i.e. if the number of units in the original message was even, then 0 is added, if odd, 1 is added:

for example: 3 10 = 11 2 after adding parity bit: 110 ---- 4 10 = 100 2 after adding parity bit: 1001

adding the number zero to the right of binary notation doubles the number:

for example: 111 2 is 7 10 add 0 to the right: 1110 2 is 14 10

Now we will consider specific standard exam options in computer science with an explanation of their solutions.

Analysis of task 6

Solving tasks 6 of the Unified State Exam in computer science for the topic Performers

6_1:

The performer GRASSHOPPER lives on the number line. The initial position of the GRASSHOPPER is a point 0 . GRASSHOPPER command system:

• Forward 5— The grasshopper jumps forward 5 units,
• Back 3— The grasshopper jumps back 3 units.

Which least number of times the command must appear in the program "Back 3" so that the GRASSHOPPER is at the point 21 ?

✍ Solution:

Let's consider two solutions.

✎ 1st solution:

• Let us introduce the following notation:
• let x- this is a team Forward 5
• let y- this is a team Back 3
• Since the Grasshopper moves from the beginning of the number axis (from 0 ) and eventually reaches the point 21 , then we get the equation:

5x - 3y = 21 ( -3y- because we are moving backwards)

Let's express x:

5x = 21 + 3y

To express x it will be necessary to divide the right side of the equation by 5 . And since x cannot be a fractional number, then we conclude that the right side must be divisible by 5 without a trace.

Because we need to get the least y, then we will select y, beginning with 1 :

y=1-> 21+3 is not divisible by 5 y=2-> 21+6 is not divisible by 5 y=3 -> 21+9 divisible by 5

Result: 3

✎ 2nd solution:

• Let's say the Grasshopper jumped to 21 (and further). He could only do this with the help of the command Forward 5. We will consider numbers > 21 And divisible by 5 without remainder(because Forward 5).
• The first number is greater 21 and divisible by 5 without a trace - this is 25 .

25 - 3 (Back 3) = 22 -> not 21 30 - 3 - 3 - 3 = 21 -> got 21!

The command was used Back 3 three times.

Result: 3

If anything remains unclear, we suggest you take a look video with solution analysis:

6_2:

There is a performer, the Grasshopper, who lives on the number line. Grasshopper command system:

• Forward N(The grasshopper jumps forward N units);
• Back M(The grasshopper jumps back M units).

Variables N And M can take any positive integer value.

It is known that the Grasshopper executed the program from 50 teams in which teams Back 2 12 more than teams Forward 3. There were no other teams in the program.
Which one command can this program be replaced with so that the Grasshopper ends up at the same point as after executing the program?

✍ Solution:

• In order to find out the number of both commands, you must enter the unknown x. Let's imagine that the number of teams Forward 3 was completed x times, then the number of commands Back 2 was x+12 once. Since there were only teams 50 and there were no other teams, then we’ll create an equation:

x + x + 12 = 50 teams

We'll find x(number of teams Forward 3):

2x = 50 - 12 x = 38/2 = 19

Now let's find the point on the number axis where the Grasshopper finds himself. Let's take into account that he 19 once performed a jump three “steps” forward and 19 + 12 Jumped back 2 steps once:

3 * 19 - 2 * (19 + 12) = 57 - 62 = -5

-5 means that it was possible to move to this point with one command - Back 5

Result: Back 5

We invite you to watch the video analysis of task 6:

Unified State Exam 6_3:
From the performer Quad two teams assigned numbers:

1. add 1,
2. square it.

The first of these commands increases the number on the screen by 1, the second - squares it. The program for the Quad performer is a sequence of command numbers.

For example, 22111 is a program square square add 1 add 1 add 1 This program converts the number 3 V 84 .

Record a program for the performer Quad, which converts the number 5 to the number 2500 and contains at most 6 commands If there is more than one such program, then write down any of them.

✍ Solution:

• Since the number 2500 It’s quite large, so it’s difficult to figure out which commands can be used to “reach” it.
• In this kind of problem, you should start solving from the end - from the number 2500 square root of a number(since the square root is the inverse operation of squaring). If the square root cannot be extracted, we will execute the reverse command for the first command - Subtract 1(reverse for Add 1):

2500 : square of a number 50 -> operation 2

50 Subtract 1, we get 49 -> operation 1

49 : square of a number 7 -> operation 2

7 : is not a square, so the command Subtract 1, we get 6 -> operation 1

6 : is not a square, so the command Subtract 1, we get 5 -> operation 1

Let's write all the commands in reverse order and get the result:

Result: 11212

You can watch the video of the solved 6th task of the Unified State Exam in computer science:

6_4. Option No. 11, 2019, Computer Science and ICT Model exam options, Krylov S.S., Churkina T.E.

From the performer Calculator two teams assigned numbers:

1. add 3,
2. multiply by 5.

By performing the first of them, the Calculator adds 3 to the number on the screen, and by performing the second, it multiplies it by 5.

Write down the order of commands in the program that converts number 3 to number 24 and contains no more than four commands Enter only command numbers.

✍ Solution:

• In this kind of problem, sometimes it’s easier to start the solution from the end - from the number 24 , and try to perform the action each time divide by 5(since division is the inverse operation of multiplication). If the number in question is not integer divisible by 5, then we will execute the reverse command for the first command - subtract 3(reverse for add 3):

24 : not divisible by 5, which means 24 - 3 = 21 -> operation 1

21 : not divisible by 5, which means 21 - 3 = 18 -> operation 1

18 : not divisible by 5, which means 18 - 3 = 15 -> operation 1

15 : 15 / 5 = 3 -> operation 2

Let's write all the commands in reverse order and get the result: 2111.

Answer: 2111

6_5:

An executor that works with positive single-byte binary numbers has two instructions, which are assigned numbers:

1. slide right
2. add 4

By performing the first of them, the performer shifts the number one binary digit to the right, and by performing the second, he adds 4 to it.

The performer began calculations with the number 191 and executed the chain of commands 112112 . Write the result in decimal notation.

✍ Solution:

✎ 1 way:

• To execute the first command, let's convert the number to the binary number system:

191 10 = 10111111 2

Team 1: Team slide right means that the least significant bit will be “lost” (will end up in a special cell - the carry bit), and will be added to the most significant one 0 (which is insignificant, which means you don’t have to write it).

10111111 - > 1011111

Team 1: Let's repeat the previous paragraph once again:

01011111 - > 101111

Team 2: This command is easier to execute by converting the number to the decimal number system:

101111 2 -> 47 10

now let's add 4 :

47 + 4 = 51

Team 1: Let’s convert again to the binary number system:

51 10 = 110011 2

Let's perform a shift:

110011 - > 11001

Team 1: Let's do the shift again:

11001 - > 1100

Team 2: Let's convert the number to the decimal number system and add 4 :

1100 2 -> 12 10 12 + 4 = 16

Result: 16

✎ Method 2:

• When shifting to the right, a zero enters the high bit, and the low bit is sent to a special cell - the carry bit, i.e. it will be “lost”. Thus, if the number is even, then when shifted it is halved; if odd, the nearest smaller even number is halved (or the original odd integer is divided by 2 ).
• We get the results of executing a sequence of commands:

team 1: 191 -> 95 team 1: 95 -> 47 team 2: 47 -> 51 team 1: 51 -> 25 team 1: 25 -> 12 team 2: 12 -> 16

Result: 16

For a detailed explanation, watch the video:

6_6: Task 6 Unified State Exam in Computer Science 2017 FIPI option 19 (Krylov S.S., Churkina T.E.):

The Adder-Multiplier performer has two teams, which are assigned numbers:

1. Add 3
2. Multiply by x

The first one increases the number on the screen by 3 , the second multiplies it by X. The program for the performer is a sequence of command numbers. It is known that the program 12112 converts number 3 in number 120 .

Determine the value X, if it is known that it is natural.

✍ Solution:

• Let's substitute the executed commands in order according to the numbers in the sequence of commands. For convenience, we will use brackets:
  12112 :

((((3+3)*x)+3)+3)*x = 120

We get a quadratic equation:

6x 2 + 6x - 120 = 0

Let's solve it and get the result:

x1=4; x2=-60/12

Because according to instructions X- natural, then x2 doesn't suit us.

Let's substitute x1 into our equation to check:

((((3+3)*4)+3)+3)*4 = 120

That's right.

Result: 4

A more detailed analysis of the lesson can be seen in the video of the Unified State Exam in Computer Science 2017:

Solving tasks for the topic Checking a number sequence (Automatic)

6_7: Unified State Exam in Computer Science task 6 from the site of K. Polyakov (task number P-06):

The machine receives a four-digit number as input. Based on this number, a new number is constructed according to the following rules.

1. The first and second, as well as the third and fourth digits of the original number are added.
2. The resulting two numbers are written one after another in descending order (without separators).

Example. Original number: 3165. Sums: 3 + 1 = 4; 6 + 5 = 11. Result: 114.

Specify least number, as a result of processing which, the machine will display the number 1311.

✍ Solution:

Result: 2949

The process of solving this 6th task is presented in the video tutorial:

6_8: Task 6 Unified State Exam in Computer Science 2017 FIPI (Krylov S.S., Churkina T.E.) option 13:

The machine receives a four-digit number as input. A new number is constructed from it according to the following rules:

• The first and second digits are added, then the second and third, and then the third and fourth digits of the original number.
• The resulting three numbers are written one after another in ascending order (without separators).

Example: Original number: 7531. Sums: 7+5=12; 5+3=8; 3+1=4. Result: 4812.

Specify the largest number that the machine will produce as a result of processing 2512 .

✍ Solution:

Result: 9320

6_9: Task 6 Unified State Examination in Informatics 2017 FIPI (Ushakov D.M.) option 2:

The machine receives two two-digit hexadecimal numbers as input. These numbers contain all the digits do not exceed the number 6(if the number contains a number greater than 6, the machine refuses to work). Using these numbers, a new hexadecimal number is constructed according to the following rules:

1. Two hexadecimal numbers are calculated: the sum of the most significant digits of the resulting numbers and the sum of the least significant digits of these numbers.
2. The resulting two hexadecimal numbers are written one after another in descending order (without delimiters).

Example: Initial numbers: 25, 66. Bitwise sums: 8, B. Result: B8.

Which of the proposed numbers can be the result of the machine?
List the letters corresponding to these numbers in alphabetical order, without spaces or punctuation.

Options:
A) 127
B) C6
C) B.A.
D) E3
E) D1

✍ Solution:

Result: B.C.

A detailed solution to this 6th task can be viewed in the video:

6_10: 6 task of the Unified State Exam. Task 4 GVE Grade 11 2018 FIPI

The machine receives the input two two-digit hexadecimal numbers. These numbers contain all the digits do not exceed the number 7(if the number contains a number greater than 7, the machine refuses to work). Using these numbers, a new hexadecimal number is constructed according to the following rules.

1. Two hexadecimal numbers are calculated: the sum of the most significant digits of the resulting numbers and the sum of the least significant digits of these numbers.
2. The resulting two hexadecimal numbers are written one after another in ascending order (without delimiters).

Example. Initial numbers: 66, 43. Bitwise sums: A, 9. Result: 9A.

Determine which of the proposed numbers can be the result of the machine.

Options:
1) AD
2) 64
3)CF
4) 811

✍ Solution:

Result: 1

Solution 4 of the 11th grade GVE task, watch the video:

Solving a problem about an algorithm that constructs the number R

6_11: Task 6 Unified State Exam in Computer Science 2017 FIPI option 2 (Krylov S.S., Churkina T.E.):

N R in the following way:

1. 4N.

• all the digits of the binary notation are added, and the remainder of dividing the sum by 2 added to the end of the number (on the right). For example, record 10000 converted to record 100001 ;
• The same actions are performed on this entry - the remainder of the division of the sum of digits by is added to the right 2 .

The record obtained in this way is a binary record of the desired number R.

Enter the smallest number N, for which the result of the algorithm is greater 129 . In your answer, write this number in the decimal number system.

✍ Solution:

• Please note that after completing the second step of the task, only even numbers will be obtained! The smallest possible even number greater than 129, is the number 130 . We will work with him.
• Let's translate 130 to binary number system:

130 10 = 10000010 2

This binary number was obtained from the original binary number after the remainder of the sum of the digits was added twice 2 . Those.:

in reverse order: it was 1000001 -> became 10000010 the same thing again: it was 100000 -> became 1000001

This means that the binary number we need is 100000 .

Let's translate 100000 to the 10th system:

100000 2 = 32 10

Since according to our condition 4*N, That 32 divide by 4 — > 8 .

Result: 8

For a more detailed analysis, we suggest watching the video of the solution to this 6th task of the Unified State Exam in computer science:

6_12: 6 task. Demo version of the Unified State Exam 2018 computer science:

The input of the algorithm is a natural number N. The algorithm constructs a new number from it R in the following way.

1. Constructing a binary number N.
2. Two more digits are added to this entry on the right according to the following rule:
3. add up all the digits of a binary number N, and the remainder of dividing the sum by 2 is added to the end of the number (on the right). For example, record 11100 converted to record 111001 ;
4. The same actions are performed on this entry - the remainder of dividing the sum of its digits by 2 is added to the right.

The record obtained in this way (it has two digits more than in the record of the original number N) is a binary record of the desired number R.

Specify the minimum number R, which exceeds the number 83 and may be the result of this algorithm. In your answer, write this number in the decimal number system.

✍ Solution:

• Note that after the second point of the problem conditions, only even numbers are obtained (since if a number in the binary system ends with 0 , then it is even). Thus, we will only be interested in even numbers.
• The smallest possible number greater than 83, is the number 84 . We will work with him.
• Let's translate 84 to binary number system:

84 = 10101 00

N 10101 . After the first point of the problem, a unit should have been added to the right of this number, since it is odd. And we have 0 . Accordingly, it is not suitable.

Let's take the following even number - 86 . Let's convert it to the binary number system:

86 = 10101 10

In this number, the highlighted part is N. This means that the binary number we need is 10101 . After the first point of the problem, this number should have been added to the right unit, that's right: 10101 1 . And then it is added 0 : 1010110 . Accordingly, it fits.

Result: 86

For a detailed solution to this 6th task from the demo version of the Unified State Exam 2018, watch the video:

6_13: Analysis of the 6th task of the Unified State Exam option No. 1, 2019 Computer science and ICT Typical exam options (10 options), S.S. Krylov, T.E. Churkina:

The input of the algorithm is a natural number N. The algorithm constructs a new number from it R in the following way:

1. Constructing a binary number N.
2. Two more digits are added to this entry on the right according to the following rule:
- If N divisible by 4 zero and then another one zero;
- If N when divided by 4 gives the remainder 1 zero, and then unit;
- If N when divided by 4 gives the remainder 2 , then the end of the number (on the right) is added first one, and then zero;
- If N when divided by 4 gives the remainder 3 , at the end of the number (on the right) is added first one and then another one unit.

For example, the binary notation 1001 of the number 9 would be converted to 100101, and the binary notation 1100 of the number 12 would be converted to 110000.

The record obtained in this way (it contains two digits more than in the record of the original number N) is a binary representation of a number R- the result of this algorithm.

Specify the maximum number R, which less than 100 and may be the result of this algorithm. Write this number down in your answer. in decimal number system.

✍ Solution:

• Since we need to find the largest number, we take the largest possible number that - this is the number 99 . Let's convert it to binary:

99 = 1100011 2

According to the algorithm, this number was obtained by adding two digits to the right, the value of which depends on the original N:

11000 11 N

Those. at the end two units were added - according to the algorithm, this means that the original N must be the remainder when divided by 4 give 3 . Let's convert the found N to the decimal system:

11000 = 24 10

24 divided by 4 completely, i.e. at the end, according to the algorithm, two digits should have been added - 00 . At the end we have 11 . Those. number 99 doesn't fit. Let's check the following - 98 .

98 = 11000 10 2: 10 at the end added by the algorithm N = 11000 2 = 24 10 24 divided by 4. According to the algorithm at the end there should be 00 , and we have 10 98 - does not fit 97 = 11000 01 2: 01 at the end added by the algorithm N = 11000 2 = 24 10 24 divided by 4. According to the algorithm at the end there should be 00 , and we have 01 97 - does not fit 96 = 11000 00 2:00 at the end was added by the algorithm N = 11000 2 = 24 10 24 divided by 4. According to the algorithm at the end there should be 00 , we have 00 - that's right! 96 - fits!

Result: 96

We invite you to watch the video solution:

The Unified State Exam in Informatics consists of 27 tasks. Task 6 tests the skills of analysis and construction of algorithms for various performers. The student must be able to compose algorithms from given commands, as well as check sequences for compliance with the algorithms. Here you can learn how to solve task 6 of the Unified State Exam 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) Unified State Examination task 10 (7) Unified State Examination task 11 (1) Unified State Examination task 12 (3) Unified State Examination task 13 (7) Unified State Examination task 16 (19) Unified State Examination task 17 (4) Unified State Examination without number (9)

The performer Kvadrator has two commands: add 3 and square

The performer Kvadrator 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 your answer, write down only the command numbers. If there is more than one such algorithm, then write down any of them.

The decipherer needs to recover the damaged message fragment

The decryptor needs to restore the damaged message fragment, consisting of 4 characters. There is reliable information that no more than five letters were used (A, B, C, D, E), with one of the symbols in third place... One of the letters in fourth place... One of the letters in first place ... On the second - ... Additional information has appeared that one of four options is possible. Which?

The task is included in the Unified State Examination in computer science for grade 11 under number 6.

There are two windows on the screen, each of which contains a number

There are two windows on the screen, each of which contains a number. The Adder performer has two commands, which are assigned numbers: 1 – write the sum of numbers in the first window; 2 – write the sum of numbers in the second window. By executing the first of them, the Adder adds the numbers in the windows and replaces the number in the first window with this sum, and by executing the second, it adds the numbers and replaces the number in the second window with this sum. Write down the order of commands in the program for obtaining from a pair of numbers A and B a pair of numbers C and D, containing no more than K commands, indicating only the command numbers.

The task is included in the Unified State Examination in computer science for grade 11 under number 6.

The Calculator performer has two teams, which are assigned numbers

The Calculator performer has two commands, which are assigned numbers: 1 – add 2, 2 – multiply by 3. By executing the first of them, the Calculator adds 2 to the number on the screen, and by executing the second, it triples it. Write down the order of commands in the program for obtaining number B from A, containing no more than K commands, indicating only the command numbers.

The task is included in the Unified State Examination in computer science for grade 11 under number 6.

Chains of characters (strings) are created according to the following rule

Chains of characters (strings) are created according to the following rule. The first line consists of... Each of the subsequent chains is created by such actions... Here are the first 4 lines created by this rule. What character is in the K line in the Nth place (counting from left to right)?

The task is included in the Unified State Examination in computer science for grade 11 under number 6.

1. Task 6 No. 6. ExecutorDraftsman moves on the coordinate plane, leaving a trace in the form of a line. The draftsman can execute the commandMove to ( a , b ) (Wherea, b (x, y) to the point with coordinates(x + a, y + b) . If the numbersa, b

(4, 2) , then the command Move to (2, −3) (6, −1).

Record

Repeat k times

Team1 Team2 Team3

End

Team1 Team2 Team3 will happen againk once.

Repeat 2 times

Move by (−6, −4)

Team1 ?

1) Shift to (−2, −1) 2) Shift to (1, 1) 3) Shift to (−4, −2) 4) Shift to (2, 1)

2. Task 6 No. 26. The draftsman was given the following algorithm to execute:

Repeat 4 times

Command1 Move to (3, 3) Move to (1,−2) End

Shift by (−8, 12)

After completing this algorithm, the Draftsman returned to the starting point. What command should be put instead of the commandTeam1 ?

1) Shift by (−2, −4) 2) Shift by (4,−13) 3) Shift by (2, 4) 4) Shift by (−8, −16)

3. Task 6 No. 46. The draftsman was given the following algorithm to execute:

Repeat 3 times

Move to (3, 9)

After completing this algorithm, the Draftsman returned to the starting point. What command should be put instead of the commandTeam1 ?

1) Shift by (3, 4) 2) Shift by (−5, −10) 3) Shift by (−9, −12) 4) Shift by (−3, −4)

4. Task 6 No. 66. The draftsman was given the following algorithm to execute:

Repeat 3 times

Command1 Move to (3, 2) Move to (2, 1) End

Move to (−9, −6)

After completing this algorithm, the Draftsman returned to the starting point. What command should be put instead of the commandTeam1 ?

1) Shift to (−6, −3) 2) Shift to (4, 3) 3) Shift to (−2, −1) 4) Shift to (2, 1)

5. Task 6 No. 86. The draftsman was given the following algorithm to execute:

Repeat 2 times

Shift by (4, −6)

After completing this algorithm, the Draftsman returned to the starting point. What command should be put instead of the commandTeam1 ?

1) Shift by (6, −2) 2) Shift by (−8, 5) 3) Shift by (−12, 4) 4) Shift by (−6, 2)

6. Task 6 No. 106. The draftsman was given the following algorithm to execute:

Repeat 4 times

Command1 Move to (1, 3) Move to (1, −2) End

Shift by (−4, −12)

After completing this algorithm, the Draftsman returned to the starting point. What command should be put instead of the commandTeam1 ?

1) Shift to (1,−2) 2) Shift to (12, 4) 3) Shift to (2, 11) 4) Shift to (−1, 2)

7. Task 6 No. 126. The draftsman was given the following algorithm to execute:

Repeat 4 times

Command1 Move to (3, 2) Move to (2, 1) End

Move to (−12, −8)

After completing this algorithm, the Draftsman returned to the starting point. What command should be put instead of the commandTeam1 ?

1) Shift to (−8, −4) 2) Shift to (−2, −1) 3) Shift to (7, 5) 4) Shift to (2, 1)

Task 6. Algorithm for a specific executor with a fixed set of commands

8. Task 6 No. 146. ExecutorTurtle moves on the computer screen, leaving a trace in the form of a line. At each specific moment, the position of the performer and the direction of his movement are known. The performer has two commands:Forward n Right m (where m is an integer), causing a change in the direction of movement by m degrees clockwise.

Record

Repeat 9 [Forward 50 Right 60]

regular 6-gon 2) regular triangle 3) open broken line 4) regular 9-gon

9. Task 6 No. 166. The turtle was given the following algorithm to execute:Repeat 7 [Forward 70 Right 120] .

regular 6-gon 2) open broken line 3) regular 7-gon 4) regular triangle

10. Task 6 No. 186. The turtle was given the following algorithm to execute:Repeat 9 [Forward 70 Right 90] . What shape will appear on the screen?

1) open broken line 2) regular ninegon 3) regular octagon

4) regular quadrilateral

11. Task 6 No. 206. The turtle was given the following algorithm to execute:Repeat 5 [Forward 80 Right 60] . What shape will appear on the screen?

regular pentagon 2) regular triangle 3) regular hexagon 4) open broken line

12. Task 6 No. 226. The turtle was given the following algorithm to execute:Repeat 5 [Forward 80 Right 90] . What shape will appear on the screen?

1) open polyline 2) regular hexagon

3) regular pentagon 4) regular quadrilateral

13. Task 6 No. 246. The turtle was given the following algorithm to execute:Repeat 5 [Forward 100 Right 120] What shape will appear on the screen?

1) regular pentagon 2) open broken line

3) regular hexagon 4) regular triangle

14. Task 6 No. 266. The turtle was given the following algorithm to execute:Repeat 5 [Forward 100 Right 60] What shape will appear on the screen?

1) regular triangle 2) regular hexagon

3) regular pentagon 4) open broken line

Task 6. Algorithm for a specific executor with a fixed set of commands

15. Task 6 No. 286. 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 numbersa, b positive, the value of the corresponding coordinate increases; if negative, it 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).

Record

Repeat k times

Team1 Team2 Team3

End

means that the sequence of commandsTeam1 Team2 Team3 will happen againk once.

The draftsman was given the following algorithm to execute:

Repeat 3 times

Command1 Move to (3, 3) Move to (1, −2) End

Shift by (−6, 9)

After completing this algorithm, the Draftsman returned to the starting point. What command should be put instead of the commandTeam1 ?

1) Shift by (−6, −12) 2) Shift by (2, −10) 3) Shift by (2, 4) 4) Shift by (−2, −4)

16. Task 6 No. 306. The draftsman was given the following algorithm to execute:

Repeat 2 times

Command1 Move to (1, 3) Move to (1, −2) End

Move to (2, 6)

After completing this algorithm, the Draftsman returned to the starting point. What command should be put instead of the commandTeam1 ?

1) Shift by (− 6, − 8) 2) Shift by (3, 4) 3) Shift by (− 4, − 7) 4) Shift by (− 3, − 4)

17. Task 6 No. 326. The draftsman was given the following algorithm to execute:

Repeat 3 times

Shift to (−2, −1) Shift to (3, 2) Shift to (2,1) End

1) Shift to (−9, −6) 2) Shift to (6, 9) 3) Shift to (−6, −9) 4) Shift to (9, 6)

18. Task 6 No. 347. 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

1) Shift to (−16, −8) 2) Shift to (16, 8) 3) Shift to (16, −8) 4) Shift to (−16, 8)

19. Task 6 No. 367. The draftsman was given the following algorithm to execute:

Repeat 3 times

Shift to (1, 1) Shift to (2, 2) Shift to (1, −3) End

What command must the Draftsman execute in order to return to the starting point from which he started moving?

1) Shift to (12, 0) 2) Shift to (0, 12) 3) Shift to (0, -12) 4) Shift to (-12, 0)

20. Task 6 No. 387. The draftsman was given the following algorithm to execute:

Repeat 5 times

Shift to (1, 2) Shift to (−2, 2) Shift to (2, −3) End

What command must the Draftsman execute in order to return to the starting point from which he started moving?

1) Shift by (−5, −2) 2) Shift by (−3, −5) 3) Shift by (−5, −4) 4) Shift by (−5, −5)

Task 6. Algorithm for a specific executor with a fixed set of commands

21. Task 6 No. 407. Performer The draftsman moves on the coordinate plane, leaving a trace in the form of a line. The draftsman can execute the commandMove 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 numbersa, 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).

Record

Repeat k times

Team1 Team2 Team3

End

means that the sequence of commandsTeam1 Team2 Team3 will happen againk once.

The draftsman was given the following algorithm to execute:

Repeat 7 times

Shift to (−1, 2) Shift to (−5, 2) Shift to (4, −4) End

What command must the Draftsman execute in order to return to the starting point from which he started moving?

1) Shift to (14, 0) 2) Shift to (15, 1) 3) Shift to (16, 2) 4) Shift to (17, 3)

22. Task 6 No. 427. The draftsman was given the following algorithm to execute:

Repeat 3 times

Shift to (−1, 0) Shift to (0, 2) Shift to (4, −4) End

What command must the Draftsman execute in order to return to the starting point from which he started moving?

Shift to (6, 0) 2) Shift to (−6, 2) 3) Shift to (−9, 6) 4) Shift to (9, 3)

23. Task 6 No. 447. The draftsman was given the following algorithm to execute:

Repeat 7 times

Shift to (−1, 2) Shift to (−2, 2) Shift to (4, −4) End

What are the coordinates of the point from which the Draftsman began his movement if he ended up at a point with coordinates (0, 0)?

1) (7, 0) 2) (−7, 0) 3) (0, −7) 4) (0, 7)

24. Task 6 No. 467. The draftsman was given the following algorithm to execute:

Repeat 7 times

Shift to (−1, 2) Shift to (−2, 2) Shift to (4, −5) End

What are the coordinates of the point from which the Draftsman began his movement if he ended up at a point with coordinates (1, 1)?

1) (6, 8) 2) (−6, 8) 3) (8, −6) 4) (8, 6)

25. Task 6 No. 487. The draftsman was given the following algorithm to execute:

Repeat 5 times

What are the coordinates of the point from which the Draftsman began his movement if he ended up at a point with coordinates (−1, −1)?

1) (−11, 4) 2) (4, −11) 3) (8, 22) 4) (22, 8)

26. Task 6 No. 507. The draftsman was given the following algorithm to execute:

Repeat 5 times

Shift to (0, 1) Shift to (−2, 3) Shift to (4, −5) End

The coordinates of the point from which the Draftsman began his movement are (3, 1). What are the coordinates of the point where he ended up?

Task 6. Algorithm for a specific executor with a fixed set of commands

27. Task 6 No. 527. 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).

Record

Repeat k times

Team1 Team2 Team3

End

means that the sequence of commands Team1 Team2 Team3 will happen again k once.

The draftsman was given the following algorithm to execute:

Repeat 5 times

Shift to (0, 1) Shift to (−1, 4) Shift to (3, −6) End

The coordinates of the point from which the Draftsman started moving are (4, 0). What are the coordinates of the point where he ended up?

1) (15, −6) 2) (14, −5) 3) (13, −4) 4) (12, −3)

28. Task 6 No. 547. The draftsman was given the following algorithm to execute:

Move by (−1,1) Repeat 4 times

Shift to (3,1) Shift to (0, 2) Shift to (−1, 4) end

1) Shift to (8, 28) 2) Shift to (7, 29) 3) Shift to (−8, −28) 4) Shift to (−7, −29)

29. Task 6 No. 567. The draftsman was given the following algorithm to execute:

Move to (−5, 2) Repeat 5 times

Shift to (2, 0) Shift to (−3, −3) Shift to (−1, 0) end

What command can this algorithm be replaced with?

1) Shift by (−10, −15) 2) Shift by (15, 13)

3) Shift to (10, 15) 4) Shift to (−15, −13)

30. Task 6 No. 587. Forward n (where n is an integer), causing the Turtle to move n steps in the direction of movement; Right m Repeat k [Command1 Command2 Command3] means that the sequence of commands in brackets will be repeated k times.

The turtle was given the following algorithm to execute: Repeat 180 [Forward 45 Right 90] . What shape will appear on the screen?

1) regular 180-gon 2) square 3) regular octagon 4) open broken line

31. Task 6 No. 607. The turtle was given the following algorithm to execute: Repeat 360 [Forward 30 Right 60] . What shape will appear on the screen?

1) regular 360-gon 2) regular triangle

3) regular 6-gon 4) open polyline

Task 6. Algorithm for a specific executor with a fixed set of commands

32. Task 6 No. 627.

Record

Repeat k times

Team1 Team2 Team3

End

means that the sequence of commands Team1 Team2 Team3 will be repeated k times. If an Ant encounters a cube on its way, it moves it along the way. Let, for example, the cube be in cell E4. If the Ant follows the commands right 2 down 2 , then he himself will end up in a cage EZ , and the cube is in the cage E2 .

Repeat 2 times

Right 2 down 1 left 2

End

1) D2 2) E2 3) E1 4) GZ

33. Task 6 No. 647. Let the Ant and the cube be positioned as shown in the picture. The ant was given the following algorithm to execute:

Repeat 4 times

Down 2 right 1 up 2

End

In which cell will the cube end up after executing this algorithm?

1) G6 2) E4 3) D1 4) E6

34. Task 6 No. 667.

Down 4

Repeat 3 times

Right 1 up 1 left 1

1) COM 2) SCRAP 3) HOUSE 4) TOM

35. Task 6 No. 687. Let the Ant and the cubes be arranged as shown in the picture. The ant was given the following algorithm to execute:

Down 3

Repeat 2 times

Right 1 up 1 left 1

What word will be written in line 6 after executing this algorithm?

1) COM 2) SCRAP 3) HOUSE 4) TOM

Task 6. Algorithm for a specific executor with a fixed set of commands

36. Task 6 No. 707. Performer The draftsman moves on the coordinate plane, leaving a trace in the form of a line. The draftsman can execute the commandMove to ( a, b ) (Wherea, b - integers), moving the Draftsman from the point with coordinates(x, y) to the point with coordinates(x + a, y + b) . If the numbersa, b positive, the value of the corresponding coordinate increases; if negative, it 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).

Record

Repeat k times

Team1 Team2 Team3

End

means that the sequence of commandsTeam1 Team2 Team3 will happen againk once.

The draftsman was given the following algorithm to execute:

Repeat 3 times

Shift by (−2, −3) Shift by (3, 2) Shift by (−4,0)

End

What one command can this algorithm be replaced with so that the Draftsman ends up at the same point as after executing the algorithm?

1) Shift to (−9, −3) 2) Shift to (−3, 9) 3) Shift to (−3, −1) 4) Shift to (9, 3)

37. Task 6 No. 750. Performer Ant moves across a field divided into cells. The field size is 8x8, rows are numbered, columns are designated by letters. An ant can execute movement commands:

Up N, Down N, Right N, Left N (N is an integer from 1 to 7), moving the performer N cells up, down, right or left, respectively.

Record

Repeat k times

Team1 Team2 Team3

kts

means that the sequence of commandsTeam1 Team2 Team3 will be repeated k times. If an Ant encounters a cube on its way, it moves it along the way. For example, let the cube be in a cellG2 , and the ant is in a cageD 2 . If the Ant follows the commandleft 2 , then he himself will end up in a cageAT 2 , and the cube is in the cageB2 .

Let the Ant and the cube be positioned as shown in the picture. The ant was given the following algorithm to execute:

Repeat 3 times

down 1 left 1 up 1 right 1 up 1

kts

In which cell will the cube end up after executing this algorithm? 1) B5 2) G5 3) G4 4) D5

38. Task 6 No. 770. Let the Ant and the cube be positioned as shown in the picture. The ant was given the following algorithm to execute:

repeat 2 times

up 1 left 2 down 1

kts

In which cell will the cube end up after executing this algorithm?

1) B5 2) B5 3) A5 4) B4

39. Task 6 No. 802. The draftsman was given the following algorithm to execute:

Move to (3, 2)

Repeat 3 times

Shift by (1, –1) Shift by (2, –3) Shift by (4, 0)

End

1) Shift by (–21, 12) 2) Shift by (21, –12) 3) Shift by (–24, 10) 4) Shift by (24, –10)

40. Task 6 No. 822. The draftsman was given the following algorithm to execute:

Shift by (−2, 1)

Repeat 2 times

Shift to (0, 5) Shift to (2, 1) Shift to (4, 6)

End

Which of the following commands moves the Draftsman to the same point as the given algorithm?

1) Shift by (10, 25) 2) Shift by (–10, –25) 3) Shift by (12, 24) 4) Shift by (–12, –24)

41. Task 6 No. 844. The draftsman was given the following algorithm to execute:

Shift by (–4, 8)

Repeat 4 times

Command1 Move to (–2, –5) Move to (4, 6)

end

1) Shift by (2, –9) 2) Shift by (–1, –3) 3) Shift by (1, 3) 4) Shift by (–3, –1)

Task 6. Algorithm for a specific executor with a fixed set of commands

42. Task 6 No. 864. 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, it decreases.

For example, if the Draftsman is at a point with coordinates (1, 1), then the command Shift by (–2, 4) will move it to point (–1, 5).

Record

Repeat k times

Team1 Team2 Team3

End

means that the sequence of commands Team1 Team2 Team3 will be repeated k times.

The draftsman was given the following algorithm to execute:

Move by (–3, –6)

Repeat 3 times

Command1 Move to (2, –5) Move to (3, 3)

end

What command should the Draftsman execute instead of Command1 in order to return to the starting point from which he started moving?

1) Shift by (–4, –4) 2) Shift by (–2, 8) 3) Shift by (4, –4) 4) Shift by (–4, 4)

43. Task 6 No. 885. The draftsman was given the following algorithm to execute:

Shift by (–3, 1)

Repeat 2 times

Shift by (1, 1) Shift by (−3, 2) Shift by (0, −4)

End

1) Shift to (–7,–1) 2) Shift to (7, 1) 3) Shift to (–4,–2) 4) Shift to (4, 2)

44. Task 6 No. 905. The draftsman was given the following algorithm to execute:

Move to (2, 6)

Repeat 2 times

Shift by (2, 1) Shift by (–5, 4) Shift by (1,–4)

End

What command must the Draftsman execute in order to return to the starting point from which he started moving?

1) Shift by (4, –2) 2) Shift by (–4, 2) 3) Shift by (2, –8) 4) Shift by (–2, 8)

45. Task 6 No. 925. The draftsman was given the following algorithm to execute:

Move to (1, 3)

Repeat 4 times

Shift by (0, 2) Shift by (3, 1) Shift by (–4, –4)

End

What command must the Draftsman execute in order to return to the starting point from which he started moving?

1) Shift to (–3, –1) 2) Shift to (3, 1) 3) Shift to (–4, –4) 4) Shift to (4, 4)

46. ​​Task 6 No. 945. The draftsman was given the following algorithm to execute:

Move to (2, –7)

Repeat 6 times

Shift by (0, 1) Shift by (–1, 1) Shift by (–2, 2)

End

What command must the Draftsman execute in order to return to the starting point from which he started moving?

1) Shift by (–18, 24) 2) Shift by (18, –24) 3) Shift by (16, –17) 4) Shift by (–16, 17)

Task 6. Algorithm for a specific executor with a fixed set of commands

47. Task 6 No. 1017. Performer The turtle moves on the computer screen, leaving a trace in the form of a line. At each specific moment, the position of the performer and the direction of his movement are known. The performer has two commands: Forward n (where n is an integer), causing the Turtle to move n steps in the direction of movement; Right m (where m is an integer), causing a change in the direction of movement by m degrees clockwise. RecordRepeat k [Command1 Command2 Command3] means that the sequence of commands in brackets will be repeated k times.

When performing which of the following algorithms did a regular triangle appear on the screen?

1) Repeat 3 [Forward 50 Right 20 Right 25] 2) Repeat 3 [Forward 50 Right 100 Right 20]

3) Repeat 6 [Forward 50 Right 10 Right 20] 4) Repeat 6 [Forward 50 Right 20 Right 40]

48. Task 6 No. 1037. When performing which of the following algorithms did a regular hexagon appear on the screen?

1) Repeat 6 [Forward 100 Right 90] 2) Repeat 6 [Forward 100 Right 9]

3) Repeat 6 [Forward 100 Right 60 Right 60] 4) Repeat 6 [Forward 100 Right 20 Right 40]

49. Task 6 No. 1057. The turtle was given the following algorithm to execute:

Repeat 6 [Forward 5 Right 30]

What shape will appear on the screen?

1) open broken line 2) regular triangle

3) regular 5-gon 4) regular 6-gon

50. Task 6 No. 1077. The turtle was given the following algorithm to execute:

What shape will appear on the screen?

1) square 2) regular 12-gon 3) regular octagon 4) open broken line

51. Task 6 No. 1100. Performer The draftsman moves on the coordinate plane, leaving a trace in the form of a line. The Draftsman can issue the Move to (a, b) command (where a, b are integers), which moves the Draftsman from a point at coordinates (x, y) to a point at coordinates (x + a, y + b). If the numbers a, b are positive, the value of the corresponding coordinate increases, if they are negative, it decreases.

For example, if the Draftsman is at a point with coordinates (4, 2), then the Move to (2, –3) command will move the Draftsman to the point (6, –1). Record

Repeat k times

Team1 Team2 Team3

End means that the sequence of commands Command1 Command2 Command3 will be repeated k times.

The draftsman was given the following algorithm to execute:

Repeat 3 times

Shift by (–2, –1) Shift by (3, 2) Shift by (2, 1)

End

What command does the Draftsman need to execute in order to return to the starting point from which he started moving?

1) Shift to (9, 6) 2) Shift to (–6, –9) 3) Shift to (6, 9) 4) Shift to (–9, –6)

52. Task 6 No. 1120. The draftsman was given the following algorithm to execute:

Repeat 3 times

Shift by (1, 3) Shift by (–2, –5)

end

Move to (4, 8)

1) Shift by (–1, 2) 2) Shift by (–1, –2) 3) Shift by (1, –2) 4) Shift by (–2, 1)

53. Task 6 No. 1140. The draftsman was given the following algorithm to execute:

Shift by (–3, 1)

Repeat 2 times

Shift by (1, 1) Shift by (−3, 2) Shift by (0,−4)

End

What command does the Draftsman need to execute in order to return to the starting point from which he started moving?

1) Shift to (4, 2) 2) Shift to (–4, –2) 3) Shift to (7, 1) 4) Shift to (–7, –1)

Task 6. Algorithm for a specific executor with a fixed set of commands

54. Task 6 No. 1160. Performer The turtle moves on the computer screen, leaving a trace in the form of a line. At each specific moment, the position of the performer and the direction of his movement are known. The performer has two commands: Forward n (where n is an integer), causing the Turtle to move n steps in the direction of movement; Right m (where m is an integer), causing a change in the direction of movement by m degrees clockwise. RecordRepeat k [Command1 Command2 Command3] means that the sequence of commands in brackets will be repeated k times.

The turtle was given the following algorithm to execute: Repeat 12 [Right 45 Forward 20 Right 45] . What shape will appear on the screen?

1) open broken line 2) regular 12-gon 3) square 4) regular octagon

55. Task 6 No. 1239. Performer The draftsman moves on the coordinate plane, leaving a trace in the form of a line. The draftsman can execute the command Shift to (a, b ) (Where a, b - integers), moving the Draftsman from a point with coordinates (x, y) to a point with coordinates (x + a, y + b ). If the numbers a, b positive, the value of the corresponding coordinate increases, if negative, it decreases. For example, if the Draftsman is at a point with coordinates (4, 2), then the Move to (2, –3) command will move the Draftsman to the point (6, –1).

Record

Repeat k times

Team1 Team2 Team3

End

means that the sequence of commands Team1 Team2 Team3

will happen again k once.

The draftsman was given the following algorithm to execute:

Repeat 2 times

Shift by (–3, –4) Shift by (3, 3) Shift by (1, –2)

End

What is the only command that the Draftsman must execute in order to return to the starting point from which he started?

1) Shift by (2, –6) 2) Shift by (–6, 2) 3) Shift by (6, –2) 4) Shift by (–2, 6)

56. Task 6 No. 1259. The draftsman was given the following algorithm to execute:

Repeat 3 times

Shift by (–2, –3) Shift by (3, 4)

end

Shift by (–4, –2)

What command must the Draftsman execute in order to return to the starting point from which he started moving?

1) Shift by (1, –1) 2) Shift by (–3, –1) 3) Shift by (–3, –3) 4) Shift by (–1, 1)

Similar articles