Informatics. Fundamentals of Algorithmization and Programming

To write applications of different difficulty levels, you first need to gain knowledge on how to do this. And it is advisable to start with the very foundation of algorithmization and programming. Here we will talk about them in the framework of the article.

What is computer science?

This is the name of complex technical science, whose task is to systematize the methods of creating, processing, transmitting, storing and reproducing data using computer technology. It also includes the principles of functioning and management methods that help to achieve the goal. The term “computer science” itself is of French origin and is a hybrid of the words “information” and “automation”. It arose due to the development and dissemination of new technologies for the collection, processing and transmission of data that were associated with their fixation on machine media. This is the origin of computer science. The basics of algorithmization and programming are one of the most important areas of this science.

What does she do?

Informatics are faced with the following tasks:

1. Hardware and software support for computer technology.
2. Means of ensuring the interaction of man and computer components with each other.

The term “interface” is often used to refer to the technical part. Here we have an arbitrary program. The basics of algorithmization and programming are always used when creating mass distribution products that “should” win a wide audience. Indeed, for popularity, the developed application should work optimally and look.

Presentation of Algorithms

They can be recorded in a significant number of ways. The most popular are the following:

1. Verbal and formulaic description. It implies the placement of text and specific formulas that will explain the features of interaction in all individual cases.
2. Flowchart. It implies the presence of graphic symbols that make it possible to understand the features of the interaction of the program within itself and with other applications or the hardware component of the computer. Each of them can be responsible for a separate function, procedure or formula.
3. Algorithmic languages. It implies the creation of separate description methods for specific cases that show the features and sequence of tasks.
4. Operator schemes. The creation of a prototype is implied - it will show the interaction based on the paths that the individual operands will go through.

Pseudocode Sketch of the backbone of the program.

Writing algorithm

How to start creating your prototype of a program, function or procedure? To do this, it is enough to use the following general recommendations:

1. Each algorithm should have its own name, which explains its meaning.
2. Be sure to take care of the presence of a beginning and an end.
3. The input and output data should be described.
4. It is necessary to indicate the commands with which certain actions will be performed on specific information.

Recording Methods

There can be as many as five representations of the algorithm. But here are just two ways to record:

1. Formal verbal. It is characterized by the fact that the description is made mainly using formulas and words. The content, as well as the sequence of stages of the algorithm in this case is written in a natural professional language in any form.
2. Graphic. Most common. For it, block symbols or algorithms are used. The connection between them is shown using special lines.

We develop a program structure

Three main types can be distinguished:

1. Linear. With this structure, all actions are performed sequentially in the order of the queue and only once. The scheme looks like a sequence of blocks located from top to bottom, depending on the order of their execution. The resulting primary and intermediate data cannot affect the direction of the computing process.
2. Branching. Found wide application in practice, when solving complex problems. So, if it is necessary to take into account the initial conditions or intermediate results, then the necessary calculations are performed in accordance with them and the direction of the computational process may vary depending on the result obtained.

Cyclical. To facilitate the work with many tasks, it makes sense to repeat several sections of the program code. In order not to prescribe how many times and what needs to be done, a cyclic structure is used. It provides for the existence of a sequence of commands that will be repeated until the specified condition is met. Using loops can significantly reduce the complexity of writing a program.

Programming

It is important to choose a programming language in which programs will be created. It should be noted that many of them are “sharpened” for specific working conditions (for example, in a browser). In general, programming languages ​​are divided into two groups:

1. Functional.
2. Operator:

- not procedural;

- procedural.

Can you guess which ones are most often used? Operator-procedural is the answer. They can be machine oriented or independent. The former include assemblers, auto codes, symbolic coding. Independents divide based on their orientation:

• procedural;
• problematic;
• object

Each of them has its own scope. But for writing programs (useful applications or games), object-oriented languages ​​are most often used. Of course, you can take advantage of others, but the fact is that they are the most elaborated for the creation of final consumer products for the masses. Yes, and if you don’t yet have an accurate vision of where to start, I suggest paying attention to the basics of algorithmization and object-oriented programming. Now this is a very popular area in which you can find a lot of educational material. In general, the basics of algorithms and programming languages ​​are now needed because there is a shortage of qualified developers, and their importance will only grow in the future.

Conclusion

When working with algorithms (and subsequently with programs), you should strive to think through all the details to the smallest. Subsequently, the identification of each unworked section of the code will lead only to additional work, an increase in development costs and timelines for the task. Careful planning and development of all the nuances will significantly save time, effort and money. Well, now they can say that after reading this article you have a concept about the basics of algorithmization and programming. It remains only to apply this knowledge. If there is a desire to study the topic in more detail, I can recommend the 2012 book “Fundamentals of Algorithmization and Programming” (Semakin, Shestakov).