What is the disorganization of computer science?

The elements of the algorithm are displayed on a block diagram with the help of various geometric figures, in the middle of which the program code is written

Vikonanny operations / The choice is directly connected to the algorithm, which is due to some of the most brilliant minds

Introduction

tributes

The beginning and end of the algorithm

Software method (algorithmic)

The algorithm used for recording on a computer is guilty of recordings in a wise way.

Such a language is called my programming, the command written down by me is called an operator, and the record of the algorithm is called a program.

Types of algorithms

Based on the order in which the commands are written, three types of algorithms can be seen:

Such a language is called my programming, the command written down by me is called an operator, and the record of the algorithm is called a program. Linear algorithm

Algorithms for uninstallation (uninstallation)

Algorithms based on repetition (cyclic)

- this is an algorithm in which all operations are sequenced one after another

Application of the linear algorithm

"Make a Snowman" Factory

Algorithm "snowman"

1. Make a big pile of snow and place it on the ground.

2.Grip another ball, smaller than the first one, and place it on the first ball.

3. Glue the third bag together, one at a time, and place it on the other bag.

4. Place the bucket on the third bag.

5. Earn eyes from the lobes on the third spot.

Our children repeated those who told us about the fate of the past.

Open the door and write down today's date.

And now respect for the rest.

“Tinkle” stage

Guess the given propositions using the verb.

If two people work at the same time, then nothing will come of it (If you marry two birds with one stone, you won’t harm anyone).

If you work on the right, without rushing, then you will finish (The quieter you go, the slower you will be).

If you don’t work, you won’t cook fish (without pratsi you won’t get fish for a fee).

What's so good about these formulas?

Something like that

This construction describes the algorithm that is designed.

Guys, what do you think is the topic of our lesson today?

The topic of our lesson today is “Operators of unwinding”. Apply (if the weather is bad, then I take a parasol; if it’s a physical education lesson, then I put on a tracksuit, etc.)And now we are starting to create posters on a new topic. Work hour 10 minutes, after completing the skin group, present your poster.

Rozgaluzhuvaniy algorithm called

algorithm , Whoever has to remember either one or another sequence of actions in his mind.

Umova - This is a firm thing that can be said: truly it is terrible.. Rozgaluzhennya.

algorithm

– this is a form of organization of actions, if the conclusion and the conclusion of the mind are determined at the same time as the other sequence of actions.

There are two forms of the operator If Even that is shortened;

To unite several teams, a warehouse operator is hired.

Forming new skills and making them smarter.

Yogo scheme:

begin

operator

end

And now we’ll marvel at how this operator works at the peak of his task.

Write down your mind.

There are two forms of the operator

Challenge: Build a program to find the greater of two numbers.

Guys, what have we been given for this task?

What result can we expect?

And so we begin to write a program.

Program z1;

var a, b: integer;

writeln('vvedite a');

readln(a);

writeln('vvedite b');

readln(b);

if a>b then

writeln(a)

else

writeln(b);

readln;

end.

And now it’s important that this program is installed on a computer.

In order for the computer to work for us, you need to learn how to write programs correctly. On your desktop there is a simulator “uninstallation operator”.

Open it and go to your given number:

Zavdannya No. 1, No. 2, No. 4, No. 6, No. 7, No. 8, No. 9, No. 10, No. 11, No. 12.

algorithm- this is an algorithmic design in which the other sequence of actions is determined in the mind.

The structure of the algorithm that prevents confusion is called What's wrong with me.

This structure will ensure a choice between two alternatives.

To determine this directly, in those who are far away from Vikonanny, a mind check is carried out.

Every path is led to the final point of anger, and the following algorithm will be followed regardless of the path of elections.

