1

Algorithmic thinking

Student's name

Group

Identification number

University xxxxxxxxxxxx

School of Sciences xxxxxxxxxxxxx

Subject

August 2022
 2

Introduction

The study of the generalities, characteristics, and phases associated with computational thinking

suggests that the skills that comprise it can be acquired in environments different from the

learning computer programming.

Thus, it can be said that there is a relationship between computational thinking and life.

daily. Just as it says "the natural relationship between thinking skills

computational and everyday activities allow the possibility of

development of those skills during the execution of everyday life activities” (Angulo,

2019).

In the following document, algorithmic thinking will be investigated from its definitions and

supplements, for a correct computational implementation. Considering that the

learning programming is widely known for presenting various difficulties, it is

It is necessary to reflect on different filters for the development of algorithmic thinking.

Knowing the purpose of presenting information that leads to the development of thought

computational when executing a specific activity.

 3

Algorithmic thinking

Algorithmic thinking is, in a way, a blend of skills that

they are connected to the creation and understanding of algorithms. 'Algorithmic thinking has

a strong creative element: the construction of new algorithms that solve problems

data. If someone wants to do this, they need to think algorithmically" (Futschek, 2006). This

the approach includes the following capabilities:

Analyze given problems.

Specify a problem precisely.

Find the basic actions that are suitable for solving the given problem.

Create a correct algorithm to solve a specific problem, using the

basic actions.

Think of all possible outcomes as normal solutions to a problem.

Progressive improvement of an algorithm.

Three clear concepts in logical thinking are evident:

Sequences

They are series of actions developed with specific steps, as they are carried out in a

action after action until all have been carried out.

Ejemplo: Te levantas, tomas agua, te bañas, desayunas, etc.

 4

Conditionals

This classification, instead of following a specific order of events, implements a priori a

question to determine the path to follow.

Example: You are going to brush your teeth and notice that the toothpaste is gone. Conditional:

Do I have more toothpaste?

Cycles

Just like conditionals, loops also ask questions. What changes between these two

Concepts is the same question over and over until the action has been elaborated.

Example: you hammer a nail into a piece of wood. You constantly ask yourself: 'Has it gone in yet?'

nail?

Figure 1

Graphical representation of sequences, conditionals, and loops

In these general concepts, we are broken down into subtopics that allow us to execute the

algorithmic thinking.
 5

Algorithms

An algorithm is a sequence of sequential steps, through which tasks can be carried out.

different processes and respond to specific needs or decisions.

They are ordered and finite sets of steps that allow us to solve a problem or

make a decision." (Editorial team, 2021).

Every algorithm must consist of the following parts:

Input: reception of the data that the algorithm needs to operate.

Process: it includes the formal logical operation that the algorithm will undertake with the

received at the entrance.

Output: The results received from the process on the input, once completed

execution of the algorithm.

Example:

START

Enter the store and look for the men's shoe section.

Take a pair of shoes.

Are they party shoes?

SI: (ir al paso 5) – NO: (volver al paso 3)

Is there the right size?

SI: (ir al paso 6) – NO: (volver al paso 3)

Is the price payable?

SI: (ir al paso 7) – NO: (volver al paso 3)

 6

Buy the chosen pair of shoes.

END

Representation of algorithms

Algorithms are represented in various forms, such as flowcharts, pseudocode.

and programming languages, below we will highlight some of them:

Flowcharts: Flowcharts are a visual illustration of each

sequence of the algorithm using the symbols that implement the executed operations

about the data.

Figure 2

Graphic representation of flowcharts.

 7

Pseudocode

Pseudocode is a detailed informal high-level description of an algorithm that

implement the conventions of a real programming language. The pseudocode is

implemented so that the algorithm can be easily read by a person.

Operator Management

Control structures allow identifying the execution sequence of statements.

There are three types of programming:

Sequence structures:

Allows the execution of program instructions in sequence

Decision structures:
 8

Determines whether to execute a group of instructions or other ones depending on whether a condition is met or not.

determined condition.

Repetitive structures:

They allow for the repeated execution of a specific block of instructions.

Figure 3

Table of sequence, decision, and repetitive relationship.

Arithmetic operators

They are used to perform basic mathematical operations.

Figure 4

Table of arithmetic operators.

 9

Relational Operators

Evaluate conditional expressions, based on the concept of true or false.

Figure 5

Table of relational operators.

 10

Logical Operators

Concatenate two or more expressions with relational operators

Figure 6

Table of logical operators.

Logical expression AND:

Figure 7

Logical AND expression table.

Logical OR expression:

Figure 8
 11

Logical OR expression table.

Operator priority

When different operations are performed in an expression, each part is identified and developed.

in a predetermined order called operator precedence.

When expressions contain operators from more than one category, the operators

arithmetic operations are evaluated first, comparison operators are evaluated next and the

logical operators are evaluated last" (Microsoft, 2022)

Below, the priority of the operators according to their classification is observed:

Figure 9

Operator priority table.

 12

All comparison operators have the same priority; they are evaluated in the order in which

They appear, from left to right.

Conclusions

Algorithmic thinking applied to mathematics is an important tool in

different levels of electronic and computational development, knowing and understanding the

Subtopics and characteristics will aid in the fluency of interpreting this thought.

The three structures are: sequence control, selection control, and control

repetition is the basis of algorithmic thinking, dimensioning oneself in the situation

 13

the particular one that is wanted to be developed will help manage the structures correctly

and effective when programming an algorithm.

Logical operators are used to combine different binary outputs and return a

true, false or null result. As boolean operators, they are implemented in the

development of current technology to an almost total margin, there lies the importance of management

of them.

References

Angulo, J. A. (2019). El pensamiento computacional en la vida cotidiana. 296.

Editorial Team, E. (August 5, 2021). Concept. Retrieved from Algorithm in Computer Science:

[Link]

Futschek. (2006). Algorithmic Thinking: The Key for Understanding Computer Science.
 14

Microsoft. (April 11, 2022). Microsoft. Retrieved from Microsoft:

[Link]

operator precedence