Programming algorithms of spinning

Слайд 2

Algorithm group

. Pascal
group

Let's divide the group before starting the lesson.

Algorithm group . Pascal group Let's divide the group before starting the lesson.

Слайд 3


"Unlock!" game

Who has provided Pascal programming language?

What is the word

"Unlock!" game Who has provided Pascal programming language? What is the word
CONST in the program?

The last and main part of the program

How many types of algorithms do you have?
Example of a linear algorithm

How many parts do the program consist of in Pascal?

What is a linear algorithm?

What is an algorithm?

А

Л

М

Г

О

Р

И

Т

Слайд 4

Types of algorithms

Linear or serial algorithm
Cyclic or repeating algorithms

Spell-checking or conditional algorithms

Types of algorithms Linear or serial algorithm Cyclic or repeating algorithms Spell-checking or conditional algorithms

Слайд 5

Linear algorithm

The linear algorithm is the algorithm for each and if

Linear algorithm The linear algorithm is the algorithm for each and if
all of them are bread to the end, sequentially one after the other performance.

Слайд 6

Cyclic algorithm

Most algorithms are definite actions The chain is repeated several

Cyclic algorithm Most algorithms are definite actions The chain is repeated several
times  Part of the calculation process Repeated execution is called cycles

Слайд 7

Branching algorithm

Branching algorithm

Слайд 10

Block diagram

Complete bundle type

The "choice" block

Block diagram Complete bundle type The "choice" block

Слайд 11

Software


max := a;

max := b;

шартты оператордың толымды түрі

program qq;
var a, b, max:

Software max := a; max := b; шартты оператордың толымды түрі program
integer;
begin
writeln(‘Екі бүтін сан енгіз');
read ( a, b );
if a > b then begin
end
else begin
end;
writeln (‘Екі санның үлкені', max);
end.

Слайд 12

Conditional operator

if < contract > then begin
{what to do if the

Conditional operator if then begin {what to do if the condition is
condition is met}
end
else begin
{What to do if the condition is not met}
end;

Specifications: else should not have semicolons before else the second part (else ...) may also be absent (full type) If there is only one operator in the block, you can also skip the start and end words

Слайд 13

Where's the wrong place?

if a > b then begin
a := b;

Where's the wrong place? if a > b then begin a :=

end
else
b := a;
end;

if a > b then begin
a := b;
else begin
b := a;
end;

if a > b then begin
a := b;
end;
else begin
b := a;
end;

if a > b then begin
a := b;
end
else b > a begin
b := a;
end;

begin

end

begin

end

Слайд 14

REPORTING, RESULTS IN PASCAL

REPORTING, RESULTS IN PASCAL

Слайд 15

Wormwood

The beginning of the main program
Release operator
Title of

Wormwood The beginning of the main program Release operator Title of the
the program
The type of an integer
An algorithm that does not change the value of a value
Symbolic value
Input operator 8. End of the program

Слайд 16

Answers:
1.Begin
2. Write
3. program
4. integer
5. const
6. char

Answers: 1.Begin 2. Write 3. program 4. integer 5. const 6. char 7. Readln 8.End

7. Readln
8.End

Слайд 17

Refreshing Moment to Spreading Algorithm 1. If you do not work,

Refreshing Moment to Spreading Algorithm 1. If you do not work, ........................
........................ 2. If you are not satisfied with everything, then ...... .......... 3. If you do both work simultaneously, ........................

Слайд 18

Resolve the rebounds

Resolve the rebounds

Слайд 19

Test tasks

Test tasks
Имя файла: Programming-algorithms-of-spinning.pptx
Количество просмотров: 50
Количество скачиваний: 0