In the flowchart, the mental alignment is displayed in a rhombus, from which TWO arrows come out – the first one (the “So” arrow) indicates the commands that will be terminated at the same time as the mental alignment is completed; <условие выбора > friend (arrow “Ні”) - on commands that will be Vikonans, as their minds are not finished. <команды, выполняемые при соблюдении условия> However, situations often become more intense in life, when one of the directions of the algorithm behind the algorithm may not result in any action, but in another way, there will be a lot of action. <команды, выполняемые при несоблюдении условия>

So the algorithm for unwinding may be different (you may wonder more) or unknown. In a verbal formula, the record of dissolution looks like this: YAKSCHO THAT Otherwise What's that " Umova's choice

"? Firstly, a whole logical expression, which emerges meaning

true

(true) or

false

(falsehood).

If it's true, it's a big deal, but if it's a lie, then it's a big deal.

Let's take a look at the tasks from the collection of tasks from the programming of D.M.<условие выбора >Zlatopolsky:<команды, выполняемые при соблюдении условия>writeln('vvedite a');<команды, выполняемые при несоблюдении условия>

Zavdannya: Decision algorithm: Pascal Brain operator

Full form

Let's take a look at the tasks from the collection of tasks from the programming of D.M.<условие выбора >Zlatopolsky:<команды, выполняемые при соблюдении условия>;

if:

then< меньше, >< не равно, >Respect!<=меньше или равно, = равно.

Before else:

no

don’t put a speck behind the lump!

Uneven shape
Operations
> more,
= more than one,
Logical operations
not - overlap, and - conjunction (I), or - disjunction (ABO), xor - what includes or
Zavdannya on Pascal
Program Z;
var
x, y: real;

Begin

(falsehood).

If it's true, it's a big deal, but if it's a lie, then it's a big deal.

write("Enter x=");<условие выбора >) <команды, выполняемые при соблюдении условия>read(x);<команды, выполняемые при несоблюдении условия>

Full form

write("Enter x=");<условие выбора >) <команды, выполняемые при соблюдении условия>;

if:

then< меньше, != не равно, >Respect!<=меньше или равно, == равно.

Before else:

if x>0 then y:=sqr(sin(x))

else y:=1-sin(sqr(x));

writeln("y=",y:6:4);
writeln("y=",y:6:4);
writeln("y=",y:6:4);
End.
C++
if (
;<< "Vvedite x=\n";
else
Translation, && - conjunction (І), ||
;<< "y =" << y ;
-disjunction (ABO)
Zavdannya in C++
}

#include

using namespace std; It is important to choose one of two series of commands, depending on the truth and falsehood of the singing mind.

Butt of a program of uncorked structure

Please note that there is no dot before the words then and else - they are respected by parts of one mental operator if...then...else.

In that situation with a gentle mind, daily actions are not compromised, on the block diagram on the “НІ” line, do not place the same blocks, and skip “else” in the entry of the mental operator.

Since a series consists of more than one team, it is necessary to fit it into Operator bows begin...end.

For example:

Let's take a look at the tasks from the collection of tasks from the programming of D.M.x > 0

Zlatopolsky:There are two forms of the operator

Y:=sqrt(x);

Z: = z + y;

Even that is shortened

writeln('vvedite a');z: = z + x;

If the program has a breakdown, it is necessary...

Know what options there are for this and how many options there are.

There will be one less number of smart operators, fewer options.

Know what kind of minds you have to worry about when it comes to options.

If there are more than two options, choose the sequence of the mind check.

Please use a block diagram. Write down the algorithm using my programming. Select data for testing programs (transfer data sets that allow you to check

skin

option diy).

Not dear?

Before else

y

"Ni"

Municipal budgetary lighting installation

Chervonopolyansk secondary school No. 32

Pishchanokopsky district of Rostov region

Summary of a computer science lesson in 9th grade
algorithm

prepared

computer science teacher

Mikhailova Natalia Valerievna

Lesson objectives:

enter the concept of the unstructured algorithm (povna, nepovna form)

Learn how to draw algorithms and figure them out by looking at a block diagram.

Zavdannya:

