Most often, instructions are in the form of records in the algorithmic language. It is necessary for the exact prescriptions of all steps and their implementation. There are clear differences between the school algorithmic language and programming languages. As a rule, in the first embodiment, not only a computer acts as an executor, but also another device that is capable of performing work. Any program written in an algorithmic language does not have to be technically accomplished. The implementation of all instructions in practice is a purely separate issue. Below we will also consider the description of the algorithm in the algorithmic language. It will help to understand the device of this system.
Studying at school
Often, schools learn the algorithmic language, best known as the instructional language. It gained widespread distribution due to the fact that it uses the words that are most understandable to any student. A similar language with syntax in Russian was introduced long ago, namely in the mid-1980s. It was used in order to provide a basis for schoolchildren and teach them a computer science course without a computer. This language was published in 1985 in one of the textbooks. It was also reprinted several times for special books that were intended to be taught in grades 9 and 10. The total circulation of the publication amounted to 7 million copies.
Algorithm Recording Sequence
First of all, you need to write the letter combination ALG. The following is the name of the algorithm. Then after START you need to describe a series of commands. The KOH operator indicates the end of a program.
Description of the algorithm in algorithmic language:
ALG Company
START
back
90 degrees left
forward
KOH
When writing, keywords must be underlined or highlighted in bold. To specify logical blocks, indents should be used, and if there are pair words of the beginning and the end, you must use the vertical bar, which indicates the connection.
Algorithm Design
In order to compose new instructions, you can use the old notes. Such instructions are called subsidiary. A similar algorithm can be any of all those described above. There is also the possibility that in this system an algorithm will be used additionally, which itself has received a reference to auxiliary systems.
Often when creating an instruction, there is a need to use only one algorithm as an additional one. That is why often recordings can be complex and cumbersome. But it is worth noting that the ability to send is easier than rewriting the same notes several times.
That is why in practice a standard auxiliary algorithm is often used, which is constantly subordinate to the user. The instruction may refer to itself, as well as to any other. Algorithmic language commands are designed for such actions. These instructions are called recursive.
The self-binding command is within the system itself. Such recursion is direct. Indirect is considered one where the algorithm is called in any other auxiliary instruction.
Algorithms that have a certain order of commands can constantly change depending on the results of the execution of special parts of the program. Such systems are called branching. In order to create them, you need to use a special branch command. It has an abbreviated and complete spelling scheme. Often there are cyclic algorithms that execute special commands several times.
E-workshop
In order to improve the study of the theory of grammatical language, the professionals of the Mechanics and Mathematics Department of Moscow State University in 1985 created a special compiler. It is called the "E-Workshop." With its help it was possible to enter, modify and execute programs. The following year, a specific set of performers was released. We are talking about the "Robot", "Draftsman", "Two-legged", "All-terrain vehicle." This made it simple and easy to implement algorithms. This compiler is widely distributed, has been used on some computers. For quite some time, this programming language has been refined and modified. In 1990, a later version appeared in the textbook.
Idol
Now the school algorithmic language is experiencing its rebirth, after the special “Idol” package was developed for Windows and Linux. The system works with several performers. Classical among them are "Robot", "Draftsman". The same package is included in the Linux installation file School. This system was developed specifically for the Russian Academy of Sciences. It is distributed free and free. Over the past few years, the described language has been actively proposed to be used in the USE as one of the types of questions.
Language assignment
Algorithmic language is used to solve a fairly wide range of tasks. It is suitable for mastering both mathematical and exercises in other subjects. It should be noted that it is also used for easier study by schoolchildren of similar topics.
Differences between machine and algorithmic languages
The most famous representative of machine-dependent languages is Assembler. During programming on it, a person should clearly indicate to the translator, thanks to special operators, which memory cells should be filled or transferred. Since the syntax of "Assembler" is as close as possible to the computer form of recording, it is quite difficult to study it. That is why the algorithmic language is taught at school, as well as at the beginning of teaching programming in the first year of a higher educational institution.
Standard features
The algorithmic language has special standard functions that have received the status of "built-in". Thanks to them, it is possible to easily write many operations with numbers and expressions without performing routine entries. A program in an algorithmic language is quite simple. Native functions can allow you to calculate the square root, logarithms, module, and so on. The most popular inline methods are as follows:
- absolute abs module (X);
- square root sqrt (X);
- the natural and decimal logarithms of ln (X), log (X);
- minimum and maximum min (X, Y), max (X, Y);
- trigonometric functions sin (X), cos (X), tg (X), ctg (X).
Thanks to this, any programmer or just a person who is learning to work with an algorithmic language can easily write a mathematical problem without resorting to the invention of a bicycle. Thus, it should be noted that this language is quite convenient. It is easy to understand, and also as easy to read. No wonder he was introduced to the school curriculum. Students are happy to study it.