Home : understanding the development of algorithms, which are decomposed, permanent and non-continuous deconstruction, sequence of actions for the highest orders, forming the skills of creating flowcharts.

Developing: embrace the development of logical thinking, respect;

development of cognitive interest to the subject. Vikhovny:

development of the ability to connect new material with known facts; the development of independence and practice in groups, in couples and independently.

Lesson type: lesson on learning new things.

Lesson overview: combinations.

Lesson bag.

Obladnannya:

– computer, multimedia projector, multimedia presentation, lesson notes for students, tasks for independent work, emoticons for reflection (black and red)

1. Organizational moment
Hello guys!
Vranti's sun has fallen asleep,
Stretched, chuckled

I went out for a walk

The dark night will be banished.

2.Updating basic knowledge

Frontal feeding:

Give some meaning to the algorithm;

Review the power of the algorithm;

Name ways to write algorithms;

What algorithmic structures do you know?

Which algorithm is called linear?

How to depict a block diagram of a linear algorithm? 3. Formation of new knowledgeEnter the word of the teacher:
Z
Every song we choose, we can choose any algorithm.Kindly point out what linear algorithms are like in everyday life. (Learn how to apply linear algorithms)
Unfortunately, in real life, linear algorithms rarely fail. : Vranci, getting ready for school, we always marvel at the window: if we go to the road, we take the parasol with us... (The boys continue to point their butts) Such minds become sharpened in our life often.

Guess the Kazka:“On the forks of the highways lies the Great Stone, and on it there is an inscription: “ Right-handed you'll go – horse spend it, you lie to yourself; you'll go left-handed spend it, horse- to myself you'll go...

lying;
directly

– This is the name of a new type of algorithm.- What was your name?
Try giving you money.

– (An algorithm is being discussed - an algorithm in which either one or another sequence of actions is completed in the mind's eye)

Lesson topic: “Operator uninstallation”

– The form and arrangement has been lowered.

What does the stink cause?

What would you call them?

Now try to formulate the topic and purpose of our lesson:get to know the algorithmic structure of the procedure;Zlatopolsky:Learn how to draw algorithms and figure them out by looking at a block diagram.writeln('vvedite a');Full form of unwindingIFget to know the algorithmic structure of the procedure;UmovaLearn how to draw algorithms and figure them out by looking at a block diagram.Act 1diya 2(

Full form

Now try to formulate the topic and purpose of our lesson:get to know the algorithmic structure of the procedure;Zlatopolsky:Learn how to draw algorithms and figure them out by looking at a block diagram.

Yakshcho

That

otherwise

diya

Apply the selected algorithms to be developed in the form of block diagrams:

Just as swallows fly low, there will be rain, otherwise there will be no rain.

If the weather is fine, then before that, to finish my lessons, I’ll go skiing.

–2

IV.

Securing the screwed material

Zavdannya No. 1

You're hanging out at the cinema.<0 THEN y=8+x ELSE y=4*x+10

40 When you get to the cinema, you find that there are two films showing today: a new series of “Harry Potter” and a new action movie starring Sylvester Stallone.v

50 If you have tickets for the first one, then you will be amazed at him, but the fighter will be amazed.

Zavdannya2

Let's try to write a program in BASIC

Zavdannya:

10 REM

20 INPUT x

30 IF x

PRINT

END 5 Practical robot>10

Kozhen studies at the computer. 3 There is a task on the desktop, he selects one of the registered tasks and writes the program on the computer, the result is reported to the reader.<10

Zavdannya 1. Two numbers are given.

More information to square.

Zavdannya 2 Two numbers are given.

– Triple more, square less
Problem 3. Find the sum between the larger square and the smaller cube of two numbers.

Zavdannya 4. Increase the positive number by five. Zavdannya 5. Y = x

+1 x

X

X “Informatics and ICT 9”, basic course - Moscow, BINOM, 2012.

A.A.Chernov "Notes of lessons in computer science in grades 9-11", Volgograd, Vchitel, 2006.